Providing Delay-Guaranteed Multicast Transmission Services for an SDN-Based Publish/Subscribe System  

作　　者：Yali Wang Shuangxi Hong Junna Zhang 

机构地区：[1]College of Computer and Information Engineering,Henan Normal University,Xinxiang 450002,China [2]Engineering Laboratory of Intellectual Business and Internet of Things Technologies,Henan Province,China

出　　处：《China Communications》2019年第12期176-187,共12页中国通信（英文版）

基　　金：supported in part by the National Natural Science Foundation of China under Grants U1804164, 61902112 and U1404602;in part by the Science and Technology Foundation of Henan Educational Committee under Grants 19A510015, 20A520019 and 20A520020;the Doctoral Research Project of Henan Normal University under Grant 5101119170149

摘　　要：Providing end-to-end delay guarantees in traditional Internet is a complex task due to the distributed nature of TCP/IP protocols. Software Defined Networking(SDN) gives a new dimension to improve QoS(Quality of Service) as it can benefit from its flexibility, programmability and centralized view. In this paper, we provide delay-guaranteed data transmission service instead of "best efforts" service for a topic-based publish/subscribe system by means of exploring these specific features of SDN. We attribute this routing problem in such conditions to Delay-Constraint Lowest Cost Steiner Tree(DCLCST) problem. To solve it, we compute the shortest delay paths from source node to every subscribe node and the shortest cost paths from every subscribe node to any other node using dijkstra algorithm. Then we construct a delay-constraint least cost steiner tree for per-topic based on these paths as multicast tree. We also present experimental results to demonstrate the effectiveness of the algorithms and methods we proposed.Providing end-to-end delay guarantees in traditional Internet is a complex task due to the distributed nature of TCP/IP protocols. Software Defined Networking(SDN) gives a new dimension to improve QoS(Quality of Service) as it can benefit from its flexibility, programmability and centralized view. In this paper, we provide delay-guaranteed data transmission service instead of "best efforts" service for a topic-based publish/subscribe system by means of exploring these specific features of SDN. We attribute this routing problem in such conditions to Delay-Constraint Lowest Cost Steiner Tree(DCLCST) problem. To solve it, we compute the shortest delay paths from source node to every subscribe node and the shortest cost paths from every subscribe node to any other node using dijkstra algorithm. Then we construct a delay-constraint least cost steiner tree for per-topic based on these paths as multicast tree. We also present experimental results to demonstrate the effectiveness of the algorithms and methods we proposed.

关 键 词：minimum steiner tree multicast routing publish/subscribe system overlay network 

分 类 号：TP393.09[自动化与计算机技术—计算机应用技术]