| Degree-constrained multicasting algorithm | |
| Liu Ying ; Zhao You-jian ; Wu Jian-ping | |
| 2010-05-06 ; 2010-05-06 | |
| 关键词 | Practical Experimental/ heuristic programming multicast communication resource allocation telecommunication network routing/ communication network network node node load balancing heuristic algorithm degree-constrained multicasting multicast routing/ B6150P Communication network design, planning and routing |
| 中文摘要 | In communication networks, the multicasting is of great importance. Because of the different ability of the network nodes, some nodes do not support multicasting. And in order to balance the node load, the nodes need not send message to all of its adjacent nodes. By using the degree of the node to represent the multicasting ability, the degree-constrained multicasting is dealt with and an efficient and simple heuristic algorithm is presented and our experimental results show that the proposed algorithm can find the solution in most experimental cases. |
| 语种 | 中文 ; 中文 |
| 出版者 | Mini-Micro Syst., China ; China |
| 内容类型 | 期刊论文 |
| 源URL | [http://hdl.handle.net/123456789/9994]  |
| 专题 | 清华大学 |
| 推荐引用方式 GB/T 7714 | Liu Ying,Zhao You-jian,Wu Jian-ping. Degree-constrained multicasting algorithm[J],2010, 2010. |
| APA | Liu Ying,Zhao You-jian,&Wu Jian-ping.(2010).Degree-constrained multicasting algorithm.. |
| MLA | Liu Ying,et al."Degree-constrained multicasting algorithm".(2010). |
| 个性服务 |
| 查看访问统计 |
| 相关权益政策 |
| 暂无数据 |
| 收藏/分享 |
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。
修改评论