首页> 外文期刊>IEEE Journal on Selected Areas in Communications >Outreach: peer-to-peer topology construction towards minimized server bandwidth costs
【24h】

Outreach: peer-to-peer topology construction towards minimized server bandwidth costs

机译:外联:点对点拓扑结构,以最大限度地减少服务器带宽成本

获取原文
获取原文并翻译 | 示例
           

摘要

On-demand and live multimedia streaming applications (such as Internet TV) are well known to utilize a significant amount of bandwidth from media streaming servers, especially as the number of participating peers in the streaming session scales up. To scale to higher bit rates of media streams and larger numbers of participating peers, overlay tree or mesh topologies are typically constructed, such that peers utilize their available upload capacities to alleviate the excessive bandwidth demands on stream servers. Previous works rely on random selections of upstream peers, without optimizing the topologies towards maximized utilization of peer upload bandwidth, and as a result, minimized bandwidth costs on streaming servers. We propose Outreach, a distributed algorithm to construct overlay topologies among participating peers in streaming sessions. The design objective of Outreach is to optimize the quality of overlay topologies towards scalability, with respect to the number of participating peers in the session. To be scalable, Outreach seeks to maximize the utilization of available upload bandwidth on each participating peer, and consequently minimize the total bandwidth costs on streaming servers. With analysis, we show that Outreach constructs topologies such that peers can fully utilize their upload capacities, and present a practical distributed algorithm. With simulation-based comparison studies, we show that Outreach effectively achieves its goals in a high-churn peer-to-peer network with an assortment of peer uplink capacities and link delays
机译:众所周知,点播和实时多媒体流应用程序(例如Internet TV)利用来自媒体流服务器的大量带宽,特别是随着流会话中参与对等端的数量的增加。为了扩展到更高的媒体流比特率和更多的参与对等体,通常构建覆盖树或网格拓扑,以便对等体利用其可用的上载容量来减轻流服务器上过多的带宽需求。先前的工作依赖于上游对等方的随机选择,而没有优化拓扑结构以最大程度地利用对等方上载带宽,从而使流服务器上的带宽成本最小化。我们提出了Outreach,这是一种分布式算法,用于在流会话中的参与对等方之间构建叠加拓扑。外展的设计目标是针对会话中参与对等方的数量,优化可扩展性覆盖拓扑的质量。为了实现可扩展性,Outreach寻求最大程度地利用每个参与对等方上的可用上传带宽,并因此将流服务器上的总带宽成本最小化。通过分析,我们表明Outreach构建了拓扑,以便对等方可以充分利用其上传能力,并提出了一种实用的分布式算法。通过基于仿真的比较研究,我们表明Outreach在各种对等上行链路容量和链路延迟的高流量对等网络中有效实现了其目标

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号