For Full-Text PDF, please login, if you are a member of IEICE,|
or go to Pay Per View on menu list, if you are a nonmember of IEICE.
A Dynamic Routing Algorithm for MPLS Networks
Kyungmi PARK Jinhan SONG Saewoong BAHK
IEICE TRANSACTIONS on Communications
Publication Date: 2004/08/01
Print ISSN: 0916-8516
Type of Manuscript: LETTER
MPLS, traffic engineering, dynamic algorithm,
Full Text: PDF(183.2KB)
>>Buy this Article
We propose a new dynamic routing algorithm that uses traffic and network state information to minimize the blocking rate and link congestion level. Our scheme uses the currently available link capacity in calculating the link weight by modifying Wang's approach, and computes the shortest path when a new call comes into the network. We consider the blocking count based update mechanism and the timer based mechanism, and conclude that the former is better than the latter in terms of efficiency and complexity.