A Heuristic for Global Coordination in MPLS Bandwidth Constrained Path Selection
Wang, Ning, Lu, Yin and Pavlou, George (2004) A Heuristic for Global Coordination in MPLS Bandwidth Constrained Path Selection Proceedings of the IEEE/IEE International Conference on Networking.
SRF002074.pdf - Published Version
Multi-Protocol Label Switching (MPLS) has been considered to be a promising solution to achieve end-to-end QoS guarantees in Differentiated Services (DiffServ) domains .Based on the Service Level Specification (SLS) between customers and the ISP, traffic forecast mechanism is able to predict traffic demands between ingress-egress routers, and hence bandwidth guaranteed LSPs can be set up accordingly through the DiffServ domain. In this paper, we address the problem of computing multiple LSPs with heterogeneous bandwidth requirements, while the overall network link cost is optimized. We first prove that finding a set of feasible LSPs with bandwidth constrained is NP-complete, and then propose an efficient heuristic with global network resource coordination over individual traffic aggregates. By simulation we show that the proposed coordinated path section (CPS) scheme obtains better overall LSP cost and lower bandwidth consumption compared with existing bandwidth constrained routing algorithms.
|Divisions :||Faculty of Engineering and Physical Sciences > Electronic Engineering > Centre for Communication Systems Research|
|Date :||March 2004|
|Related URLs :|
|Additional Information :||©2004 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.|
|Depositing User :||Melanie Hughes|
|Date Deposited :||17 Sep 2010 09:28|
|Last Modified :||23 Sep 2013 18:36|
Actions (login required)
Downloads per month over past year