An Efficient, Scalable and Robust P2P Overlay for Autonomic Communication

The term Autonomic Communication (AC) refers to self-managing systems which are capable of supporting self-configuration, self-healing and self-optimization. However, information reflection and collection, lack of centralized control, non-cooperation and so on are just some of the challenges within AC systems. Since many self-* properties (e.g. selfconfiguration, self-optimization, self-healing, and self-protecting) are achieved by a group of autonomous entities that coordinate in a peer-to-peer (P2P) fashion, it has opened the door to migrating research techniques from P2P systems. P2P’s meaning can be better understood with a set of key characteristics similar to AC: Decentralized organization, Self-organizing nature (i.e. adaptability), Resource sharing and aggregation, and Fault-tolerance. However, not all P2P systems are compatible with AC. Unstructured systems are designed more specifically than structured systems for the heterogeneous Internet environment, where the nodes’ persistence and availability are not guaranteed. Motivated by the challenges in AC and based on comprehensive analysis of popular P2P applications, three correlative standards for evaluating the compatibility of a P2P system with AC are presented in this chapter. According to these standards, a novel Efficient, Scalable and Robust (ESR) P2P overlay is proposed. Differing from current structured and unstructured, or meshed and tree-like P2P overlay, the ESR is a whole new three dimensional structure to improve the efficiency of routing, while information exchanges take in immediate neighbors with local information to make the system scalable and fault-tolerant. Furthermore, rather than a complex game theory or incentive mechanism, asimple but effective punish mechanism has been presented based on a new ID structure which can guarantee the continuity of each node’s record in order to discourage negative behavior on an autonomous environment as AC.

[1]  Chung-Ming Huang,et al.  Network-aware P2P file sharing over the wireless mobile networks , 2007, IEEE Journal on Selected Areas in Communications.

[2]  Ratul Mahajan,et al.  Practical and efficient internet routing with competing interests , 2005 .

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

[4]  Christos Gkantsidis,et al.  Random walks in peer-to-peer networks , 2004, IEEE INFOCOM 2004.

[5]  Jon M. Kleinberg,et al.  The small-world phenomenon: an algorithmic perspective , 2000, STOC '00.

[6]  Christos H. Papadimitriou,et al.  Free-riding and whitewashing in peer-to-peer systems , 2006, IEEE J. Sel. Areas Commun..

[7]  Athanasios V. Vasilakos,et al.  An Adaptive and Self-Supervised Structured P2P Overlay for Autonomic Communication , 2007, ICWN.

[8]  Mihajlo A. Jovanović,et al.  Modeling Large-scale Peer-to-Peer Networks and a Case Study of Gnutella , 2001 .

[9]  David R. Karger,et al.  Chord: a scalable peer-to-peer lookup protocol for internet applications , 2003, TNET.

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

[11]  Brian F. Cooper.  An Optimal Overlay Topology for Routing Peer-to-Peer Searches , 2005, Middleware.

[12]  Emin Gün Sirer,et al.  Hyperspaces for Object Clustering and Approximate Matching in Peer-to-Peer Overlays , 2007, HotOS.

[13]  Yiwei Thomas Hou,et al.  Guest Editorial Recent Advances in Service Overlay Networks , 2004 .

[14]  Lada A. Adamic,et al.  Search in Power-Law Networks , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.

[15]  Hector Garcia-Molina,et al.  Efficient search in peer to peer networks , 2004 .

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

[17]  Peter Milligan,et al.  iXChange - a self-organising super peer network model , 2005, 10th IEEE Symposium on Computers and Communications (ISCC'05).

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

[19]  Hector Garcia-Molina,et al.  Improving search in peer-to-peer networks , 2002, Proceedings 22nd International Conference on Distributed Computing Systems.

[20]  Rayadurgam Srikant,et al.  Modeling and performance analysis of BitTorrent-like peer-to-peer networks , 2004, SIGCOMM 2004.

[21]  Ratan K. Guha,et al.  Preferential and strata based P2P model: selfishness to altruism and fairness , 2006, 12th International Conference on Parallel and Distributed Systems - (ICPADS'06).

[22]  John R. Douceur,et al.  The Sybil Attack , 2002, IPTPS.

[23]  Vwani P. Roychowdhury,et al.  Percolation search in power law networks: making unstructured peer-to-peer networks scalable , 2004 .

[24]  Wolfgang Nejdl,et al.  Distributed Queries and Query Optimization in Schema-Based P2P-Systems , 2003, DBISP2P.

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

[26]  Joseph Y. Halpern,et al.  Efficiency and nash equilibria in a scrip system for P2P networks , 2006, EC '06.

[27]  Ramanathan V. Guha,et al.  Propagation of trust and distrust , 2004, WWW '04.

[28]  Yuh-Jzer Joung,et al.  Reducing maintenance overhead in Chord via heterogeneity , 2005, CCGrid 2005. IEEE International Symposium on Cluster Computing and the Grid, 2005..

[29]  Miguel Castro,et al.  Secure routing for structured peer-to-peer overlay networks , 2002, OSDI '02.

[30]  R. Johari,et al.  A peer-to-peer system as an exchange economy , 2006, GameNets '06.

[31]  Kien A. Hua,et al.  Dynamic Load Balancing in Multicomputer Database Systems Using Partition Tuning , 1995, IEEE Trans. Knowl. Data Eng..

[32]  Kien A. Hua,et al.  A peer-to-peer architecture for media streaming , 2004, IEEE Journal on Selected Areas in Communications.

[33]  Allen B. MacKenzie,et al.  Using game theory to analyze wireless ad hoc networks , 2005, IEEE Communications Surveys & Tutorials.

[34]  Kostas G. Anagnostakis,et al.  Exchange-based incentive mechanisms for peer-to-peer file sharing , 2004, 24th International Conference on Distributed Computing Systems, 2004. Proceedings..

[35]  Costas Courcoubetis,et al.  Incentives for large peer-to-peer systems , 2006, IEEE Journal on Selected Areas in Communications.

[36]  Ellen W. Zegura,et al.  How to model an internetwork , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

[37]  L. Rong,et al.  Dynamic resource adaptation in a heterogeneous peer-to-peer environment , 2005, Second IEEE Consumer Communications and Networking Conference, 2005. CCNC. 2005.

[38]  Faris S. Majeed,et al.  Improving query answering in peer-to-peer data searching , 2005, 19th International Conference on Advanced Information Networking and Applications (AINA'05) Volume 1 (AINA papers).

[39]  Franco Zambonelli,et al.  A survey of autonomic communications , 2006, TAAS.