GAPS: The genetic algorithm-based path selection scheme for MPLS network

被引：0

作者：

Kim, Sun Wook ^{[1
]}

Youn, Hee Yong ^{[1
]}

Choi, Sung Jin ^{[1
]}

Sung, Nag Bum ^{[1
]}

机构：

[1] Sungkyunkwan Univ, Sch Informat & Commun Engn, Suwon, South Korea

来源：

IRI 2007: PROCEEDINGS OF THE 2007 IEEE INTERNATIONAL CONFERENCE ON INFORMATION REUSE AND INTEGRATION | 2007年

关键词：

CSPF; genetic algorithm; MPLS; path; selection; QoS;

D O I：

暂无

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

In the MPLS network QoS might be achieved by reducing the possibility of congestion while increasing the utilization of available links. Due to various interrelated factors, path selection for the MPLS network is known as an NP-Hard problem. The widely employed path selection scheme has a shortcoming that the time overhead is high, especially when the number of nodes in the network is large. This paper proposes a new path selection scheme which uses the genetic algorithm along with the modified roulette wheel selection method. Performance evaluation through computer simulation shows that it finds the paths about 30% faster than the existing constrained shortest path first (CSPF) scheme while evenly distributing the traffic throughout the network.

引用

页码：570 / +

页数：2

共 12 条

[1]

[Anonymous], GENETIC ALGORITHMS D

[2]

[Anonymous], 2001, INTERNET QOS ARCHITE

[3]

Awduche D., 1999, RFC2702

[4] PTPlan MPLS: a tool for MPLS network dimensioning [J].

Cardoso, L ;

Patrao, J ;

Lopez, C ;

de Sousa, A ;

Valadas, R .

NINTH INTERNATIONAL SYMPOSIUM ON MODELING, ANALYSIS AND SIMULATION OF COMPUTER AND TELECOMMUNICATION SYSTEMS, PROCEEDINGS, 2001, :339-345

[5]

CHO HY, 1967, ICC 03 IEEE INT C CO, V3, P1963

[6]

Ferguson P., 1998, QUALITY SERVICE DELI

[7]

REDDY GN, 2002, ACI 2002

[8]

Rosen E., 2001, 3031 RFC

[9]

ROSEN EC, 1999, MULTIPROTOCOL LABEL

[10]

WANG B, 2002, IEEE

← 1 2 →