覆盖组播树低失真逼近方法的评价

Huan Luo, K. Harfoush
{"title":"覆盖组播树低失真逼近方法的评价","authors":"Huan Luo, K. Harfoush","doi":"10.1109/HONET.2008.4810239","DOIUrl":null,"url":null,"abstract":"In this paper we investigate the performance of distortion-bounded approximation methods for overlay multicast tree construction and compare them to common overlay multicast tree construction techniques such as the minimum spanning tree (MST) and core-based trees. We study the fanout-distortion tradeoff of these techniques on both synthetic and real Internet topologies. The performance results vary not only between different methods but also between different topologies. Our study of the fanout-distortion tradeoff reveals that low distortion approximation methods sacrifice fanout for low distortion suggesting a more careful design in order to balance both mertics. Furthermore, MST outperforms low distortion approximation methods both in distortion and fanout, especially on realistic Internet topologies, even though it was not designed to optimize distortion or fanout.","PeriodicalId":433243,"journal":{"name":"2008 International Symposium on High Capacity Optical Networks and Enabling Technologies","volume":"33 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Evaluation of Low-Distortion Approximation Methods For Overlay Multicast Tree construction\",\"authors\":\"Huan Luo, K. Harfoush\",\"doi\":\"10.1109/HONET.2008.4810239\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper we investigate the performance of distortion-bounded approximation methods for overlay multicast tree construction and compare them to common overlay multicast tree construction techniques such as the minimum spanning tree (MST) and core-based trees. We study the fanout-distortion tradeoff of these techniques on both synthetic and real Internet topologies. The performance results vary not only between different methods but also between different topologies. Our study of the fanout-distortion tradeoff reveals that low distortion approximation methods sacrifice fanout for low distortion suggesting a more careful design in order to balance both mertics. Furthermore, MST outperforms low distortion approximation methods both in distortion and fanout, especially on realistic Internet topologies, even though it was not designed to optimize distortion or fanout.\",\"PeriodicalId\":433243,\"journal\":{\"name\":\"2008 International Symposium on High Capacity Optical Networks and Enabling Technologies\",\"volume\":\"33 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 International Symposium on High Capacity Optical Networks and Enabling Technologies\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/HONET.2008.4810239\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 International Symposium on High Capacity Optical Networks and Enabling Technologies","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/HONET.2008.4810239","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

本文研究了失真有界近似方法在叠加组播树构建中的性能,并将其与最小生成树(MST)和基于核心的树等常见的叠加组播树构建技术进行了比较。我们研究了这些技术在合成和真实互联网拓扑上的扇出-失真权衡。性能结果不仅在不同的方法之间存在差异,而且在不同的拓扑结构之间也存在差异。我们对扇出-失真权衡的研究表明,低失真近似方法牺牲扇出以获得低失真,建议更仔细的设计,以平衡这两个指标。此外,MST在失真和扇出方面都优于低失真近似方法,特别是在现实的互联网拓扑结构上,尽管它不是为了优化失真或扇出而设计的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Evaluation of Low-Distortion Approximation Methods For Overlay Multicast Tree construction
In this paper we investigate the performance of distortion-bounded approximation methods for overlay multicast tree construction and compare them to common overlay multicast tree construction techniques such as the minimum spanning tree (MST) and core-based trees. We study the fanout-distortion tradeoff of these techniques on both synthetic and real Internet topologies. The performance results vary not only between different methods but also between different topologies. Our study of the fanout-distortion tradeoff reveals that low distortion approximation methods sacrifice fanout for low distortion suggesting a more careful design in order to balance both mertics. Furthermore, MST outperforms low distortion approximation methods both in distortion and fanout, especially on realistic Internet topologies, even though it was not designed to optimize distortion or fanout.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信