ITA: Innocuous Topology Awareness for Unstructured P2P Networks

One of the most appealing characteristics of unstructured P2P overlays is their enhanced self-* properties, which results from their loose, random structure. In addition, most of the algorithms which make searching in unstructured P2P systems scalable, such as dynamic querying and 1-hop replication, rely on the random nature of the overlay to function efficiently. The underlying communications network (i.e., the Internet), however, is not as randomly constructed. This leads to a mismatch between the distance of two peers on the overlay and the hosts they reside on at the IP layer, which in turn leads to its misuse. The crux of the problem arises from the fact that any effort to provide a better match between the overlay and the IP layer will inevitably lead to a reduction in the random structure of the P2P overlay, with many adverse results. With this in mind, we propose ITA, an algorithm which creates a random overlay of randomly connected neighborhoods providing topology awareness to P2P systems, while at the same time has no negative effect on the self-* properties or the operation of the other P2P algorithms. Using extensive simulations, both at the IP router level and autonomous system level, we show that ITA reduces communication latencies by as much as 50 percent. Furthermore, it not only reduces by 20 percent the number of IP network messages which is critical for ISPs carrying the burden of transporting P2P traffic, but also distributes the traffic load more evenly on the routers of the IP network layer.

[1]  Azer Bestavros,et al.  EGOIST: overlay routing using selfish neighbor selection , 2008, CoNEXT '08.

[2]  Márk Jelasity,et al.  T-Man: Gossip-based fast overlay topology construction , 2009, Comput. Networks.

[3]  Vladimir Vlassov,et al.  DOH: A Content Delivery Peer-to-Peer Network , 2006, Euro-Par.

[4]  Thomas Fuhrmann,et al.  Bootstrapping locality-aware P2P networks , 2004, Proceedings. 2004 12th IEEE International Conference on Networks (ICON 2004) (IEEE Cat. No.04EX955).

[5]  Jafar Habibi,et al.  Topology awareness of overlay P2P networks , 2007, Concurr. Comput. Pract. Exp..

[6]  Hao Liao,et al.  Resolving the Topology Mismatch Problem in Unstructured Peer-to-Peer Networks , 2009, IEEE Transactions on Parallel and Distributed Systems.

[7]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

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

[9]  Marios D. Dikaiakos,et al.  Divide et Impera: Partitioning Unstructured Peer-to-Peer Systems to Improve Resource Location , 2006, CoreGRID Integration Workshop.

[10]  Krishna P. Gummadi,et al.  An analysis of Internet content delivery systems , 2002, OPSR.

[11]  David Mazières,et al.  Kademlia: A Peer-to-Peer Information System Based on the XOR Metric , 2002, IPTPS.

[12]  Pascal Felber,et al.  Efficient search in unstructured peer-to-peer networks , 2004, SPAA '04.

[13]  Donald F. Towsley,et al.  On the interaction between overlay routing and underlay routing , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[14]  Azer Bestavros,et al.  Implications of Selfish Neighbor Selection in Overlay Networks , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

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

[16]  W. Marsden.  I and J , 2012 .

[17]  Luís E. T. Rodrigues,et al.  X-BOT: A Protocol for Resilient Optimization of Unstructured Overlays , 2009, 2009 28th IEEE International Symposium on Reliable Distributed Systems.

[18]  Balachander Krishnamurthy,et al.  Topology modeling via cluster graphs , 2001, IMW '01.

[19]  Jia Wang,et al.  Analyzing peer-to-peer traffic across large networks , 2002, IMW '02.

[20]  Prasant Mohapatra,et al.  The impact of topology on overlay routing service , 2004, IEEE INFOCOM 2004.

[21]  Habib Rostami,et al.  Topology awareness of overlay P2P networks: Research Articles , 2007, Grid 2007.

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

[23]  Bruce M. Maggs,et al.  Efficient content location using interest-based locality in peer-to-peer systems , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[24]  Dimitrios Gunopulos,et al.  A local search mechanism for peer-to-peer networks , 2002, CIKM '02.

[25]  O. Kolkman.  A Framework for Describing the Internet Assigned Numbers Authority(IANA) , 2014 .

[26]  Ljiljana Trajkovic,et al.  Improving Gnutella network performance using synthetic coordinates , 2006, QShine '06.

[27]  Robert Tappan Morris,et al.  Vivaldi: a decentralized network coordinate system , 2004, SIGCOMM '04.

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

[29]  Peter Druschel,et al.  Proximity Neighbor Selection in Tree-Based Structured Peer-to-Peer Overlays , 2003 .

[30]  Yunhao Liu.  A Two-Hop Solution to Solving Topology Mismatch , 2008, IEEE Transactions on Parallel and Distributed Systems.

[31]  Li Xiao,et al.  Location awareness in unstructured peer-to-peer systems , 2005, IEEE Transactions on Parallel and Distributed Systems.

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

[33]  Lakshminarayanan Subramanian,et al.  An investigation of geographic mapping techniques for internet hosts , 2001, SIGCOMM.

[34]  Hans-Arno Jacobsen,et al.  Building Content-Based Publish/Subscribe Systems with Distributed Hash Tables , 2003, DBISP2P.

[35]  Christos Gkantsidis,et al.  Hybrid search schemes for unstructured peer-to-peer networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..