Routing algorithm optimization for software defined network WAN

Author(s):  
Ameer Mosa Al-Sadi ◽  
Ali Al-Sherbaz ◽  
James Xue ◽  
Scott Turner
2018 ◽  
Vol 1 (2) ◽  
pp. 66-76
Author(s):  
Daxin Tian ◽  
Weiqiang Gong ◽  
Wenhao Liu ◽  
Xuting Duan ◽  
Yukai Zhu ◽  
...  

Purpose This paper aims to introduce vehicular network platform, routing and broadcasting methods and vehicular positioning enhancement technology, which are three aspects of the applications of intelligent computing in vehicular networks. From this paper, the role of intelligent algorithm in the field of transportation and the vehicular networks can be understood. Design/methodology/approach In this paper, the authors introduce three different methods in three layers of vehicle networking, which are data cleaning based on machine learning, routing algorithm based on epidemic model and cooperative localization algorithm based on the connect vehicles. Findings In Section 2, a novel classification-based framework is proposed to efficiently assess the data quality and screen out the abnormal vehicles in database. In Section 3, the authors can find when traffic conditions varied from free flow to congestion, the number of message copies increased dramatically and the reachability also improved. The error of vehicle positioning is reduced by 35.39% based on the CV-IMM-EKF in Section 4. Finally, it can be concluded that the intelligent computing in the vehicle network system is effective, and it will improve the development of the car networking system. Originality/value This paper reviews the research of intelligent algorithms in three related areas of vehicle networking. In the field of vehicle networking, these research results are conducive to promoting data processing and algorithm optimization, and it may lay the foundation for the new methods.


2018 ◽  
Vol 14 (10) ◽  
pp. 155014771880568 ◽  
Author(s):  
Wu Jiawei ◽  
Qiao Xiuquan ◽  
Nan Guoshun

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-to-end 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 fine-grained 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.


Author(s):  
Syaifuddin Syaifuddin ◽  
Muhamad Fathul Azis ◽  
Fauzi Dwi Setiawan Sumadi

Multipath routing is a path search method used as a data transmission process utilizing more than one available path on a network. The multipath routing concept is directed to substitute the single path routing concept for reducing network traffic congestion by distributing data transmission through several available paths. It can be implemented in the Software Defined Network (SDN) environment that separates the control plane and the data plane, which provides flexibility by deploying application-based solutions to resolve the problem. This paper is directed to implement the modified Deep First Search (DFS) multipath routing algorithm and compare the proposed method with Dijkstra and normal DFS multipath algorithm. The contribution was designed by combining the node, edge, path, and bucket weight using port statistics available in OpenFlow standard and manual calculation. The results of the system’s emulation showed that the overall algorithm could determine more than one path for the data transmission process. The average execution time on all algorithms produced 0.0903 ms for the modified DFS multipath algorithm, 0.0858 ms for DFS multipath algorithm, and 0.901 ms Dijkstra multipath algorithm, respectively. The QoS parameter testing results illustrated that the proposed method was better than another multipath routing algorithm in terms of throughput and jitter. However, based on packet loss percentage, the modified method was placed after normal DFS but still generated better results than Dijkstra. Overall, the implement multipath routing concept in SDN with all algorithms could be deployed to provide more than one data transmission path.


2019 ◽  
Vol 13 (2) ◽  
pp. 179-185 ◽  
Author(s):  
Wu Jiawei ◽  
Qiao Xiuquan ◽  
Junliang Chen

Sign in / Sign up

Export Citation Format

Share Document