Comparison of DDMC and Dijkstra Algorism on Topology Management in Large Publish-Subscribe Paradigm
Cheru Haile, Shaik Janbhasha, Solomon Aregawi · International Journal of Networks and Communications · 2020
Now a day the architecture of internet has a problem for information route based on receiver interested in without knowing the sender and receiver address. Due to this reason new paradigm was introduced that is Publish-Subscribe. In Publish-Subscribe the receiver and sender do not expect to be active at the same time, do not know the address of each other, and do not use any blocking mechanism or client send request and server replay response. First the Publish-Subscribe network is built and designs enough the model then conduct implementation and evaluation of Publish-Subscribe network via destination driven multicast routing algorithm (DDMC) for selecting the shortest path in the network. Basically, the networks have Router to perform routing mechanism. The publisher is the producer of information. And the subscriber is the consumer of information with their own deferent type of module for facilitating their function. Every connection in the network is bidirectional way of communication (an undirected graph) with random seed available in the network. Each Router has topology management module for creating a picture of the networks and computing the available path. It informs to the forwarder in order to send the information of network for intended receiver. Record table module used for recording of the network information comes from the subscriber or the publisher via link state advertisement then it informs to the topology manager. Lastly, the comparison performance of Dijkstra algorithm with destination driven multicast routing algorithm (DDMC) in the large numbers of clients participated evaluate via total bits per second minimize 2.7% from the total bit and average delivery ratio DDMC was 87.1% but Dijkstra was 71.3%. So performance of destination driven multicast routing algorithm (DDMC) algorithm was good rather than Dijkstra algorithm.