A content addressable small-world network

Authors:
Akira Ohtsubo;Shigeaki Tagashira;Satoshi Fujita
Affiliations:
Department of Information Engineering, Graduate School of Engineering, Hiroshima University;Department of Information Engineering, Graduate School of Engineering, Hiroshima University;Department of Information Engineering, Graduate School of Engineering, Hiroshima University
Venue:
PDCN'07 Proceedings of the 25th conference on Proceedings of the 25th IASTED International Multi-Conference: parallel and distributed computing and networks
Year:
2007

Citing 4
Cited 0

The small-world phenomenon: an algorithmic perspective

STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Chord: A scalable peer-to-peer lookup service for internet applications

Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
A scalable content-addressable network

Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and

Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we study the effect of shortcut links in overlay networks for distributed systems. In particular, we examine the effect of shortcuts in Content Addressable Network (CAN) which is known as a typical pure P2P network based on the notion of Distributed Hash Table (DHT). The proposed scheme is an extension of Kleinberg's method which was originally proposed for the study of small-world networks. The result of simulations indicates that the proposed shortcutting scheme significantly reduces the average number of hopcounts in a greedy routing, and the rate of improvement increases as increasing the number of nodes.