Abstract :
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
Keywords :
communication complexity; peer-to-peer computing; routing protocols; LLCHORD protocol; distributed hash tables; low latency chord routing algorithm; query message routing; routing protocol; structured peer-to-peer network; Clocks; Computer networks; Costs; Counting circuits; Delay; Fingers; IP networks; Network topology; Peer to peer computing; Routing protocols; distributed hash table; dual direction finger table; low latency; peer-to-peer; routing;
