A new preemption algorithm for Diffserv-aware traffic engineering in MPLS networks

被引：0

作者：

Zhu, Mingying ^{[1
]}

Ye, Wu ^{[1
]}

Feng, Suili ^{[1
]}

He, Xiaoming ^{[1
]}

机构：

[1] S China Univ Technol, Sch Elect & Informat Engn, Guangzhou, Peoples R China

来源：

2007 SECOND INTERNATIONAL CONFERENCE IN COMMUNICATIONS AND NETWORKING IN CHINA, VOLS 1 AND 2 | 2007年

关键词：

traffic engineering; V-PREPT; B-PREPT; MPLS; preemption;

D O I：

暂无

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

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.

引用

页码：377 / 381

页数：5

共 8 条

[1]

DEOLIVEIRA JC, 2004, IEEE ACM T NETWORKIN, V12

[2]

DEOLIVEIRA JC, 2005, IN PRESS LSP PREEMPT

[3]

FAUCHEUR FL, 2003, 3564 IETF RFC

[4]

GARAY JA, 1992, IEEE INFOCOM SER, P1043, DOI 10.1109/INFCOM.1992.263457

[5] Decentralized network connection preemption algorithms [J].

Peyravian, M ;

Kshemkalyani, AD .

COMPUTER NETWORKS AND ISDN SYSTEMS, 1998, 30 (11) :1029-1043

[6]

Poretsky S, 1998, IEEE MILIT COMMUN C, P86, DOI 10.1109/MILCOM.1998.722550

[7]

Poretsky S, 1998, ICC 98 - 1998 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS VOLS 1-3, P299, DOI 10.1109/ICC.1998.682795

[8] Minimizing re-routing in MPLS networks with preemption-aware constraint-based routing [J].

Szviatovszki, B ;

Szentesi, A ;

Jüttner, A .

COMPUTER COMMUNICATIONS, 2002, 25 (11-12) :1076-1084

← 1 →