Resilient mesh-tree overlay for differentiated temporal requirement service in P2P streaming

Jiaming Li, C. Yeo, I. Soon
{"title":"Resilient mesh-tree overlay for differentiated temporal requirement service in P2P streaming","authors":"Jiaming Li, C. Yeo, I. Soon","doi":"10.1109/CCNC.2014.6866587","DOIUrl":null,"url":null,"abstract":"Robustness is an important issue in tree based P2P streaming applications. In this paper, a new criterion to evaluate robustness is proposed. The criterion is derived from examining the weakest link of stream sources serving a peer. The quality of connection is defined as how complementary the connection is to the other existing connections in order to improve the completeness of the downloading stream as well as the backup copies. Peers can thus find better connection combination and experience the best stream quality and backup robustness from the existing connections. The collective maximization of robustness among peers rather than maximization of a peer's own resource alleviates the contention for resources, and helps the peers to reasonably allocate and utilize the limited network resources. Simulation results show marked performance improvement over other related proposals in terms of stream quality, speed of recovery from failure and ability to respond quickly to changing overlay and network dynamics.","PeriodicalId":287724,"journal":{"name":"2014 IEEE 11th Consumer Communications and Networking Conference (CCNC)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 IEEE 11th Consumer Communications and Networking Conference (CCNC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CCNC.2014.6866587","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Robustness is an important issue in tree based P2P streaming applications. In this paper, a new criterion to evaluate robustness is proposed. The criterion is derived from examining the weakest link of stream sources serving a peer. The quality of connection is defined as how complementary the connection is to the other existing connections in order to improve the completeness of the downloading stream as well as the backup copies. Peers can thus find better connection combination and experience the best stream quality and backup robustness from the existing connections. The collective maximization of robustness among peers rather than maximization of a peer's own resource alleviates the contention for resources, and helps the peers to reasonably allocate and utilize the limited network resources. Simulation results show marked performance improvement over other related proposals in terms of stream quality, speed of recovery from failure and ability to respond quickly to changing overlay and network dynamics.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
P2P流中差异化时间需求服务的弹性网格树覆盖
鲁棒性是基于树的P2P流媒体应用的一个重要问题。本文提出了一种新的鲁棒性评价准则。该标准是通过检查为对等体提供服务的流源的最薄弱环节得出的。连接的质量定义为该连接与其他现有连接的互补程度,以提高下载流和备份副本的完整性。对等体可以从现有的连接中找到更好的连接组合,体验到最好的流质量和备份鲁棒性。对等体之间鲁棒性的集体最大化,而不是对等体自身资源的最大化,缓解了对资源的争夺,有助于对等体合理分配和利用有限的网络资源。仿真结果表明,与其他相关方案相比,该方案在流质量、故障恢复速度以及快速响应覆盖层和网络动态变化的能力方面有了显著的性能改进。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
COBRA: Lean intra-domain routing in NDN Browser-based web content sharing system Demonstration of adaptive multi-gateway mesh network Asymmetric secret sharing scheme suitable for cloud systems Content protection and secure synchronization of HTML5 local storage data
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1