Phosphite: Guaranteeing out-of-order download in P2P video on demand

We propose Phosphite, a mechanism to preserve out of order download in peer to peer video-on-demand applications, in the presence of selfish peers. In such applications, peers have a natural trend to download blocks in order to start watching videos as soon as possible. Without specific mechanism to enforce a fair amount of out of order download, the last blocks of the video tend to be lost due to peers leaving soon after having downloaded the last blocks thus forcing peers to rely on the central server for re-introducing those lost blocks. This issue can be solved if peers dedicate a portion of their bandwidth for out of order downloads. Yet, this heavily relies on the goodwill of peers to collaborate. Phosphite is a simple yet efficient approach ensuring that all peers dedicate a part of their bandwidth to out of order download. Phosphite relies on a computational challenge where peers are provided with a combination of the requested blocks and other blocks. This forces peers to download out of order blocks to be able to decode the requested blocks. We evaluate Phosphite and show that it successfully prevents the system from losing blocks, even in the presence of selfish peers, thus offering an appealing alternative to state of the art approaches. With Phosphite, the last blocks remain available (with a probability higher than 0.98), while such result cannot be guaranteed (with a probability lower than 0.5) without enforcement mechanism. Phosphite ensures that a peer to peer download is almost always possible, even in the presence of selfish peers.

[1]  Niklas Carlsson,et al.  Peer-assisted On-demand Video Streaming with Selfish Peers , 2009, Networking.

[2]  David J. C. MacKay,et al.  Information Theory, Inference, and Learning Algorithms , 2004, IEEE Transactions on Information Theory.

[3]  Stefan Schmid,et al.  Rescuing Tit-for-Tat with Source Coding , 2007, Seventh IEEE International Conference on Peer-to-Peer Computing (P2P 2007).

[4]  Bobby Bhattacharjee,et al.  Bittorrent is an auction: analyzing and improving bittorrent's incentives , 2008, SIGCOMM '08.

[5]  Michal Feldman,et al.  Overcoming free-riding behavior in peer-to-peer systems , 2005, SECO.

[6]  B. Cohen,et al.  Incentives Build Robustness in Bit-Torrent , 2003 .

[7]  G. S. Vernam,et al.  Cipher Printing Telegraph Systems For Secret Wire and Radio Telegraphic Communications , 1926, Transactions of the American Institute of Electrical Engineers.

[8]  Andreas Haeberlen,et al.  PeerReview: practical accountability for distributed systems , 2007, SOSP.

[9]  Johan Pouwelse,et al.  Give-to-Get: free-riding resilient video-on-demand in P2P systems , 2008, Electronic Imaging.

[10]  Christos Gkantsidis,et al.  Network coding for large scale content distribution , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[11]  Yu Peng,et al.  Robust incentives via multi‐level Tit‐for‐Tat , 2008, IPTPS.

[12]  L. Goddard Information Theory , 1962, Nature.

[13]  Yung Ryn Choe,et al.  Improving VoD server efficiency with bittorrent , 2007, ACM Multimedia.

[14]  Pablo Rodriguez,et al.  I tube, you tube, everybody tubes: analyzing the world's largest user generated content video system , 2007, IMC '07.

[15]  Eytan Adar,et al.  Free Riding on Gnutella , 2000, First Monday.

[16]  Ben Y. Zhao,et al.  Understanding user behavior in large-scale video-on-demand systems , 2006, EuroSys.

[17]  Robert Michael Tanner,et al.  A recursive approach to low complexity codes , 1981, IEEE Trans. Inf. Theory.

[18]  Siddhartha Annapureddy,et al.  Is high-quality vod feasible using P2P swarming? , 2007, WWW '07.

[19]  Niklas Carlsson,et al.  Peer-Assisted On-Demand Streaming of Stored Media Using BitTorrent-Like Protocols , 2007, Networking.

[20]  Carey L. Williamson,et al.  Analysis of bittorrent-like protocols for on-demand stored media streaming , 2008, SIGMETRICS '08.

[21]  Pablo Rodriguez,et al.  Watching television over an IP network , 2008, IMC '08.

[22]  Claude E. Shannon,et al.  Communication theory of secrecy systems , 1949, Bell Syst. Tech. J..

[23]  Guillaume Urvoy-Keller,et al.  Rarest first and choke algorithms are enough , 2006, IMC '06.