ScholarLens Back to search
2018•Proceedings of the 2018 International Conference on Mechanical, Electronic, Control and Automation Engineering (MECAE 2018)Open access

Top-K Routing Algorithm Based on Bandwidth Utilization in SDN

Erwei Ye, Zhaohua Long, Ruifang Dong

Open full text 0 citations

Abstract

Because of the tight coupling between the traditional network control layer and the data layer, the path allocation algorithm has poor globality and lack of real-time, and distribution of network traffic is unbalanced, which leads to network congestion.To solve the problem, according to the advantages of SDN centralized control and transparency, a Top-K routing algorithm based on Bandwidth utilization (Top-KRA-BU) is proposed.The algorithm calculates K available paths from the source nodes to the destination nodes in real time, and based on the bandwidth utilization, the K paths are evaluated, and the optimal forwarding path is selected.The experimental results show that the routing algorithm is superior to shortest path first (SPF) routing algorithm in the network bandwidth utilization.

Open-access reader

About this research paper

What this paper is about

Because of the tight coupling between the traditional network control layer and the data layer, the path allocation algorithm has poor globality and lack of real-time, and distribution of network traffic is unbalanced, which leads to network congestion.To solve the problem, according to the advantages of SDN centralized control and transparency, a Top-K routing algorithm based on Bandwidth utilization (Top-KRA-BU) is proposed.The algorithm calculates K available paths from the source nodes to the destination nodes in real time, and based on the bandwidth utilization, the K paths are evaluated, and the optimal forwarding path is selected.The experimental results show that the routing algorithm is superior to shortest path first (SPF) routing algorithm in the network bandwidth utilization.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Because of the tight coupling between the traditional network control layer and the data layer, the path allocation algorithm has poor globality and lack of real-time, and distribution of network traffic is unbalanced, which leads to network congestion.To solve the problem, according to the advantages of SDN centralized control and transparency, a Top-K routing algorithm based on Bandwidth utilization (Top-KRA-BU) is proposed.The algorithm calculates K available paths from the source nodes to the destination nodes in real time, and based on the bandwidth utilization, the K paths are evaluated, and the optimal forwarding path is selected.The experimental results show that the routing algorithm is superior to shortest path first (SPF) routing algorithm in the network bandwidth utilization.

Key concepts: Computer science, Routing algorithm, Bandwidth (computing), Routing (electronic design automation), Computer network, Network routing, Algorithm, Distributed computing

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
Top-K Routing Algorithm Based on Bandwidth Utilization in SDN — Research Paper | ScholarLens