| 基于遗传算法的时延受限代价最小组播路由选择方法 |
| |
| 引用本文： | 王新红,王光兴.基于遗传算法的时延受限代价最小组播路由选择方法[J].通信学报,2002,23(3):112-117. |
| |
| 作者姓名： | 王新红 王光兴 |
| |
| 作者单位： | 东北大学,网络与通信中心,辽宁,沈阳,110006 |
| |
| 基金项目： | 国家“九五”重点科技攻关项目基金资助项目(97-769) |
| |
| 摘 要： | 目前多媒体业务的涌现对网络提出了更高的要求。希望既能满足实时性，又能够高效地利用网络资源。本文提出了一种基于遗传算法的组播路由选择方法，该方法在满足时延限制条件的基础上寻找代价最小的组播树。实验表明，该算法收敛速度快，可靠性高，能够满足多媒体网络对实时性的要求。
|
| 关 键 词： | 组播 遗传算法 时延限制 路由选择 |
| 文章编号： | 1000-436X(2002)03-0112-06 |
| 修稿时间： | 2001年3月21日 |
A multicast routing approach with delay-constrained minimum-cost based on genetic algorithm |
| |
| WANG Xin-hong,WANG Guang-xing.A multicast routing approach with delay-constrained minimum-cost based on genetic algorithm[J].Journal on Communications,2002,23(3):112-117. |
| |
| Authors: | WANG Xin-hong WANG Guang-xing |
| |
| Abstract: | At present, more and more multimedia services need the network to guarantee the real-time requirement and use the network resource efficiently. In this paper, an approach based on genetic algorithm is proposed, which finds the low-cost multicasting tree with end-to-end delay constraints. The simulation results show that this approach has fast convergence speed and high reliability. It can meet the real-time requirement in multimedia communication networks. |
| |
| Keywords: | multicast routing genetic algorithm delay constraints |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
