Skip to Main Content
This paper presents a new dynamic link weight (DLW) routing algorithm for calculating label switched paths (LSPs) in multiple protocol label switching (MPLS) networks. The routing algorithm takes early precautions to avoid using up the capacity of any congested links when alternative lower loaded paths are available. This algorithm is effective in minimizing the traffic demand reject probability, therefore increasing the throughput. Its complexity is low, making it scalable for large networks and suitable for on-line routing calculations in such networks.