Multicast tree construction algorithm for dynamic traffic on software defined networks

Area of Science:

• Computer Science
• Network Engineering

Background:

• Multicast communication in Software Defined Networks (SDN) is often treated statically, overlooking dynamic group memberships.
• Existing research inadequately addresses the challenges of dynamic participant changes (joins/leaves) in multicast groups.
• Dynamic traffic in multicast necessitates efficient methods for managing group membership and minimizing network disruptions.

Purpose of the Study:

• To propose a novel multicast tree construction algorithm for SDN environments.
• To address the dynamic nature of multicast communication, particularly group membership changes.
• To minimize tree alterations and optimize multicast paths in both static and dynamic network conditions.

Main Methods:

• Developed a multicast tree construction algorithm considering receiving devices and network capabilities.
• Utilized Dijkstra's Shortest Path algorithm for initial multicast tree formation.
• Processed the Shortest Path Tree to reduce hop count and path cost for efficient routing.

Main Results:

• The proposed algorithm effectively manages dynamic joins and leaves with minimal tree alteration.
• Achieved reduced hop counts and improved path costs in multicast communication.
• Demonstrated efficient resource utilization and enhanced communication quality in static and dynamic scenarios.
• Generated a stable common path for multicast communication.

Conclusions:

• The proposed algorithm offers an efficient solution for dynamic multicast communication in SDN.
• It successfully balances dynamic group management with network stability and performance.
• The method provides a practical approach to optimizing multicast traffic in complex network environments.