On Reducing Mesh Delay for Peer-to-Peer Live Streaming

Abstract

Abstract-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.

The state of peer-to-peer network simulators

“…We gathered information from two groups: the authors of the papers that [ Annapureddy et al 2007b;Yunhao et al 2007;Xie et al 2008;Mol et al 2008;Silva et al 2008;Iliofotou et al 2009;Pianese et al 2007;Annapureddy et al 2007a;Leonardi et al 2008;Doulkeridis et al 2007a;Cheng et al 2007;Chi et al 2007;Rowaihy et al 2007;Ahmed and Boutaba 2007;Belenkiy et al 2007;Kantere et al 2009;Huang et al 2007b;Garbacki et al 2007;Buchegger et al 2009;Crainiceanu et al 2007;Zhou and Hwang 2007;Bharambe et al 2008;Terpstra et al 2007;Zaharia and Keshav 2008;Wang et al 2007;Guo et al 2007;Hefeeda and Saleh 2008;Ren et al 2008;Zhou et al 2008;Zhuge and Li 2007;Haridasan and van Renesse 2008;Feng and Li 2008;Magharei and Rejaie 2009a;Liu 2007;Yang and Chen 2008;Do et al 2008;Do et al 2009;Boufkhad et al 2008;Duminuco and Biersack 2008;Yiu et al 2007;Doulkeridis et al 2007b;…”

Service quality in P2P streaming systems

“…In spite of these shortcomings there are some proposals advocating proxy-based solutions (see e.g. [94,47]). Basically, we distinguish between solutions choosing proxynodes explicitly and implicitly.…”

A Hybrid Approach to Assess the Network Awareness of P2P-TV Applications

“…We can thus conclude that PPLive peers do not bias their download policy in terms of nodes proximity, neither in terms of IP hop distance, nor in terms of delay. In other words, PPLive does not seem to implement proximity techniques such as [16][17][18][19][20][21][22].…”

“…or even by allowing ISPs to participate in this process [18]. At the same time, we point out that most of these techniques have been developed in the more general context of P2P applications and have only more recently been cast to P4P-TV [19][20][21][22][23][24] which can be explained by the fact that other classes P2P applications, such as filesharing, can be more easily engineered since they lack the need to preserve the temporal coherence of the fetched content.…”