Analysing the Performance of Destination Driven Multicast Routing Algorithm

Without knowing the sender and receiver addresses, the internet's architecture currently has a problem routing information based on what the receiver is interested in. The Publish-Subscribe paradigm was implemented as a result. In this network, we constructed and used a destination-driven multicast routing algorithm to determine the shortest path in the network for the design, construction, and assessment of the Publish-Subscribe network. The networks have a Router to execute the routing mechanism, the publisher is the information producer, and the subscriber is the information consumer, all of whom have different types of modules to help them accomplish their functions. Every connection in the network is a bidirectional communication channel (an undi-rected graph) with a network-wide random seed. A topology management module is built into each Router and is used to create a picture of the networks and calculate the available path. It instructs the forwarder to convey the network's information to the targeted recipient. The subscriber or publisher provides network information to the record table module via link state advertisement, which subsequently notifies the topology management. The main aim of the study was to evaluate the destination-driven multicast routing algorithm in terms of generating bit and send, delay, and throughput in the proposed network. The receiver and sender in this network do not expect to be available at the same time, do not know each other's addresses, and do not employ any block mechanisms or client send requests and server replay responses. The Publish-Subscribe network is established and constructed sufficiently before being deployed and assessed using the destination-driven multicast routing algorithm (DDMC) to select the shortest path in the network and active matches published information. The proposed work was evaluated via total bit (produced 1000000 bits per second), and throughput was 83.33%.