无组播节点网络中的组播树计算

L. Tang, Wanjun Huang, M. Razo, Arularasi Sivasankaran, M. Tacca, A. Fumagalli
{"title":"无组播节点网络中的组播树计算","authors":"L. Tang, Wanjun Huang, M. Razo, Arularasi Sivasankaran, M. Tacca, A. Fumagalli","doi":"10.1109/HPSR.2011.5986010","DOIUrl":null,"url":null,"abstract":"Multicast transmission offers a bandwidth efficient solution for delivering media content to multiple destinations over the Internet. However, in many existing networks, some (if not all) nodes do not support multicast, i.e., they cannot create multiple outgoing flows with one incoming data flow. In this paper, the authors propose an algorithm for multicast tree computation in networks with multicast incapable nodes. Paths that originate at the source and traversing all destinations are computed first; if such paths cannot be found, destinations are partitioned into subsets and traverse paths are computed over each subset, which is executed recursively until feasible trees can be built based on traverse paths found or no further partition is possible. Two procedures for traverse path computation are presented and their respective advantages are discussed, in terms of both complexity and solution optimality. The algorithm is also shown to be very effective in finding multicast trees even if only a few multicast capable nodes exist in the network.","PeriodicalId":269137,"journal":{"name":"2011 IEEE 12th International Conference on High Performance Switching and Routing","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2011-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"Multicast tree computation in networks with multicast incapable nodes\",\"authors\":\"L. Tang, Wanjun Huang, M. Razo, Arularasi Sivasankaran, M. Tacca, A. Fumagalli\",\"doi\":\"10.1109/HPSR.2011.5986010\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Multicast transmission offers a bandwidth efficient solution for delivering media content to multiple destinations over the Internet. However, in many existing networks, some (if not all) nodes do not support multicast, i.e., they cannot create multiple outgoing flows with one incoming data flow. In this paper, the authors propose an algorithm for multicast tree computation in networks with multicast incapable nodes. Paths that originate at the source and traversing all destinations are computed first; if such paths cannot be found, destinations are partitioned into subsets and traverse paths are computed over each subset, which is executed recursively until feasible trees can be built based on traverse paths found or no further partition is possible. Two procedures for traverse path computation are presented and their respective advantages are discussed, in terms of both complexity and solution optimality. The algorithm is also shown to be very effective in finding multicast trees even if only a few multicast capable nodes exist in the network.\",\"PeriodicalId\":269137,\"journal\":{\"name\":\"2011 IEEE 12th International Conference on High Performance Switching and Routing\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-07-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 IEEE 12th International Conference on High Performance Switching and Routing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/HPSR.2011.5986010\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 IEEE 12th International Conference on High Performance Switching and Routing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/HPSR.2011.5986010","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7

摘要

多播传输为通过Internet将媒体内容传送到多个目的地提供了一种带宽有效的解决方案。然而,在许多现有的网络中,一些(如果不是全部)节点不支持多播,也就是说,它们不能用一个传入数据流创建多个传出流。本文提出了一种具有不能组播节点的网络中的组播树计算算法。首先计算始发于源并遍历所有目的地的路径;如果找不到这样的路径,则将目的地划分为子集,并在每个子集上计算遍历路径,递归地执行,直到可以根据找到的遍历路径构建可行树或无法进一步划分为止。给出了两种遍历路径计算方法,并从复杂度和解的最优性两方面讨论了它们各自的优点。即使网络中具有组播能力的节点很少,该算法也能很好地找到组播树。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Multicast tree computation in networks with multicast incapable nodes
Multicast transmission offers a bandwidth efficient solution for delivering media content to multiple destinations over the Internet. However, in many existing networks, some (if not all) nodes do not support multicast, i.e., they cannot create multiple outgoing flows with one incoming data flow. In this paper, the authors propose an algorithm for multicast tree computation in networks with multicast incapable nodes. Paths that originate at the source and traversing all destinations are computed first; if such paths cannot be found, destinations are partitioned into subsets and traverse paths are computed over each subset, which is executed recursively until feasible trees can be built based on traverse paths found or no further partition is possible. Two procedures for traverse path computation are presented and their respective advantages are discussed, in terms of both complexity and solution optimality. The algorithm is also shown to be very effective in finding multicast trees even if only a few multicast capable nodes exist in the network.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信