Building self-adaptive Peer-to-Peer overlay networks with dynamic cluster structure

The tremendous growth of public interest in Peer-to-Peer (P2P) networks in recent years has initiated a lot of research work on how to design efficient overlays for P2P systems. Among them are some overlays that support range queries, but their basic topologies might be different with diverse options, such as ring, cluster, binary tree and doubly-linked lists, etc. In this paper, we present a self-adaptive P2P overlay with dynamic cluster structure that supports range queries. In such cluster-based topologies, a challenge issue is how to choose appropriate cluster size in order to ensure that the least total messages are produced in the network. Inspired by evolutionary game theory, this paper presents a novel approach for improving query routing performance in a fully distributed and self-adaptive way where super-peers can modify their behaviors (merging or splitting clusters) with incomplete information and bounded rationality for the purpose of improving their individual benefit. Extensive experiments have been carried out to assess the performance of the proposed technique. The obtained results have highlighted remarkable benefits under churn in terms of bandwidth consumption.

[1]  Romano Fantacci,et al.  An Evolutionary Game Approach to P2P Video Streaming , 2009, GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference.

[2]  Antony I. T. Rowstron,et al.  Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems , 2001, Middleware.

[3]  Jon Crowcroft,et al.  A survey and comparison of peer-to-peer overlay network schemes , 2005, IEEE Communications Surveys & Tutorials.

[4]  William Pugh,et al.  Skip Lists: A Probabilistic Alternative to Balanced Trees , 1989, WADS.

[5]  Krishna P. Gummadi,et al.  The impact of DHT routing geometry on resilience and proximity , 2003, SIGCOMM '03.

[6]  Fabrice Guillemin,et al.  Experimental analysis of the impact of peer-to-peer applications on traffic in commercial IP networks , 2004, Eur. Trans. Telecommun..

[7]  Niki Pissinou,et al.  Mitigating routing misbehavior in multi-hop networks using evolutionary game theory , 2010, 2010 IEEE Globecom Workshops.

[8]  James Aspnes,et al.  Skip graphs , 2003, SODA '03.

[9]  Michalis Faloutsos,et al.  Transport layer identification of P2P traffic , 2004, IMC '04.

[10]  David R. Karger,et al.  Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM '01.

[11]  Shuigeng Zhou,et al.  A new and effective hierarchical overlay structure for Peer-to-Peer networks , 2011, Comput. Commun..

[12]  Axel W. Krings,et al.  Dynamic Hybrid Fault Modeling and Extended Evolutionary Game Theory for Reliability, Survivability and Fault Tolerance Analyses , 2011, IEEE Transactions on Reliability.

[13]  Peter Druschel,et al.  Pastry: Scalable, distributed object location and routing for large-scale peer-to- , 2001 .

[14]  Jose L. Muñoz,et al.  A game theoretic trust model for on-line distributed evolution of cooperation inMANETs , 2011, J. Netw. Comput. Appl..

[15]  Eitan Altman,et al.  Evolutionary Games in Wireless Networks , 2010, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[16]  Michael B. Jones,et al.  SkipNet: A Scalable Overlay Network with Practical Locality Properties , 2003, USENIX Symposium on Internet Technologies and Systems.

[17]  Thinh Nguyen,et al.  Modeling and Dynamics Analysis of P2P Networks Based on Evolutionary Games , 2009, 2009 First International Conference on Advances in P2P Systems.

[18]  Gade Krishna,et al.  A scalable peer-to-peer lookup protocol for Internet applications , 2012 .

[19]  Eitan Altman,et al.  The evolution of transport protocols: An evolutionary game perspective , 2009, Comput. Networks.

[20]  Ben Y. Zhao,et al.  An Infrastructure for Fault-tolerant Wide-area Location and Routing , 2001 .

[21]  Jianhua Ma,et al.  P2P soft security: On evolutionary dynamics of P2P incentive mechanism , 2011, Comput. Commun..

[22]  J. M. Smith,et al.  The Logic of Animal Conflict , 1973, Nature.

[23]  Mark Handley,et al.  A scalable content-addressable network , 2001, SIGCOMM '01.

[24]  Ian Clarke,et al.  Freenet: A Distributed Anonymous Information Storage and Retrieval System , 2000, Workshop on Design Issues in Anonymity and Unobservability.

[25]  Gian Paolo Jesi.  PeerSim HOWTO : Build a new protocol for the PeerSim 1 . 0 simulator , 2005 .