Optimal Overlay Construction on Heterogeneous Live Peer-to-Peer Streaming Systems

Min Yang, Yuanyuan Yang
{"title":"Optimal Overlay Construction on Heterogeneous Live Peer-to-Peer Streaming Systems","authors":"Min Yang, Yuanyuan Yang","doi":"10.1109/ICPP.2010.77","DOIUrl":null,"url":null,"abstract":"Media streaming is an important Internet application and has received more and more attention in recent years. Traditional media streaming systems are deployed in a server-client mode which scales poorly with the increasing population of the clients. Peer-to-peer media streaming can greatly enhance the scalability of the system by employing the clients to help forward the media content. In this paper, we consider optimizing the overlay construction for peer-to-peer streaming systems with heterogeneous access link bandwidths. Our goal is to maximize the total downloading rate and satisfy the heterogeneous downloading requirements when the uplink bandwidth is limited. We first formalize it into a problem of finding maximum number of edge disjoint trees in a graph which models the peers and their access link bandwidths. Then we give a centralized heuristic algorithm to solve the problem. Based on the centralized algorithm, we further propose a distributed algorithm which constructs an adaptive overlay topology that can adapt itself to the changing peers such that the end-to-end delay and link stress are minimized. We compare our scheme with another recently proposed scheme called MDM through simulations. Our simulation results show that the proposed scheme outperforms MDM by about 30% with respect to the average peer satisfaction. In addition, the proposed scheme achieves less link stress than MDM.","PeriodicalId":180554,"journal":{"name":"2010 39th International Conference on Parallel Processing","volume":"16 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 39th International Conference on Parallel Processing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICPP.2010.77","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

Media streaming is an important Internet application and has received more and more attention in recent years. Traditional media streaming systems are deployed in a server-client mode which scales poorly with the increasing population of the clients. Peer-to-peer media streaming can greatly enhance the scalability of the system by employing the clients to help forward the media content. In this paper, we consider optimizing the overlay construction for peer-to-peer streaming systems with heterogeneous access link bandwidths. Our goal is to maximize the total downloading rate and satisfy the heterogeneous downloading requirements when the uplink bandwidth is limited. We first formalize it into a problem of finding maximum number of edge disjoint trees in a graph which models the peers and their access link bandwidths. Then we give a centralized heuristic algorithm to solve the problem. Based on the centralized algorithm, we further propose a distributed algorithm which constructs an adaptive overlay topology that can adapt itself to the changing peers such that the end-to-end delay and link stress are minimized. We compare our scheme with another recently proposed scheme called MDM through simulations. Our simulation results show that the proposed scheme outperforms MDM by about 30% with respect to the average peer satisfaction. In addition, the proposed scheme achieves less link stress than MDM.
异构实时点对点流系统的最优覆盖结构
流媒体是一种重要的互联网应用,近年来受到越来越多的关注。传统的媒体流系统以服务器-客户端模式部署,随着客户端数量的增加,这种模式的可扩展性很差。点对点媒体流通过使用客户端来转发媒体内容,极大地增强了系统的可扩展性。在本文中,我们考虑优化具有异构访问链路带宽的点对点流系统的覆盖结构。我们的目标是在上行带宽有限的情况下,最大限度地提高总下载速率,满足异构下载需求。我们首先将其形式化为在一个对节点及其接入链路带宽建模的图中寻找最大数目边不相交树的问题。然后给出了一种集中式启发式算法来解决这一问题。在集中式算法的基础上,我们进一步提出了一种分布式算法,该算法构建了一个自适应的覆盖拓扑,可以适应不断变化的对等体,从而使端到端延迟和链路应力最小化。我们通过模拟将我们的方案与最近提出的另一种称为MDM的方案进行比较。我们的模拟结果表明,就平均同伴满意度而言,所提出的方案比MDM高出约30%。此外,该方案比MDM实现更小的链路应力。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信