MPLS Network Routing Algorithm Based on Network Minimum Cost
Fanyi Chen, Yanfang Fu, Ying Lu, Hua Zhong Xiang · 2022
In order to overcome the network congestion and routing conflicts caused by the surge in the number of network access nodes and the variety of services, this paper proposes a routing algorithm based on minimum cost deployed in MPLS networks. The minimum cost routing algorithm uses MPLS technology to obtain the data information of each node's business in the network to calculate a new cost function. According to this cost function, the path of data propagation is planned, and the network resources are allocated in a balanced manner. While improving the utilization rate of network resources, the conflict of route selection between services is avoided, and the possibility of network failures is reduced. This method effectively improves the network performance. The experimental results show that, compared with the traditional SPF routing algorithm, the LCR algorithm can better balance the network load, improve the utilization of resources in the network, and meet the service quality required by the user's business. It is an efficient and simple routing algorithm and has certain research prospects.