A Framework for the Design Configuration of Accountable Selfish-Resilient Peer-to-Peer Systems

A challenge in designing a peer-to-peer (P2P) system is to ensure that the system is able to tolerate selfish nodes that strategically deviate from their specification whenever doing so is convenient. In this paper, we propose RACOON, a framework for the design of P2P systems that are resilient to selfish behaviours. While most existing solutions target specific systems or types of selfishness, RACOON proposes a generic and semi-automatic approach that achieves robust and reusable results. Also, RACOON supports the system designer in the performance-oriented tuning of the system, by proposing a novel approach that combines Game Theory and simulations. We illustrate the benefits of using RACOON by designing two P2P systems: a live streaming and an anonymous communication system. In simulations and a real deployment of the two applications on a testbed comprising 100 nodes, the systems designed using RACOON achieve both resilience to selfish nodes and high performance.

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

[2]  Vivien Quéma,et al.  FullReview: Practical Accountability in Presence of Selfish Nodes , 2014, 2014 IEEE 33rd International Symposium on Reliable Distributed Systems.

[3]  Levente Buttyán,et al.  Stimulating Cooperation in Self-Organizing Mobile Ad Hoc Networks , 2003, Mob. Networks Appl..

[4]  David C. Parkes,et al.  On non-cooperative location privacy: a game-theoretic analysis , 2009, CCS.

[5]  Andreas Haeberlen,et al.  Accountable Virtual Machines , 2010, OSDI.

[6]  Jérémie Decouchant,et al.  AcTinG: Accurate Freerider Tracking in Gossip , 2014, SRDS.

[7]  Vivien Quéma,et al.  FireSpam: Spam Resilient Gossiping in the BAR Model , 2010, 2010 29th IEEE Symposium on Reliable Distributed Systems.

[8]  Ariel Rubinstein,et al.  A Course in Game Theory , 1995 .

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

[10]  Athanasios V. Vasilakos,et al.  Peer-to-Peer Media Streaming: Insights and New Developments , 2011, Proceedings of the IEEE.

[11]  Youki Kadobayashi,et al.  Practical network traffic analysis in P2P environment , 2011, 2011 7th International Wireless Communications and Mobile Computing Conference.

[12]  V. Georgiev.  Using Game Theory to Analyze Wireless Ad Hoc Networks . ” , 2008 .

[13]  Cisco Visual Networking Index: Forecast and Methodology 2016-2021.(2017) http://www.cisco.com/c/en/us/solutions/collateral/service-provider/visual- networking-index-vni/complete-white-paper-c11-481360.html. High Efficiency Video Coding (HEVC) Algorithms and Architectures https://jvet.hhi.fraunhofer. , 2017 .

[14]  Bernhard von Stengel,et al.  Fast algorithms for finding randomized strategies in game trees , 1994, STOC '94.

[15]  Amin Vahdat,et al.  Mace: language support for building distributed systems , 2007, PLDI '07.

[16]  Saurabh Ganeriwal,et al.  On selfish behavior in CSMA/CA networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[17]  André Schiper,et al.  Distal: A framework for implementing fault-tolerant distributed algorithms , 2013, 2013 43rd Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN).

[18]  Michael Dahlin,et al.  BAR gossip , 2006, OSDI '06.

[19]  Ali Shoker,et al.  RAC: A Freerider-Resilient, Scalable, Anonymous Communication Protocol , 2013, 2013 IEEE 33rd International Conference on Distributed Computing Systems.

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

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

[22]  Michael Dahlin,et al.  BAR fault tolerance for cooperative services , 2005, SOSP '05.

[23]  Sheng Zhong,et al.  Sprite: a simple, cheat-proof, credit-based system for mobile ad-hoc networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[24]  Péter Urbán,et al.  Neko: a single environment to simulate and prototype distributed algorithms , 2001, Proceedings 15th International Conference on Information Networking.

[25]  Levente Buttyán,et al.  Rational Exchange - A Formal Model Based on Game Theory , 2001, WELCOM.

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

[27]  Christos H. Papadimitriou,et al.  Free-riding and whitewashing in peer-to-peer systems , 2004, IEEE Journal on Selected Areas in Communications.

[28]  Can Peer-to-Peer live streaming systems coexist with free riders? , 2013, IEEE P2P 2013 Proceedings.

[29]  Paul F. Syverson,et al.  Onion routing , 1999, CACM.