Article thumbnail
Location of Repository

Long-Range CAN: to Enhance the Performance of Content-Addressable Networks

By Balázs Kovács


Distributed Hash Table (DHT) algorithms structure peer-to-peer networks to provide nodes with fast and scalable lookups. In recent DHT solutions, such as Chord and Kademlia, the contacts of a node in the overlay network are determined so as to keep up with a lookup cost of O(logN) in a network of N nodes. As opposed to these, one of the first DHT solutions, called Content Addressable Network (CAN), has the drawback of limiting the lookup cost only in O(dN 1 d) where d is the number of dimensions in the coordinate space, a fixed network parameter. However, CAN has several merits to exploit, such as its multi-dimensional ID space and its special ID space structure. Thus, in this paper we present an improved algorithm called Long-Range CAN (LR-CAN), able to eliminate the rigidity of the original system and to provide a more scalable and resilient solution, not only compared to the original version, but also to the currently best performing DHTs that we already mentioned

Topics: Distributed Hash Table, Content-Addressable Network
Year: 2013
OAI identifier: oai:CiteSeerX.psu:
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • (external link)
  • (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.