Next Article in Journal
Low-Complexity PAPR Reduction Scheme Combining Multi-Band Hadamard Precoding and Clipping in OFDM-Based Optical Communications
Previous Article in Journal
Automatic EMI Filter Design for Power Electronic Converters Oriented to High Power Density
Article Menu
Issue 1 (January) cover image

Export Article

Open AccessArticle
Electronics 2018, 7(1), 10; doi:10.3390/electronics7010010

Delay Bounded Multi-Source Multicast in Software-Defined Networking

College of Computer Science and Electronics Engineering, Hunan University, Changsha 410006, China
College of Science, Botswana International University of Science and Technology (BIUST), PO Box 552 Palapye, Botswana
College of Information Engineering, Xiangtan University, Yuhu, Xiangtan 411105, Hunan, China
Author to whom correspondence should be addressed.
Received: 21 December 2017 / Revised: 17 January 2018 / Accepted: 19 January 2018 / Published: 21 January 2018
View Full-Text   |   Download PDF [1172 KB, uploaded 21 January 2018]   |  


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. View Full-Text
Keywords: multicast; software-defined networking; multi-Source; steiner tree; routing; bounded delay multicast; software-defined networking; multi-Source; steiner tree; routing; bounded delay

This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. (CC BY 4.0).

Scifeed alert for new publications

Never miss any articles matching your research from any publisher
  • Get alerts for new papers matching your research
  • Find out the new papers from selected authors
  • Updated daily for 49'000+ journals and 6000+ publishers
  • Define your Scifeed now

SciFeed Share & Cite This Article

MDPI and ACS Style

Semong, T.; Xie, K.; Zhou, X.; Singh, H.K.; Li, Z. Delay Bounded Multi-Source Multicast in Software-Defined Networking. Electronics 2018, 7, 10.

Show more citation formats Show less citations formats

Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Related Articles

Article Metrics

Article Access Statistics



[Return to top]
Electronics EISSN 2079-9292 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top