Evaluation Indices of Many-to-Many Multicast Routing Tree to Represent Delay Performance

Hajime Karasawa, Shinsuke Terada, T. Miyoshi, K. Yamori, Yoshiaki Tanaka
{"title":"Evaluation Indices of Many-to-Many Multicast Routing Tree to Represent Delay Performance","authors":"Hajime Karasawa, Shinsuke Terada, T. Miyoshi, K. Yamori, Yoshiaki Tanaka","doi":"10.1109/APCC.2006.255771","DOIUrl":null,"url":null,"abstract":"The optimization of multicast routing tree is an important issue for efficient multicast communication. Some previous papers have tried to analyze the one-to-many multicast tree and have obtained that the most efficient tree depends on the characteristics of the receivers such as the number of receivers. For many-to-many multicast, on the other hand, the efficiency of the tree has not been analyzed. This paper analyzes how various components affect the efficiency of the many-to-many multicast tree. As a result, it is shown that the most efficient many-to-many multicast tree does not depend on the number of multicast members. The result also tells that the diameter of the tree, the variance of node degrees, and the number of leaf nodes mostly decide the delay performance of the tree","PeriodicalId":205758,"journal":{"name":"2006 Asia-Pacific Conference on Communications","volume":"52 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 Asia-Pacific Conference on Communications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/APCC.2006.255771","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

The optimization of multicast routing tree is an important issue for efficient multicast communication. Some previous papers have tried to analyze the one-to-many multicast tree and have obtained that the most efficient tree depends on the characteristics of the receivers such as the number of receivers. For many-to-many multicast, on the other hand, the efficiency of the tree has not been analyzed. This paper analyzes how various components affect the efficiency of the many-to-many multicast tree. As a result, it is shown that the most efficient many-to-many multicast tree does not depend on the number of multicast members. The result also tells that the diameter of the tree, the variance of node degrees, and the number of leaf nodes mostly decide the delay performance of the tree
多对多组播路由树时延性能评价指标研究
组播路由树的优化是实现高效组播通信的一个重要问题。已有文献对一对多组播树进行了分析,得出了最有效的组播树取决于接收方的数量等特征。另一方面,对于多对多组播,树的效率尚未得到分析。分析了各组成部分对多对多组播树效率的影响。结果表明,最有效的多对多组播树不依赖于组播成员的数量。结果还表明,树的直径、节点度的方差和叶节点的数量在很大程度上决定了树的延迟性能
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信