Toward new peering strategies for push-pull based P2P streaming systems
Toward new peering strategies for push-pull based P2P streaming systems
复制标题
DOI：
10.1109/icumt.2009.5345394
复制
发表时间：
2009-12
期刊：
影响因子：
--
通讯作者：
A. Ouali;B. Kerhervé;B. Jaumard
中科院分区：
文献类型：
--
作者：
A. Ouali;B. Kerhervé;B. Jaumard
近年来，一些基于网格的P2P流媒体直播系统采用推拉机制代替传统的拉机制。推拉机制在开销方面更有效，并且导致更好的回放延迟性能，因为它消除了拉内容检索的三个步骤的需要：缓冲区映射广播，数据请求和数据发送。因此，使用拉机制不是评估对等策略的性能的最佳方式，特别是以回放延迟最小化为目标的对等策略。我们建议重新审视对等策略，重点是回放延迟最小化。这种策略将受益于推拉机制，因为拉部分主要在会话开始时使用或用于恢复丢失的内容。我们相信，对节点关系做出正确的决定将提高P2P系统的性能。我们提出了新的对等策略进行比较，通过模拟，与最近的一些策略。结果表明，所提出的策略之一，显着优于现有的参与节点所经历的播放延迟。
Recently, several mesh-based P2P live streaming systems are adopting a push-pull mechanism instead of the classical pull mechanism. A push-pull mechanism is more efficient in terms of overhead and leads to much better playback delay performance because it eliminates the need of the three steps of pull content retrieval: Buffer map broadcast, data request and data sending. Thus, using the pull mechanism is not the best way to evaluate the performance of peering strategies especially the ones targeting playback delay minimization. We propose to revisit the peering strategies with a focus on playback delay minimization. Such strategies will benefit from the push-pull mechanism as the pull part is used mainly at the beginning of the session or to recover lost content. We believe that making the right decisions about node relationships will boost the performance of P2P systems. We propose new peering strategies that are compared, through simulations, with some recent strategies. Results show that one of the proposed strategies outperforms significantly the existing ones with respect to the playback delay experienced by participating nodes.