| 基于关键结点和遗传操作的最小代价组播算法 |
| |
| 引用本文： | 史正平,沈艳军,朱俊敏,唐基宏,康延挺.基于关键结点和遗传操作的最小代价组播算法[J].三峡大学学报(自然科学版),2007,29(3):251-254. |
| |
| 作者姓名： | 史正平 沈艳军 朱俊敏 唐基宏 康延挺 |
| |
| 作者单位： | 1. 福州大学,数学与计算机科学学院,福州,350002
2. 三峡大学,理学院,湖北,宜昌,443002 |
| |
| 摘 要： | 提出了基于关键结点的最小代价组播路由算法,算法利用整数规划的思想在网络中找出k个代价最小的结点;通过特定策略将这k个结点构成一棵树,然后采用遗传操作将不在树上的成员结点加入到树上,最后剪去非成员的叶结点形成最小代价组播树.该算法可靠性高,能够有效满足实时应用的需求.
|
| 关 键 词： | 组播路由 整数规划 遗传操作 关键结点 |
| 文章编号： | 1672-948X（2007）03-0251-04 |
| 修稿时间： | 2006-10-25 |
Minimum Cost Multicast Algorithm Based on Key Nodes and Genetic Operator |
| |
| Shi Zhengping,Shen Yanjun,Zhu Junmin,Tang Jihong,Kang Yanting.Minimum Cost Multicast Algorithm Based on Key Nodes and Genetic Operator[J].Journal of China Three Gorges University(Natural Sciences),2007,29(3):251-254. |
| |
| Authors: | Shi Zhengping Shen Yanjun Zhu Junmin Tang Jihong Kang Yanting |
| |
| Abstract: | A minimum cost multicast routing algorithm is presented based on key nodes;this algorithm firstly choose k minimum cost nodes in a network by integral programming idea.Secondly,make k key nodes into a tree by particular strategy and add member nodes to this tree on the genetic operator,then cut the non-member leaf nodes to form the minimum cost multicast tree.Finally,it conducts an emulation experiment.The experiment shows that this algorithm is more reliable than other algorithms,and sufficiently satisfies the real time capability.When a network is larger,this algorithm can greatly reduce the time of routing computation. |
| |
| Keywords: | multicast routing integral programming genetic operator key nodes |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
