Back to Search
Start Over
Improved algorithm of cloud service node path based on cross-border transaction platform under load balancing
- Source :
- Computer Communications. 177:195-206
- Publication Year :
- 2021
- Publisher :
- Elsevier BV, 2021.
-
Abstract
- Cross-border trading platforms study logistics from the perspective of the network, involving all links in the network and the supply chain. The network status is constantly changing, and the acquisition and analysis of the real-time status of each link on the transaction path can further improve the accuracy of the optimal path selection. Meanwhile, traditional networks can no longer adapt to the rapid development of today’s network technology and applications due to their rigid structure and simplified functions. As for traditional networks and their associated network equipment, problems such as inconvenient management and monitoring, poor interoperability, difficulty in expanding network functions, and high operating costs have severely hindered the efficiency of network functions and the pace of innovation. In order to solve many problems faced by traditional networks, in the paper, an SDN network path selection algorithm based on the dual impact factors of cloud service nodes is proposed. In the algorithm proposed in the paper, the final selected path is considered to be composed of multiple links. First, a cloud environment based on the Ryu controller is build, and a corresponding data collection strategy is constructed to complete the acquisition of the link available bandwidth and delay that affect the real-time status of the path. Then, the weighted results are calculated according to the proposed candidate path weight distribution formula to realize the sorting and screening of each transaction link, and provide support for the selection of the cross-border transaction system service path with load balance. The simulation results show that compared with the traditional DLB algorithm, the algorithm proposed in the paper has better load balancing performance, which further shows that the proposed algorithm has a better choice for the path.
Details
- ISSN :
- 01403664
- Volume :
- 177
- Database :
- OpenAIRE
- Journal :
- Computer Communications
- Accession number :
- edsair.doi...........5048f48ef026511287a16a92f989d965