RPA-RA: A Resource Preference Aware Routing Algorithm in Software Defined Network

2014 ◽  
Author(s):  
Defang Lee ◽  
Peilin Hong ◽  
Jianfei Li
Keyword(s):  
Routing Algorithm ◽  
Software Defined Network ◽  
Resource Preference

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

2018 ◽  
Vol 14 (10) ◽  
pp. 155014771880568 ◽  
Author(s):  
Wu Jiawei ◽  
Qiao Xiuquan ◽  
Nan Guoshun
Keyword(s):  
Quality Of Service ◽  
Real Time ◽  
Video Transmission ◽  
Service Providers ◽  
Routing Algorithm ◽  
Global Network ◽  
Software Defined Network ◽  
Network State ◽  
Computational Overhead

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.

scholarly journals Comparison Analysis of Multipath Routing Implementation in Software Defined Network

2021 ◽  
Author(s):  
Syaifuddin Syaifuddin ◽  
Muhamad Fathul Azis ◽  
Fauzi Dwi Setiawan Sumadi
Keyword(s):  
Data Transmission ◽  
Traffic Congestion ◽  
Routing Algorithm ◽  
Multipath Routing ◽  
Software Defined Network ◽  
Transmission Process ◽  
Modified Method ◽  
Edge Path ◽  
Path Search ◽  
Manual Calculation

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.

scholarly journals PDMR: priority-based dynamic multi-path routing algorithm for a software defined network

2019 ◽  
Vol 13 (2) ◽  
pp. 179-185 ◽  
Author(s):  
Wu Jiawei ◽  
Qiao Xiuquan ◽  
Junliang Chen
Keyword(s):  
Routing Algorithm ◽  
Software Defined Network

scholarly journals A hierarchical adaptive routing algorithm of wireless sensor network based on software-defined network

2018 ◽  
Vol 14 (8) ◽  
pp. 155014771879461 ◽  
Author(s):  
Zhong-Nan Zhao ◽  
Jian Wang ◽  
Hong-Wei Guo
Keyword(s):  
Wireless Sensor Network ◽  
Target Tracking ◽  
Sensor Network ◽  
Routing Algorithm ◽  
Optimal Path ◽  
Adaptive Routing ◽  
Wireless Sensor ◽  
Software Defined Network ◽  
Test Bed ◽  
Problem Model

The target tracking issue has always been the hotspot in wireless sensor network, and with the emergence of new application in multimedia and real-time transmission, new requirements are proposed for transmission performance of target tracking routing; therefore, a software-defined network–based hierarchical adaptive routing algorithm of wireless sensor network is proposed in this article. The algorithm takes into account both network energy and throughput, uses Hopfield neural network algorithm to calculate the optimal path among adjacent clusters as a local routing (LR), and builds the Multi-choice Knapsack Problem model based on local paths to realize end-to-end global routing, in order to realize the routing of tracking target information under multi-objective conditions. The test bed includes physical and simulation tests. Experimental results show that the proposed algorithm is superior to low energy adaptive clustering hierarchy (LEACH) and Sequential Assignment Routing under different test scenarios.

Sign in / Sign up

Export Citation Format

Share Document