Minimizing preemption cost for path selection in Diffserv-ware MPLS networks

Authors:
Xiaoming He;Qingxin Chu;Mingying Zhu
Affiliations:
School of Electronic and Information Engineering, South China University of Technology, Guangzhou, China and Guangzhou Research Institute, China Telecom Corporation Ltd. Co, Guangzhou, China;School of Electronic and Information Engineering, South China University of Technology, Guangzhou, China;School of Electronic and Information Engineering, South China University of Technology, Guangzhou, China and Guangzhou Research Institute, China Telecom Corporation Ltd. Co, Guangzhou, China
Venue:
Computer Communications
Year:
2006

Citing 4
Cited 0

Call preemption in communication networks

IEEE INFOCOM '92 Proceedings of the eleventh annual joint conference of the IEEE computer and communications societies on One world through communications (Vol. 3)
Decentralized network connection preemption algorithms

Computer Networks and ISDN Systems
New preemption policies for DiffServ-aware traffic engineering to minimize rerouting in MPLS networks

IEEE/ACM Transactions on Networking (TON)
Minimizing re-routing in MPLS networks with preemption-aware constraint-based routing

Computer Communications

Quantified Score

Hi-index	0.24

Visualization

Abstract

Preemption is becoming an attractive strategy for bandwidth reservation and management in DiffServ-aware Traffic Engineering. In this paper, we propose an improved heuristic algorithm for the well-known optimization formulation based on versatile preemption policy, which can minimize the preemption cost with high accuracy and less computational intractability. Simulation results show that the proposed algorithm significantly outperforms well-known algorithms recently proposed in the literature. Moreover, we present a new path selection scheme to minimize preemption. Due to preemption of those LSPs that share more links with the selected path, the proposed scheme obviously minimize rerouting in DS-TE environments.