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 Servi...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.展开更多
The prevalent multi-copy routing algorithms in mobile opportunistic networks(MONs)easily cause network congestion.This paper introduces a disjoint-path(DP)routing algorithm,where each node can only transmit packets on...The prevalent multi-copy routing algorithms in mobile opportunistic networks(MONs)easily cause network congestion.This paper introduces a disjoint-path(DP)routing algorithm,where each node can only transmit packets once except the source node,to effectively control the number of packet copies in the network.The discrete continuous time Markov chain(CTMC)was utilized to analyze the state transition between nodes,and the copy numbers of packets with the DP routing algorithm were calculated.Simulation results indicate that DP has a great improvement in terms of packet delivery ratio,average delivery delay,average network overhead,energy and average hop count.展开更多
基金supported in part by the National Natural Science Foundation of China under Grants U1804164, 61902112 and U1404602in part by the Science and Technology Foundation of Henan Educational Committee under Grants 19A510015, 20A520019 and 20A520020the 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.
基金the National Natural Science Foundation of China under Grants U1804164,61902112 and U1404602in part by the Science and Technology Foundation of Henan Educational Committee under Grants 19A510015,20A520019,20A520020.
文摘The prevalent multi-copy routing algorithms in mobile opportunistic networks(MONs)easily cause network congestion.This paper introduces a disjoint-path(DP)routing algorithm,where each node can only transmit packets once except the source node,to effectively control the number of packet copies in the network.The discrete continuous time Markov chain(CTMC)was utilized to analyze the state transition between nodes,and the copy numbers of packets with the DP routing algorithm were calculated.Simulation results indicate that DP has a great improvement in terms of packet delivery ratio,average delivery delay,average network overhead,energy and average hop count.