A Low Latency Chord Routing Algorithm for DHT

In this paper, we propose a low latency routing algorithm for structured peer-to-peer network. The LLCHORD (a low latency chord routing algorithm for distributed hash tables) protocol is used in the routing query message to the destination. Previous protocol, such as Chord, already provides a scalable query latency of O(log(N)), where N is the number of nodes in peer-to-peer network. But the latency of the each hop is omitted in the analysis of the routing performance. In LLCHORD protocol, while retain the O(log(N)) routing latency, the routing is aimed at reduce the cost of each hop. At this way, the LLCHORD routing performance of LLCHORD protocol is better than Chord. In LLCHORD protocol, the cost of the each step to the destination node is reduced. Unlike the general Chord protocol, the next hop of the query message can be in the clockwise and counter clockwise side of the destination. In this way, the closing up process to the destination key is in dual directions

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

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

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

[4]  Paul Francis,et al.  An architecture for a global Internet host distance estimation service , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[5]  Hui Zhang,et al.  Towards global network positioning , 2001, IMW '01.

[6]  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.

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

[8]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

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

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

[11]  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.

[12]  Ibrahim Matta,et al.  BRITE: Boston University Representative Internet Topology gEnerator: A Flexible Generator of Internet Topologies , 2000 .