Abstract
Software-Defined Networking (SDN) is the next generation network architecture with exciting application prospects. The control function in SDN is decoupled from the data forwarding plane, hence it provides a new centralized architecture with flexible network resource management. Although SDN is attracting much attention from both industry and research, its advantage over the traditional networks has not been fully utilized. Multicast is designed to deliver content to multiple destinations. The current traffic engineering in SDN focuses mainly on unicast, however, multicast can effectively reduce network resource consumption by serving multiple clients. This paper studies a novel delay-bounded multi-source multicast SDN problem, in which among the set of potential sources, we select a source to build the multicast-tree, under the constraint that the transmission delay for every destination is bounded. This problem is more difficult than the traditional Steiner minimum tree (SMT) problem, since it needs to find a source from the set of all potential sources. We model the problem as a mixed-integer linear programming (MILP) and prove its NP-Hardness. To solve the problem, a delay bounded multi-source (DBMS) scheme is proposed, which includes a DBMS algorithm to build a minimum delay cost DBMS-Forest. Through a MATLAB experiment, we demonstrate that DBMS is significantly more efficient and outperforms other existing algorithms in the literature.
Highlights
As a promising centralized control architecture, Software-defined networking (SDN) enabled by OpenFlow protocol, allows the control plane to be programmable for effective optimization of the network resources and support various network dynamics [1,2,3]
We demonstrate the delay bounded multi-source (DBMS) scheme routing with respect to total delay cost, execution time, multicast nodes and delay bound for each individual deployment of the network
Recent studies on traffic engineering and multicast protocols on SDN mostly focus on single source multicast
Summary
As a promising centralized control architecture, Software-defined networking (SDN) enabled by OpenFlow protocol, allows the control plane to be programmable for effective optimization of the network resources and support various network dynamics [1,2,3]. The SMT with the least delay cost among such multicasts just acts as the DBMS of the multi-source multicast This way, suffers from the complexity of solving a set of NP-hard SMT problems. DBMS algorithm seeks shared nodes among such paths to enhance the possibility of aggregating more links It can reduce the number of employed links while ensuring that the delivered content reaches each destination within an acceptable delay. We propose a DBMS algorithm to ensure that a destination node connect to the potential source node through a minimum delay cost path. Out of the source nodes set, the DBMS algorithm selects a particular potential source based on the total delay cost from the destination node.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
