A New Preemption Algorithm for Diffserv-Aware Traffic Engineering in MPLS Networks

Mingying Zhu; Wu Ye; Suili Feng; Xiaoming He

2nd International ICST Conference on Communications and Networking in China

Research Article

A New Preemption Algorithm for Diffserv-Aware Traffic Engineering in MPLS Networks

Cite: BibTeX Plain Text

@INPROCEEDINGS{10.1109/CHINACOM.2007.4469322,
    author={Mingying Zhu and Wu Ye and Suili Feng and Xiaoming He},
    title={A New Preemption Algorithm for Diffserv-Aware Traffic Engineering in MPLS Networks},
    proceedings={2nd International ICST Conference on Communications and Networking in China},
    publisher={IEEE},
    proceedings_a={CHINACOM},
    year={2008},
    month={3},
    keywords={Traffic Engineering; V-PREPT; B-PREPT; MPLS; Preemption},
    doi={10.1109/CHINACOM.2007.4469322}
}

Mingying Zhu
Wu Ye
Suili Feng
Xiaoming He
Year: 2008
A New Preemption Algorithm for Diffserv-Aware Traffic Engineering in MPLS Networks
CHINACOM
IEEE
DOI: 10.1109/CHINACOM.2007.4469322

Mingying Zhu^1,2^,*, Wu Ye¹, Suili Feng¹, Xiaoming He^1,2

1: School of Electronic and Information Engineering, South China University of Technology, Guangzhou, China
2: Guangzhou Research Institute China Telecom Corporation Ltd. Co, Guangzhou, China

*Contact email: zhumy@gsta.com

Abstract

The preemption policy with three main preemption optimization criteria is proposed in many literatures and the choice of LSPs to be preempted is an NP-complete problem. We propose a heuristic algorithm called B-PREPT to solve the problem. Simulation results indicate that our algorithm has higher choice accuracy than the well-known heuristic algorithm recently cited by many other papers. Moreover, the computational complexity of our algorithm is acceptable for router’s online computing in large scale networks.

Keywords: Traffic Engineering; V-PREPT; B-PREPT; MPLS; Preemption

Published: 2008-03-07
Publisher: IEEE
Modified: 2011-07-13

: http://dx.doi.org/10.1109/CHINACOM.2007.4469322