| 覆盖组播的最小覆盖代价路由算法 |
| |
| 引用本文： | 林龙新,周杰,张凌,叶昭.覆盖组播的最小覆盖代价路由算法[J].计算机应用,2008,28(10):2569-2572. |
| |
| 作者姓名： | 林龙新 周杰 张凌 叶昭 |
| |
| 作者单位： | 华南理工大学,广东省计算机网络重点实验室,广州,510641 |
| |
| 基金项目： | 国家重点基础研究发展计划(973计划)，科技部科技基础条件平台建设计划，粤港关键领域重点突破项目 |
| |
| 摘 要： | 与IP组播相比，覆盖组播通常会消耗更多的底层网络资源。因此，在覆盖网中构造组播转发树时，考虑合理地利用底层网络资源具有一定的实际意义。给出覆盖代价的概念，把覆盖组播路由问题归结为求无向完全图的度和延迟受限、具有最小覆盖代价的生成树问题，求解的目标是在满足应用需求和端用户主机性能要求的同时使所消耗的底层网络资源最少。给出了求解该问题的启发式遗传算法，通过仿真实验验证了该算法的有效性。
|
| 关 键 词： | 覆盖组播 覆盖代价 生成树 |
| 收稿时间： | 2008-04-30 |
Overlay multicast routing algorithm with minimum overlay cost |
| |
| LIN Long-xin,ZHOU Jie,ZHANG Ling,YE Zhao.Overlay multicast routing algorithm with minimum overlay cost[J].journal of Computer Applications,2008,28(10):2569-2572. |
| |
| Authors: | LIN Long-xin ZHOU Jie ZHANG Ling YE Zhao |
| |
| Affiliation: | LIN Long-xin,ZHOU Jie,ZHANG Ling,YE Zhao(Guangdong Key Laboratory of Computer Network,South China University of Technology,Guangzhou Guangdong 510641,China) |
| |
| Abstract: | Compared with IP multicast, overlay multicast usually consumes more underlying network resources. Therefore, utilizing the underlying network resources effectively has some practical significance when constructing the multicast delivery tree based on overlay network. The concept of overlay cost was proposed, and the overlay multicast routing problem was defined to find a degree and delay constrained spanning tree with the minimum overlay cost for an undirected complete graph. The goal of the solution was to... |
| |
| Keywords: | overlay multicast overlay cost spanning tree |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算机应用》浏览原始摘要信息 |
|
点击此处可从《计算机应用》下载全文 |
