UM
A new bandwidth guaranteed routing algorithm for MPLS traffic engineering
Wang B.; Su X.; Philip Chen C.L.
2002
Source PublicationIEEE International Conference on Communications
Volume2
Pages1001-1005
AbstractIn this paper, we present a new online algorithm for dynamically routing bandwidth guaranteed label switched paths (LSPs). LSP set-up requests are represented in terms of a pair of ingress and egress routers as well as its bandwidth requirement, and arrive one by one. There is no a priori knowledge regarding future LSP set-up requests and their characteristics. Our proposed algorithm considers not only the importance of critical links, but also the degree of their importance to routing possible future LSP set-up requests by characterizing their normalized bandwidth contribution to routing future LSP demands. Moreover, link residual bandwidth information, i.e., the link's capability of routing future LSPs, is also incorporated. Simulation results show that our proposed algorithm performs better than the best known bandwidth guaranteed routing algorithm, the minimum interference routing algorithm, in terms of LSP rejection rate under both static and dynamic LSP set-up request arrivals.
URLView the original
Language英語
Fulltext Access
Document TypeConference paper
CollectionUniversity of Macau
AffiliationWright State University
Recommended Citation
GB/T 7714
Wang B.,Su X.,Philip Chen C.L.. A new bandwidth guaranteed routing algorithm for MPLS traffic engineering[C],2002:1001-1005.
Related Services
Recommend this item
Bookmark
Usage statistics
Export to Endnote
Google Scholar
Similar articles in Google Scholar
[Wang B.]'s Articles
[Su X.]'s Articles
[Philip Chen C.L.]'s Articles
Baidu academic
Similar articles in Baidu academic
[Wang B.]'s Articles
[Su X.]'s Articles
[Philip Chen C.L.]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[Wang B.]'s Articles
[Su X.]'s Articles
[Philip Chen C.L.]'s Articles
Terms of Use
No data!
Social Bookmark/Share
All comments (0)
No comment.
 

Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.