首页> 外文期刊>IEEE Transactions on Parallel and Distributed Systems >Dynamic Bandwidth Auctions in Multioverlay P2P Streaming with Network Coding
【24h】

Dynamic Bandwidth Auctions in Multioverlay P2P Streaming with Network Coding

机译:具有网络编码的多覆盖P2P流中的动态带宽拍卖

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

摘要

In peer-to-peer (P2P) live streaming applications such as IPTV, it is natural to accommodate multiple coexisting streaming overlays, corresponding to channels of programming. In the case of multiple overlays, it is a challenging task to design an appropriate bandwidth allocation protocol, such that these overlays efficiently share the available upload bandwidth on peers, media content is efficiently distributed to achieve the required streaming rate, as well as the streaming costs are minimized. In this paper, we seek to design simple, effective and decentralized strategies to resolve conflicts among coexisting streaming overlays in their bandwidth competition, and combine such strategies with network coding based media distribution to achieve efficient multi-overlay streaming. Since such strategies of conflict are game theoretic in nature, we characterize them as a decentralized collection of dynamic auction games, in which downstream peers bid for upload bandwidth at the upstream peers for the delivery of coded media blocks. With extensive theoretical analysis and performance evaluation, we show that these local games converge to an optimal topology for each overlay in realistic asynchronous environments. Together with network coding based media dissemination, these streaming overlays adapt to peer dynamics, fairly share peer upload bandwidth to achieve satisfactory streaming rates, and can be prioritized.
机译:在点对点(P2P)实时流媒体应用程序(例如IPTV)中,很自然地可以容纳多个共存的流媒体叠加层,这与编程频道相对应。在有多个覆盖的情况下,设计适当的带宽分配协议是一项艰巨的任务,以使这些覆盖有效地在对等方之间共享可用的上传带宽,有效地分发媒体内容以达到所需的流传输率以及流传输成本降到最低。在本文中,我们寻求设计简单,有效和分散的策略,以解决共存流媒体覆盖之间的带宽竞争中的冲突,并将此类策略与基于网络编码的媒体分发相结合,以实现高效的多覆盖流媒体。由于此类冲突策略本质上是博弈论的,因此我们将它们描述为动态拍卖游戏的分散集合,其中下游对等方竞标上游对等方的上传带宽以传输编码媒体块。通过大量的理论分析和性能评估,我们证明了这些本地游戏对于现实的异步环境中的每个覆盖都收敛于最佳拓扑。与基于网络编码的媒体分发一起,这些流媒体叠加层可适应对等体动态,公平地共享对等体上载带宽以实现令人满意的流媒体速率,并可对其进行优先级排序。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号