New dynamic link weight algorithm for online calculation of LSPs in MPLS networks

Pham, Huan, and Lavery, Bill (2002) New dynamic link weight algorithm for online calculation of LSPs in MPLS networks. In: 8th International Conference on Communication Systems, pp. 116-120. From: 8th International Conference on Communication Systems, 25-26 November 2002, Singapore.

[img] PDF (Published Version) - Published Version
Restricted to Repository staff only


Abstract

This paper presents a new Dynamic Link Weight(DL W) routing algorithm for calculating Label Switched Paths (LSPs) in 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 calculation sin such networks.

Item ID: 14629
Item Type: Conference Item (Refereed Research Paper - E1)
Keywords: MPLS; routing, optimisation, network managemen; traffic engineering
ISBN: 978-0-7803-7510-9
Date Deposited: 24 Aug 2017 00:05
FoR Codes: 10 TECHNOLOGY > 1005 Communications Technologies > 100503 Computer Communications Networks @ 100%
SEO Codes: 89 INFORMATION AND COMMUNICATION SERVICES > 8901 Communication Networks and Services > 890199 Communication Networks and Services not elsewhere classified @ 100%
More Statistics

Actions (Repository Staff Only)

Item Control Page Item Control Page