首页 | 本学科首页   官方微博 | 高级检索  
     

基于遗传算法的带宽-时延约束多播路由优化算法
引用本文:孙宝林,李腊元.基于遗传算法的带宽-时延约束多播路由优化算法[J].计算机工程与应用,2004,40(11):30-33.
作者姓名:孙宝林  李腊元
作者单位:1. 武汉理工大学计算机学院,武汉,430063;武汉科技学院数理系,武汉,430073
2. 武汉理工大学计算机学院,武汉,430063
基金项目:国家自然科学基金资助项目(批准号:60172035,90304018),湖北省自然科学基金资助项目(编号:2000J154),湖北省教育厅重点科研项目(编号:2003A002),武汉科技学院基金资助项目(编号:20032418)
摘    要:随着许多多媒体在高速网络中的应用,多播路由问题成为越来越重要的课题。多播路由问题在计算机网络中是著名的Steiner树问题,同时也是NP完全问题。该文提出了一种基于遗传算法的多播路由优化算法,采用可变长度染色体(多播树)和基因(路径)应用于编码问题。该算法在满足带宽和时延约束条件下寻找代价最小的多播树。仿真实验证明该算法能快速找到最优解,收敛速度快,可靠性高,能够满足多媒体网络对实时性的要求。

关 键 词:多播路由  QoS  路由优化  遗传算法
文章编号:1002-8331-(2004)11-0030-04

A Multicast Routing Optimization Algorithm with Bandwidth and Delay-Constrained Based on Genetic Algorithm
Sun Baolin , Li Layuan.A Multicast Routing Optimization Algorithm with Bandwidth and Delay-Constrained Based on Genetic Algorithm[J].Computer Engineering and Applications,2004,40(11):30-33.
Authors:Sun Baolin  Li Layuan
Affiliation:Sun Baolin 1,2 Li Layuan 11
Abstract:Due to the advent of many new multimedi a applications in high speed networks,the issue of multicast routing has become more and more important.The multicast routing problem in computer networks is a lso known as the Steiner tree problem which has been shown to be NP-complete.T his paper proposes a new multicast routing optimization algorithm based on Genet ic Algorithms ,variable-length chromosomes(multicast tree)and their genes(r outing strings)have been used for encoding the problem.It can find the low-co st multicasting tree with bandwidth and delay constraints.The simulation result s show that the proposed algorithm is able to find a better solution,fast conve rgence speed and high reliability.It can meet the real-time requirement in multimedia communication networks.The scalability and the performance of the al gorithm with increasing number of network nodes are also quite encouraging.
Keywords:Multicast Routing  QoS  Routing Optimization  Genetic Algorithm
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号