A Robust Overlay Network for Real-Time Multimedia Dissemination

Qiang Zeng, Hua Miao, Zhaoliang Zhu
{"title":"A Robust Overlay Network for Real-Time Multimedia Dissemination","authors":"Qiang Zeng, Hua Miao, Zhaoliang Zhu","doi":"10.1109/SITIS.2007.41","DOIUrl":null,"url":null,"abstract":"Robustness of overlay networks is an importantproperty as well as short delay for real-time media transmission. Unlike previous schemes, which achieve robustness by restoring spanning trees afternodes or links fail, we focus on reducing possible data loss when failure occurs. According to analysis of the relation between tree depth and data loss, we first present a spanning tree which minimizes dataloss but results in large delay. By introducing a factor, we propose a spanning tree which exhibits fine flexibility and tradeoff between data loss and delay. Simulation results show that it achieves relatively low data loss and delay simultaneously, as is optimum for a large range of applications.","PeriodicalId":234433,"journal":{"name":"2007 Third International IEEE Conference on Signal-Image Technologies and Internet-Based System","volume":"99 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 Third International IEEE Conference on Signal-Image Technologies and Internet-Based System","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SITIS.2007.41","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Robustness of overlay networks is an importantproperty as well as short delay for real-time media transmission. Unlike previous schemes, which achieve robustness by restoring spanning trees afternodes or links fail, we focus on reducing possible data loss when failure occurs. According to analysis of the relation between tree depth and data loss, we first present a spanning tree which minimizes dataloss but results in large delay. By introducing a factor, we propose a spanning tree which exhibits fine flexibility and tradeoff between data loss and delay. Simulation results show that it achieves relatively low data loss and delay simultaneously, as is optimum for a large range of applications.
实时多媒体传播的鲁棒覆盖网络
覆盖网络的鲁棒性和短时延是实时媒体传输的重要特性。不像以前的方案,通过在节点或链路故障后恢复生成树来实现鲁棒性,我们专注于减少故障发生时可能的数据丢失。在分析树深度与数据丢失关系的基础上,首先提出了一种数据丢失最小但延迟较大的生成树。通过引入一个因子,我们提出了一种具有良好灵活性的生成树,并在数据丢失和延迟之间进行了权衡。仿真结果表明,该方法同时实现了较低的数据丢失和延迟,是大范围应用的最佳选择。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信