A distributed topology-aware overlays construction algorithm

Peer-to-Peer (P2P) computing systems are rapidly growing in importance as the medium of choice for the mass storage. Peers in the most P2P systems randomly choose logical neighbors without any knowledge about underlying physical topology. This mechanism can cause a serious topology mismatch between the P2P overlay network and the underlying network. It greatly limits the performance gain from various search or routing techniques. In this paper, a distributed topology-aware overlays construction algorithm Taonet is proposed, in which the overlay network construction is based on the location information of underlying topology. The nodes that are close in the logical network are also close in terms of network latency. This leads to low latency stretch of the overlay network. This algorithm is scalable and distributed. Simulation results indicate that the latency of data location in these topology-aware P2P systems that are constructed with Taonet can be significantly decreased.

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

[2]  Ben Y. Zhao,et al.  OceanStore: an architecture for global-scale persistent storage , 2000, SIGP.

[3]  Zheng Zhang,et al.  Building topology-aware overlays using global soft-state , 2003, 23rd International Conference on Distributed Computing Systems, 2003. Proceedings..

[4]  Ibrahim Matta,et al.  BRITE: an approach to universal topology generation , 2001, MASCOTS 2001, Proceedings Ninth International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems.

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

[6]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

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

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

[9]  Mark Handley,et al.  Topologically-aware overlay construction and server selection , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

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

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

[12]  Jie Liu,et al.  QUERY ROUTING IN A PEER‐TO‐PEER SEMANTIC LINK NETWORK , 2005, Comput. Intell..

[13]  Peter Druschel,et al.  Topology-aware routing in structured peer-to-peer overlay networks , 2003 .

[14]  Krishna P. Gummadi,et al.  King: estimating latency between arbitrary internet end hosts , 2002, IMW '02.

[15]  Scott Shenker,et al.  Routing Algorithms for DHTs: Some Open Questions , 2002, IPTPS.

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

[17]  Topology-Aware Overlay Construction in Dynamic Networks , 2003 .

[18]  Hui Zhang,et al.  Predicting Internet network distance with coordinates-based approaches , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[19]  Krishna P. Gummadi,et al.  King: estimating latency between arbitrary internet end hosts , 2002, IMW '02.