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

Author

Mingying Zhuab ; Ye, Wu ; Feng, Suili ; Xiaoming He

Author_Institution

South China Univ. of Technol., Guangzhou

fYear

2007

fDate

22-24 Aug. 2007

Firstpage

34

Lastpage

38

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

DiffServ networks; computational complexity; multiprotocol label switching; telecommunication network routing; telecommunication traffic; traffic engineering computing; DiffServ-aware traffic engineering; MPLS networks; computational complexity; heuristic algorithm; large scale networks; online computing; preemption algorithm; preemption optimization; telecommunication router; Bandwidth; Computational complexity; Computational modeling; Computer networks; Heuristic algorithms; Large-scale systems; Multiprotocol label switching; NP-complete problem; Routing; Telecommunication traffic; B-PREPT; MPLS; Preemption; Traffic Engineering; V-PREPT;

fLanguage

English

Publisher

ieee

Conference_Titel

Communications and Networking in China, 2007. CHINACOM '07. Second International Conference on

Conference_Location

Shanghai

Print_ISBN

978-1-4244-1009-5

Electronic_ISBN

978-1-4244-1009-5

Type

conf

DOI

10.1109/CHINACOM.2007.4469322

Filename

4469322