Analysing the Performance of Destination Driven Multicast Routing Algorithm


The architecture of the internet now struggles to route information depending on the interests of the recipient without knowing the sender and receiver addresses. As a result, the Publish-Subscribe paradigm was used. For the design, building, and evaluation of the Publish-Subscribe network in this network, we developed and applied a destination-driven multicast routing algorithm to identify the network’s shortest path. The publisher is the information producer, the subscriber is the information consumer, and the networks have a router to carry out the routing mechanism. Each of these entities has a variety of modules to enable them carry out their respective tasks. With a network-wide random seed, every connection in the system functions as a bidirectional communication channel (an undi-rected graph). Each router has a topology management module that is used to map out the networks and determine the best route. It gives the forwarder instructions on how to communicate network information to the intended receiver. Through link state advertisement, the subscriber or publisher transmits network data to the record table module, which then alerts the topology management. The primary objective of the study was to assess how the proposed network’s destination-driven multicast routing algorithm performed in terms of bit generation and transmit, latency, and throughput. In this network, the sender and receiver do not know each other’s addresses, they do not anticipate being accessible at the same time, and they do not use any block mechanisms or client send requests and server replay answers. The destination-driven multicast routing algorithm (DDMC), which chooses the shortest path through the network and looks for active matches released information, is used to evaluate the publish-subscribe network’s readiness for deployment once it has been suitably created and built. The suggested work’s throughput was 83.33 percent when measured by total bit, which created 1000000 bits per second.

Author (s) Details:

Cheru Haile,
Department of Information Technology, Assosa University, Assosa, 18, Ethiopia.

Yimer Amedie,
Department of Information Technology, Assosa University, Assosa, 18, Ethiopia.

Yimenu Atinaf,
Ethiotelecom IT Operation and Maintenance Supervisor, Assosa, Ethiopia.

Please see the link here:

Keywords: Publish-subscribe, DDMC, link-state.

Leave A Comment