On Reducing Mesh Delay for Peer-to-Peer Live Streaming
On Reducing Mesh Delay for Peer-to-Peer Live Streaming
复制标题
DOI：
10.1109/infocom.2008.160
复制
发表时间：
2008-04
期刊：
影响因子：
--
通讯作者：
D. Ren;Y. Li;S. Chan
中科院分区：
文献类型：
--
作者：
D. Ren;Y. Li;S. Chan
P2P(Peer-to-Peer)技术已经成为一种很有前途的可扩展的解决方案，可用于向大群组进行直播。在本文中，我们提出了一种能够实现低源到点延迟、对用户流失具有健壮性、能够适应非对称和多样化的上行链路带宽、并在现有用户池的基础上不断改进的覆盖网络的设计。一个自然的选择是使用Mesh，其中每个对等点由多个父母提供服务。由于Mesh中节点的延迟依赖于其通过父节点的最长路径，因此我们研究了如何在满足一定的流速率要求的情况下优化这种延迟。我们首先建立了最小延迟网格问题的数学模型，并证明了该问题是NP难的。然后，我们提出了一个基于完全知识的集中式启发式算法，作为我们的基准和比较中的所有其他方案的最优解。我们的启发式算法利用了吞吐量与时延之比给出的网络功率的概念。通过最大化网络功率，我们的启发式算法实现了非常低的延迟。然后，我们提出了一个简单的分布式算法，在该算法中，节点根据功率概念选择自己的父节点。该算法对时延进行不断的改进，直到达到某一最小时延。仿真结果表明，我们的分布式协议性能接近集中式协议，并且大大优于传统和最先进的方法。
Peer-to-peer (P2P) technology has emerged as a promising scalable solution for live streaming to large group. In this paper, we address the design of overlay which achieves low source-to-peer delay, is robust to user churn, accommodates of asymmetric and diverse uplink bandwidth, and continuously improves based on existing user pool. A natural choice is the use of mesh, where each peer is served by multiple parents. Since the peer delay in a mesh depends on its longest path through its parents, we study how to optimize such delay while meeting a certain streaming rate requirement. We first formulate the minimum delay mesh problem and show that it is NP-hard. Then we propose a centralized heuristic based on complete knowledge which serves as our benchmark and optimal solution for all the other schemes under comparison. Our heuristic makes use of the concept of power in network given by the ratio of throughput and delay. By maximizing the network power, our heuristic achieves very low delay. We then propose a simple distributed algorithm where peers select their parents based on the power concept. The algorithm makes continuous improvement on delay until some minimum delay is reached. Simulation results show that our distributed protocol performs close to the centralized one, and substantially outperforms traditional and state-of-the-art approaches.