A bi-population-evolution integrated QoS multicast routing algorithm in NGI

被引:0
作者
Wang, Xingwei [1 ]
Li, Shanlin [1 ]
An, Guangyong [2 ]
Huang, Min [1 ]
机构
[1] NE Univ, Coll Informat Sci & Engn, Shenyang 110004, Peoples R China
[2] Korea Univ, Int Business, Dept Bussiness Sch, Seoul 130061, South Korea
来源
2006 INTERNATIONAL CONFERENCE ON HYBRID INFORMATION TECHNOLOGY, VOL 1, PROCEEDINGS | 2006年
基金
中国国家自然科学基金;
关键词
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
IP/DWDM optical Internet is one of the main networking technologies for the NGI(Next Generation Internet). QoS multicast routing is one of its basic problems to be solved and is proven to be NP-hard. Thus, a non-NP algorithm is proposed in this paper. It is based on bi-population-evolution to find a cost-optimized QoS multicast routing tree with routing and wavelength assignment solved integratedly. Simulation results have shown that the proposed algorithm is both feasible and effective, and is advantageous over its counterpart based on the classical genetic algorithm.
引用
收藏
页码:84 / +
页数:2
相关论文
共 17 条
[1]   Delay-constrained, low-cost multicast routing in multimedia networks [J].
Alrabiah, T ;
Znati, T .
JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 2001, 61 (09) :1307-1336
[2]  
Banik SM, 2004, LECT NOTES COMPUT SC, V3079, P399
[3]  
CHANG CY, 2002, LNCS, V2343, P313
[4]   GA-Based heuristic algorithms for QoS based multicast routing [J].
Haghighat, AT ;
Faez, K ;
Dehghan, M ;
Mowlaei, A ;
Ghahremani, Y .
KNOWLEDGE-BASED SYSTEMS, 2003, 16 (5-6) :305-312
[5]  
HUI C, 2004, RES SIMULATED IMPLEM
[6]   An efficient algorithm for constructing delay bounded minimum cost multicast trees [J].
Li, S ;
Melhem, R ;
Znati, T .
JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 2004, 64 (12) :1399-1413
[7]  
[刘芳 Liu Fang], 2003, [系统仿真学报, Journal of System Simulation], V15, P1431
[8]  
QIAN G, 2004, J SOFTWARE, V15, P1877
[9]  
QIAN G, 2001, OPITCAL INTERNETWORK
[10]   ROUTING AND WAVELENGTH ASSIGNMENT IN ALL-OPTICAL NETWORKS [J].
RAMASWAMI, R ;
SIVARAJAN, KN .
IEEE-ACM TRANSACTIONS ON NETWORKING, 1995, 3 (05) :489-500