DocumentCode
2625127
Title
A preemption-aware path selection algorithm for DiffServ/MPLS networks
Author
Ke, Yu ; Lin, Zhang ; Hui-min, Zhang
Author_Institution
Sch. of Inf. Eng., Beijing Univ. of Posts & Telecommun., China
fYear
2004
fDate
11-13 Oct. 2004
Firstpage
129
Lastpage
133
Abstract
In a multi-service network in which multiple classes with different priorities and different QoS requirements exist, preemption is an efficient mechanism for bandwidth allocation and management. By considering preemption-related information in the path selection procedure, we can minimize rerouting and improve network stability. In this paper, we propose a preemption-aware bandwidth-constrained path selection algorithm for DiffServ-enabled MPLS networks. The basic idea is that the available resource reservation information of lower priority LSPs, i.e. the bandwidth to be preempted and the affected highest priority level, is introduced in the path selection. Simulations show that our proposed algorithm can achieve preemption minimization as well as load balancing, and efficiently improve overall network performance.
Keywords
DiffServ networks; bandwidth allocation; multiprotocol label switching; quality of service; routing protocols; telecommunication network management; DiffServ networks; MPLS networks; QoS requirements; bandwidth allocation; bandwidth management; load balancing; multiservice network; network stability; path selection procedure; preemption-aware bandwidth-constrained path selection algorithm; preemption-related information; Bandwidth; Channel allocation; Diffserv networks; Load management; Minimization methods; Multiprotocol label switching; Routing; Stability; Telecommunication network management; Telecommunication traffic; DiffServ-aware Traffic Engineering(DS-TE); MPLS; path selection; preemption;
fLanguage
English
Publisher
ieee
Conference_Titel
IP Operations and Management, 2004. Proceedings IEEE Workshop on
Print_ISBN
0-7803-8836-4
Type
conf
DOI
10.1109/IPOM.2004.1547604
Filename
1547604
Link To Document