StrandCast: Peer-to-peer content distribution for latency tolerant applications

Ketan Mayer-Patel, Andrew Jones
{"title":"StrandCast: Peer-to-peer content distribution for latency tolerant applications","authors":"Ketan Mayer-Patel, Andrew Jones","doi":"10.1109/COMSNETS.2010.5431998","DOIUrl":null,"url":null,"abstract":"Existing streaming peer-to-peer distribution architectures are designed to balance inherent trade-offs between stretch, stress, and robustness to churn. Several rely on multiple description coding in order to facilitate mesh-based or forest-based approaches. We believe, however, that a number of important applications such as broadcast video, pyramid video-on-demand, digital fountains, and data cycles to name a few exhibit a great deal of latency tolerance. For these applications, stretch is immaterial as long as join/leave latencies are minimized. If stretch is no longer a concern, simply chaining peers into a line emerges as a natural design choice for minimizing stress. The realities of loss, churn, and heterogeneous peer capabilities make implementing such a design challenging. In this paper, we show that by using a layered data model, a linear distribution scheme can be very effectively achieved and can be superior to MDC-based schemes. The paper describes our system called StrandCast and presents simulation results demonstrating its effectiveness and comparing it to SplitStream.","PeriodicalId":369006,"journal":{"name":"2010 Second International Conference on COMmunication Systems and NETworks (COMSNETS 2010)","volume":"349 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-01-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 Second International Conference on COMmunication Systems and NETworks (COMSNETS 2010)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/COMSNETS.2010.5431998","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Existing streaming peer-to-peer distribution architectures are designed to balance inherent trade-offs between stretch, stress, and robustness to churn. Several rely on multiple description coding in order to facilitate mesh-based or forest-based approaches. We believe, however, that a number of important applications such as broadcast video, pyramid video-on-demand, digital fountains, and data cycles to name a few exhibit a great deal of latency tolerance. For these applications, stretch is immaterial as long as join/leave latencies are minimized. If stretch is no longer a concern, simply chaining peers into a line emerges as a natural design choice for minimizing stress. The realities of loss, churn, and heterogeneous peer capabilities make implementing such a design challenging. In this paper, we show that by using a layered data model, a linear distribution scheme can be very effectively achieved and can be superior to MDC-based schemes. The paper describes our system called StrandCast and presents simulation results demonstrating its effectiveness and comparing it to SplitStream.
StrandCast:用于容忍延迟应用程序的点对点内容分发
现有的流对等分布架构旨在平衡伸缩性、压力和健壮性之间的内在权衡。一些依赖于多重描述编码,以促进基于网格或基于森林的方法。然而,我们相信,许多重要的应用程序,如广播视频、金字塔视频点播、数字喷泉和数据周期等,都表现出很大的延迟容忍度。对于这些应用程序,只要连接/离开延迟最小化,拉伸就无关紧要。如果拉伸不再是一个问题,那么简单地将同伴连接成一条线就会成为最小化压力的自然设计选择。损失、流失和异构对等功能的现实使得实现这样的设计具有挑战性。在本文中,我们证明了通过使用分层数据模型,可以非常有效地实现线性分布方案,并且可以优于基于mdc的方案。本文介绍了我们的系统StrandCast,并给出了仿真结果,证明了它的有效性,并将其与SplitStream进行了比较。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信