Multicast tree construction algorithm for dynamic trafc on software defned networks

Bijur, Gururaj and Ramakrishna, M and Kotegar, Karunakar A (2021) Multicast tree construction algorithm for dynamic trafc on software defned networks. Scientific Reports, 11. ISSN 2045-2322

[img] PDF
14006.pdf - Published Version
Restricted to Registered users only

Download (3MB) | Request a copy
Official URL:


Dynamic trafc of multicast communication in the Software Defned Network environment focused less though it is more natural and practical. In multicast communication, the trafc is dynamic due to the dynamic group memberships (i.e., participants join and leave the group anytime), which are not explored much in the previous research works. The multicast in dynamic trafc requires a method to handle dynamic group membership and minimum tree alteration for every join and leave of participants from the multicast group. This paper proposes a multicast tree construction algorithm, which considers receiving devices and network capability as base parameters to construct the multicast path. The proposed routing method uses Dijkstra’s Shortest Path algorithm for initial tree formation, identifes a multicast path, and processes the Shortest Path Tree to reduce the overall hop count and path cost. The multicast tree generated by the proposed enables the dynamic join and leaves of participating devices with reduced tree alteration using more common paths to reach the devices. The implementation and results show that the proposed method works efciently in resource utilization with a reduced hop count and quality for multicast communication in static and dynamic scenarios. Also, the results demonstrate that the proposed method generates a stable common path for multicast communication.

Item Type: Article
Subjects: Engineering > MIT Manipal > Computer Science and Engineering
Engineering > MIT Manipal > Information and Communication Technology
Engineering > MIT Manipal > MCA
Depositing User: MIT Library
Date Deposited: 20 Jan 2022 06:41
Last Modified: 20 Jan 2022 06:41

Actions (login required)

View Item View Item