Home // International Journal On Advances in Networks and Services, volume 1, number 1, 2008 // View article

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

Authors:
Balázs Kovács
Rolland Vida

Keywords: Distributed Hash Table, Content-Addressable Network, small world, lookup-cost limitation, signaling optimization

Abstract:
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(dN1d ) 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.

Pages: 64 to 76

Copyright: Copyright (c) to authors, 2008. Used with permission.

Publication date: February 24, 2009

Published in: journal

ISSN: 1942-2644