Dynamic and adaptive multi-path routing algorithm based on software-defined network

Abstract

Recently, there has been a surge of the video services over the Internet. However, service providers still have difficulties in providing high-quality video streaming due to the problem of scheduling efficiency and the wide fluctuations of end-toend delays in the existing multi-path algorithms. To solve these two problems affecting video transmission quality, networks are expected to have the capability of dynamically managing the network nodes for satisfying quality-of-service requirements, which is a challenging issue for media streaming applications. Against this changing network landscape, this article proposes a dynamic and adaptive multi-path routing algorithm under three constraints (packet loss, time delay, and bandwidth) that are based on software-defined network for centralized routing computations and real-time network state updating in multimedia applications. Compared with related multi-path routing proposals, dynamic and adaptive multi-path routing makes efficient use of the latest global network state information achieved by the OpenFlow controller and calculates the optimal routes dynamically according to the real-time status information of the link. Moreover, our proposed algorithm can significantly reduce the computational overhead of the controller while completing a finegrained flow balance. Experimental results show that dynamic and adaptive multi-path routing significantly outperforms other existing scheduling approaches in achieving a 35%-70% improvement in quality-of-service.

QROUTE: An Efficient Quality of Service (QoS) Routing Scheme for Software-Defined Overlay Networks

“…They only incorporate the latency of the paths while making their routing decisions. In [14], the authors propose a multipath routing algorithm that finds a path of least cost that satisfies the delay and bandwidth constraint. However, these approaches have high route computation time and a large number of forwarding entries because of generating routes for every source-destination pair and QoS policy.…”

“…One of the main challenges in software-defined overlay networks is the fast-changing overlay link QoS characteristics because of various reasons like the change in the corresponding path in the physical network or the change in non-overlay back-ground Internet traffic [14]. However, the existing routing algorithms for satisfying multiple QoS constraints in software-defined overlay networks involve high route computation time and thus these routing algorithms cannot adapt to the fast-changing overlay link QoS characteristics [8]- [20].…”

Evolution of wireless sensor network design from technology centric to user centric: An architectural perspective

“…Jiawei et al 45 have presented adaptive communication architecture for WSNs which resolves the problem of communication in heterogeneous networks. The architecture adapts a wide range of communication mechanisms from the transport layer to the MAC layer without changing the protocols or applications.…”

Time-Dependent Performance of a Multi-Hop Software Defined Network

“…Thus, in [12], conventional routing protocols such as RIP, OSPF, EIGRP, and BGP, are compared with SDN with respect to convergence times after link failures, showing that SDN routing is better than conventional IP networks. Considerable work has also shown that SDN can select routing paths based on criteria such as quality of service (QoS) [13][14][15][16], while energy-aware SDN routing has also been discussed in several papers [17][18][19].…”