Analyzing Multicast Routing Algorithms on Software Defined Network
Sabila Nawshin, Sarah Ahsin, Iffat Jahan, Rabaya Jalal Moon, A.K.M. Mazharul Haque, Nasif Muslim, Salekul Islam · 2020 IEEE Region 10 Symposium (TENSYMP) · 2020
The existing Internet is a network consisting of several routers and communication links, where each of the routers has the information about its adjacent routers only. As a result, the algorithms in practice are decentralized and work in a distributed setting. When forwarding a packet from a single source to multiple destinations, multicasting is the concept of sending only one packet for the common path between the source and the destinations and replicating it when the paths are divided. As the routing algorithms operate only on localized information in the present network, multicasting is a difficult task to implement. Software Defined Network (SDN) provides us with a centralized view of the whole topology, opening up the opportunity to deploy more complex and efficient algorithms for multicasting. Much research has already been carried out on this field based on various dimensions of SDN. In this paper, we reviewed some of the existing algorithms associating with our target. We also tested the existing routing algorithms on SDN and conducted a comparative analysis among the algorithms to determine which one would efficiently deploy multicast routing.