A Content Addressable Small-World Network

A. Ohtsubo, S. Tagashira, and S. Fujita (Japan)


P2P network, shortcut, small-world network.


In this paper, we study the effect of shortcut links in overlay networks for distributed systems. In particular, we exam ine 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 pro posed scheme is an extension of Kleinberg’s method which was originally proposed for the study of small-world net works. The result of simulations indicates that the proposed shortcutting scheme significantly reduces the average num ber of hopcounts in a greedy routing, and the rate of im provement increases as increasing the number of nodes.

Important Links:

Go Back