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

Author

Pham, Huan ; Lavery, Bill

Author_Institution

James Cook Univ., Townsville, Qld., Australia

Volume

1

fYear

2002

fDate

25-28 Nov. 2002

Firstpage

117

Abstract

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.

Keywords

multiprotocol label switching; routing protocols; telecommunication traffic; LSP; MPLS networks; algorithm complexity; dynamic link weight algorithm; label switched paths; multiple protocol label switching; network management; on-line calculation; routing algorithm; throughput; traffic demand rejection probability; Bandwidth; Heuristic algorithms; Intelligent networks; Multiprotocol label switching; Protocols; Routing; Switches; Telecommunication traffic; Throughput; Virtual private networks;

fLanguage

English

Publisher

ieee

Conference_Titel

Communication Systems, 2002. ICCS 2002. The 8th International Conference on

Print_ISBN

0-7803-7510-6

Type

conf

DOI

10.1109/ICCS.2002.1182449

Filename

1182449