A genetic-algorithm-based routing optimization scheme for overlay network

被引：0

作者：

Lu, Jun ^{[1
]}

Cheng, Wengang ^{[2
]}

机构：

[1] North China Elect Power Univ, Sch Elect & Elect Engn, Beijing, Peoples R China

[2] North China Elect Power Univ, Sch Comp Sci, Beijing, Peoples R China

来源：

ICNC 2007: THIRD INTERNATIONAL CONFERENCE ON NATURAL COMPUTATION, VOL 4, PROCEEDINGS | 2007年

关键词：

D O I：

暂无

中图分类号：

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

学科分类号：

0812 ;

摘要：

This paper presents a multiple-objective routing optimization scheme based on Genetic Algorithm (GA) methodology to the metric tradeoff optimization problem between two routing metric cost (delay and bandwidth) in overlay network. Besides an effective tradeoff routing feature, the scheme applies genetic-crossover to the local-search operations in the optimized iterative course for better performance. Simulation experiments demonstrate, compared with non-GA algorithm, the scheme achieves mainly about 2.17%similar to 11.76% optimal gains.

引用

页码：421 / +

页数：2

共 12 条

[1]

[Anonymous], NS 2 NETWORK SIMULAT

[2]

BACK T, 1993, EVOLUTIONARY COMPUTA, P1

[3]

CHAIYARATANA N, 1990, GALESIA 97, P270

[4]

Goldberg D.E, 1989, GENETIC ALGORITHMS S

[5]

Jeyakumar AE, 2003, TENCON IEEE REGION, P1224

[6]

LU J, 2006, J ELECT CHINA, V23, P882

[7] Multicasting: An enabling technology [J].

Manimaran, G ;

Mohapatra, P .

IEEE NETWORK, 2003, 17 (01) :6-7

[8]

Raidl G., 2005, OEGAI-Journal, V24, P2

[9]

SHI SY, 2002, IEEE J SELECTED AREA, V20

[10]

SUMAN B, 2003, IEEE INFOCOM

← 1 2 →