Multi-source Routing in Software-Defined Networks
1. We firstly studied a novel delay-bounded multi-source multicast Software-Defined Network 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. We modeled the problem as a MILP and prove its NP-Hardness. To solve the problem, a delay bounded multi-source (DBMS) scheme was proposed, which includes a DBMS algorithm to build a minimum delay cost DBMS-Forest. The DBMS algorithm ensures that every destination node connect to one and only one source node. All potential source nodes are directly connected to the virtual source node that then act as a super source.
2. We then proposed an efficient load balancing and multicasting scheme for uncertain-source Software-Defined Network, using current link cost monitoring. We considered load balance, bandwidth utilization, tree building and the process of uncertain-source selection. We named this scheme RTLMUS (Real-Time Link Monitoring Uncertain-Source). We then ensured that each destination node connect to just one potential source node. In the presented SDN controller architecture, all multicast routing calculations work off a single view of the network state maintained by the controller。 The controller learns the network state through a combination of LLDP polling (for topology discovery), and OpenFlow statistic polling (for traffic state discovery). This unified network view may still contain stale network state due to network delays, but routing calculations will always be performed using a consistent view of the network state, and no convergence delays are incurred by traffic state or topology changes.
3. Lastly, we have presented Multi-Source Multicast Energy-Aware Routing (MSM-EAR) for Software-Defined Network. Prior works on classical energy-aware routing focused more on single-source multicast and assumed that the table of OpenFlow switch can hold an infinite number of rules. In practice, this assumption does not hold since the flow table is implemented with Ternary Content Addressable Memory (TCAM) which is expensive and power-hungry. To address this problem, we have proposed an optimization method to minimize energy consumption for a backbone network while at the same time respecting the capacity on network links and rule space constraints on routers. We also formulated the problem using Integer Linear Program (ILP) and introduced efficient greedy heuristic algorithm.
 Semong, Thabo, Kun Xie, Xuhui Zhou, Hemant Kumar Singh, and Zhetao Li. "Delay Bounded Multi-source Multicast in Software-Defined Networking." Electronics 7, no. 1 (2018): 10. (SCIE Journal)
 Semong, Thabo, and Kun Xie. "Efficient Load Balancing and Multicasting for Uncertain-Source SDN: Real-Time Link-Cost Monitoring." In Computer Science On-line Conference, pp. 178-187. Springer, Cham, 2018. (EI Conference)
Semong, Thabo and Kun Xie. "Multi-Source Multicast with Energy-aware Routing for Software-Defined Networking." (Under review)
版权所有©湖南大学2017 湖南大学党委宣传部 地址：湖南省长沙市岳麓区麓山南路麓山门 邮编：410082 Email：email@example.com 域名备案信息：[www.hnu.edu.cn,www.hnu.cn/湘ICP备05000239号] [hnu.cn 湘教QS3-200503-000481 hnu.edu.cn 湘教QS4-201312-010059]