By Topic

New dynamic link weight algorithm for on-line calculation of LSPS in MPLS networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Pham, H. ; James Cook Univ., Townsville, Qld., Australia ; Lavery, B.

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.

Published in:

Communication Systems, 2002. ICCS 2002. The 8th International Conference on  (Volume:1 )

Date of Conference:

25-28 Nov. 2002