BIUSTRE

Delay bounded multi-source multicast in software-defined networking

Show simple item record

dc.rights.license CC BY 4.0
dc.contributor.author Semong, Thabo
dc.contributor.author Xie, Kun
dc.contributor.author Zhou, Xuhui
dc.contributor.author Singh, Hemant Kumar
dc.contributor.author Li, Zhetao
dc.date.accessioned 2020-10-01T11:59:20Z
dc.date.available 2020-10-01T11:59:20Z
dc.date.issued 2018-01-21
dc.identifier.citation Semong, T. et al (2018) Delay bounded multi-source multicast in software-defined networking. Electronics, 7 (1), 10. https://doi.org/10.3390/electronics7010010. en_US
dc.identifier.issn 2079-9292
dc.identifier.uri http://repository.biust.ac.bw/handle/123456789/227
dc.description This article is an open access article distributed under the terms and conditions of the CC BY 4.0. en_US
dc.description.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. en_US
dc.language.iso en en_US
dc.publisher MDPI AG en_US
dc.subject Multicast en_US
dc.subject Software-defined networking en_US
dc.subject Multi-source en_US
dc.subject Steiner tree en_US
dc.subject Routing en_US
dc.subject Bounded delay en_US
dc.title Delay bounded multi-source multicast in software-defined networking en_US
dc.description.level phd en_US
dc.description.accessibility unrestricted en_US
dc.description.department cis en_US


Files in this item

Icon
Name: Semong_E_2018.pdf
Size: 1.144Mb
Format: PDF
View/Open

This item appears in the following Collection(s)

  • Faculty of Sciences
    This collection is made up of pre and post research articles created by both staff and students from Faculty of Sciences

Show simple item record

Search BIUSTRE


Browse

My Account