Tracking freeriders in gossip-based content dissemination systems

Gossip-based protocols have proven very efficient for disseminating high-bandwidth content such as video streams in a peer-to-peer fashion. However, for the protocols to work, nodes are required to collaborate by devoting a fraction of their upload bandwidth, a scarce resource for some of them, to forward the content they receive to other nodes. Consequently, such protocols suffer from freeriding, a common phenomenon on the Internet, which consists in selfishly benefiting from the system without contributing its fair share. Due to the dynamic nature and the inherent randomness of gossip protocols and to the high scalability requirements of video streaming systems, detecting freeriders is a difficult challenge. This paper presents LiFTinG, the first protocol for detecting freeriders, including colluding ones, in gossip-based content dissemination systems with asymmetric data exchanges. In addition, LiFTinG is still able to detect freeriders when network coding, a widely used technique to improve the efficiency of content dissemination, is used. LiFTinG relies on nodes to track abnormal behavior by cross-checking the history of their previous interactions and exploits the fact that nodes pick neighbors at random to prevent colluding nodes from mutually covering up their bad actions. We present a methodology for setting the parameters of LiFTinG to their optimal value, based on a theoretical analysis and we quantify theoretically the performance of LiFTinG. We derive, based on simulations, the optimal strategy of freeriders by taking into account, through a utility function, the benefit of freeriding and the probability of being detected. In addition to these simulations, we report on the deployment of LiFTinG on PlanetLab. In a 300-node system, where a stream of 674kbps is broadcasted, LiFTinG incurs a maximum overhead of only 8% and provides good detection results: For instance, with 10% of freeriders decreasing their contribution by up to 30%, LiFTinG detects 86% of the freeriders after only 30s and wrongfully expels only a few honest nodes (most of them actually being buggy).

[1]  Dan Wing,et al.  Session Traversal Utilities for NAT (STUN) , 2020, RFC.

[2]  Anne-Marie Kermarrec,et al.  Probabilistic Reliable Dissemination in Large-Scale Systems , 2003, IEEE Trans. Parallel Distributed Syst..

[3]  Roger Zimmermann,et al.  ISP-friendly P2P live streaming: A roadmap to realization , 2012, TOMCCAP.

[4]  Ramayya Krishnan,et al.  The impact of free-riding on peer-to-peer networks , 2004, 37th Annual Hawaii International Conference on System Sciences, 2004. Proceedings of the.

[5]  Thomas E. Anderson,et al.  One Hop Reputations for Peer to Peer File Sharing Workloads , 2008, NSDI.

[6]  Andreas Haeberlen,et al.  CSAR: A Practical and Provable Technique to Make Randomized Systems Accountable , 2009, NDSS.

[7]  G. Hardin,et al.  The Tragedy of the Commons , 1968, Green Planet Blues.

[8]  Laurent Massoulié,et al.  Epidemic live streaming: optimal performance trade-offs , 2008, SIGMETRICS '08.

[9]  Reza Rejaie,et al.  PRIME: peer-to-peer receiver-driven mesh-based streaming , 2009, TNET.

[10]  Lakshminarayanan Subramanian,et al.  Sybil-Resilient Online Content Voting , 2009, NSDI.

[11]  Laurent Massoulié,et al.  ISP Friend or Foe? Making P2P Live Streaming ISP-Aware , 2009, 2009 29th IEEE International Conference on Distributed Computing Systems.

[12]  Behzad Akbari,et al.  Mesh based P2P video streaming with a distributed incentive mechanism , 2011, The International Conference on Information Networking 2011 (ICOIN2011).

[13]  Indranil Gupta,et al.  AVMON: Optimal and Scalable Discovery of Consistent Availability Monitoring Overlays for Distributed Systems , 2007, IEEE Transactions on Parallel and Distributed Systems.

[14]  Paul Francis,et al.  Chunkyspread: Heterogeneous Unstructured Tree-Based Peer-to-Peer Multicast , 2006, Proceedings of the 2006 IEEE International Conference on Network Protocols.

[15]  Anne-Marie Kermarrec,et al.  SCAMP: Peer-to-Peer Lightweight Membership Service for Large-Scale Group Communication , 2001, Networked Group Communication.

[16]  Ozalp Babaoglu,et al.  Detection and Removal of Malicious Peers in Gossip-Based Protocols∗ , 2004 .

[17]  Geoff Coulson,et al.  Free Riding on Gnutella Revisited: The Bell Tolls? , 2005, IEEE Distributed Syst. Online.

[18]  Anne-Marie Kermarrec,et al.  LiFTinG: Lightweight Freerider-Tracking in Gossip , 2010, Middleware.

[19]  Lifeng Sun,et al.  Understanding the Power of Pull-Based Streaming Protocol: Can We Do Better? , 2007, IEEE Journal on Selected Areas in Communications.

[20]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[21]  Stefan Schmid,et al.  Free Riding in BitTorrent is Cheap , 2006, HotNets.

[22]  Anne-Marie Kermarrec,et al.  Heterogeneous Gossiping , 2016 .

[23]  Hossam S. Hassanein,et al.  A survey of peer-to-peer live video streaming schemes - An algorithmic perspective , 2012, Comput. Networks.

[24]  Klemens Böhm,et al.  FairNet - How to Counter Free Riding in Peer-to-Peer Data Structures , 2004, CoopIS/DOA/ODBASE.

[25]  Tracey Ho,et al.  A Random Linear Network Coding Approach to Multicast , 2006, IEEE Transactions on Information Theory.

[26]  Eitan Altman,et al.  Predicting the impact of measures against P2P networks on the transient behaviors , 2010, 2011 Proceedings IEEE INFOCOM.

[27]  Baochun Li,et al.  R2: Random Push with Random Network Coding in Live Peer-to-Peer Streaming , 2007, IEEE Journal on Selected Areas in Communications.

[28]  Arun Venkataramani,et al.  Do incentives build robustness in bit torrent , 2007 .

[29]  Johan A. Pouwelse,et al.  BarterCast: A practical approach to prevent lazy freeriding in P2P networks , 2009, 2009 IEEE International Symposium on Parallel & Distributed Processing.

[30]  Bo Li,et al.  Inside the New Coolstreaming: Principles, Measurements and Performance Implications , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.

[31]  Michael Sirivianos,et al.  Free-riding in BitTorrent Networks with the Large View Exploit , 2007, IPTPS.

[32]  Ingrid Jansch-Porto,et al.  Enforcing fairness in a live-streaming system , 2008, Electronic Imaging.

[33]  Jun Wang,et al.  Alliatrust: A Trustable Reputation Management Scheme for Unstructured P2P Systems , 2006, GPC.

[34]  Michael Dahlin,et al.  FlightPath: Obedience vs. Choice in Cooperative Services , 2008, OSDI.

[35]  Anne-Marie Kermarrec,et al.  Lightweight probabilistic broadcast , 2003, TOCS.

[36]  Arun Venkataramani,et al.  Do Incentives Build Robustness in BitTorrent? (Awarded Best Student Paper) , 2007, NSDI.

[37]  M. Stephens EDF Statistics for Goodness of Fit and Some Comparisons , 1974 .

[38]  Jalal Kawash,et al.  Specifying memory consistency of write buffer multiprocessors , 2007, TOCS.

[39]  Idit Keidar,et al.  Brahms: byzantine resilient random membership sampling , 2008, PODC '08.

[40]  Nalini Venkatasubramanian,et al.  CREW: A Gossip-based Flash-Dissemination System , 2006, 26th IEEE International Conference on Distributed Computing Systems (ICDCS'06).

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

[42]  Ben Y. Zhao,et al.  An Empirical Study of Collusion Behavior in the Maze P2P File-Sharing System , 2007, 27th International Conference on Distributed Computing Systems (ICDCS '07).

[43]  Farag Azzedin,et al.  Trust-based taxonomy for free riders in distributed multimedia systems , 2010, 2010 International Conference on High Performance Computing & Simulation.

[44]  Anne-Marie Kermarrec,et al.  LiFTinG: Lightweight Freerider-Tracking Protocol in Gossip , 2010 .

[45]  Amir H. Payberah,et al.  Sepidar: Incentivized Market-Based P2P Live-Streaming on the Gradient Overlay Network , 2010, 2010 IEEE International Symposium on Multimedia.

[46]  Ali C. Begen,et al.  SPANC: Optimizing Scheduling Delay for Peer-to-Peer Live Streaming , 2010, IEEE Transactions on Multimedia.

[47]  Stephen A. Jarvis,et al.  A Payment-Based Incentive and Service Differentiation Scheme for Peer-to-Peer Streaming Broadcast , 2008, IEEE Transactions on Parallel and Distributed Systems.

[48]  Xin Wang,et al.  An Incentive Mechanism for Tree-based Live Media Streaming Service , 2010, J. Networks.

[49]  Giuseppe Di Battista,et al.  26 Computer Networks , 2004 .

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

[51]  Hector Garcia-Molina,et al.  The Eigentrust algorithm for reputation management in P2P networks , 2003, WWW '03.

[52]  Johan A. Pouwelse,et al.  Tribler: P2P media search and sharing , 2011, MM '11.

[53]  Anne-Marie Kermarrec,et al.  Gossip-based peer sampling , 2007, TOCS.

[54]  Cristina Nita-Rotaru,et al.  A survey of attack and defense techniques for reputation systems , 2009, CSUR.

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

[56]  Jared Saia,et al.  Choosing a random peer , 2004, PODC '04.

[57]  Reza Rejaie,et al.  PRIME: Peer-to-Peer Receiver-drIven MEsh-Based Streaming , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[58]  Özgür Ulusoy,et al.  Counteracting free riding in Peer-to-Peer networks , 2008, Comput. Networks.

[59]  Anne-Marie Kermarrec,et al.  NAT-resilient Gossip Peer Sampling , 2009, 2009 29th IEEE International Conference on Distributed Computing Systems.

[60]  Anne-Marie Kermarrec,et al.  Stretching gossip with live streaming , 2009, 2009 IEEE/IFIP International Conference on Dependable Systems & Networks.

[61]  Ozalp Babaoglu,et al.  ACM Transactions on Computer Systems , 2007 .

[62]  Hector Garcia-Molina,et al.  Incentives for Combatting Freeriding on P2P Networks , 2003, Euro-Par.

[63]  Leandros Tassiulas,et al.  Reputation-Based Resource Allocation in P2P Systems of Rational Users , 2010, IEEE Transactions on Parallel and Distributed Systems.

[64]  S. Buchegger,et al.  Coping with False Accusations in Misbehavior Reputation Systems for Mobile Ad-hoc Networks , 2003 .

[65]  Hector Garcia-Molina,et al.  Taxonomy of trust: Categorizing P2P reputation systems , 2006, Comput. Networks.

[66]  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..