| 组播中代价最小的核选择算法 |
| |
| 引用本文： | 鄢冰峰,徐云,万颖瑜.组播中代价最小的核选择算法[J].计算机应用与软件,2007,24(8):6-7,40. |
| |
| 作者姓名： | 鄢冰峰 徐云 万颖瑜 |
| |
| 作者单位： | [1]中国科学技术大学计算机科学技术系,安徽合肥230027 [2]中国科学院软件研究所计算机科学实验室,北京100080 |
| |
| 摘 要： | 基于核的组播路由协议使用核节点作为传输中心,所有的组播数据首先被单播到核节点,然后再通过以核节点为根的分发树组播到目的节点.核节点的选择直接影响单播和组播的总代价.以总代价最小为目标,提出了核选择的完全算法和近似算法.
|
| 关 键 词： | 组播 核选择 最短路径 Steiner树 组播 代价最小 选择算法 MULTICAST MINIMUM COST ALGORITHM SELECTION 近似算法 完全 核选择 目标 影响 的选择 分发树 单播 数据 传输中心 节点 使用 路由协议 |
| 修稿时间： | 2005-10-12 |
CORE SELECTION ALGORITHM WITH MINIMUM COST IN MULTICAST |
| |
| Yan Bingfeng,Xu Yun,Wan Yingyu.CORE SELECTION ALGORITHM WITH MINIMUM COST IN MULTICAST[J].Computer Applications and Software,2007,24(8):6-7,40. |
| |
| Authors: | Yan Bingfeng Xu Yun Wan Yingyu |
| |
| Affiliation: | Department of Computer Science, University of Science and Technology of China, Hefei 230027 ,Anhui, China ;Laboratory of Computer Science and Technology, Institute of Software, Chinese Academy of Sciences, Beijing 100080, China |
| |
| Abstract: | A core-based multicast protocol uses a core as a traffic transit center. All multicast packets are first sent to the core, and then distributed to destinations on a multicast tree rooted in the core. The choice of the core node directly affects the total cost of the transmission. Complete algorithm and approximation algorithm are proposed for core selection to minimize the total cost. |
| |
| Keywords: | Multicast Core selection Shortest path Steiner tree |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
