Name
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. |
Year | Venue | Keywords |
|---|---|---|
2007 | Parallel and Distributed Computing and Networks | greedy routing,hash table,p2p network,content addressable small-world network,overlay network,improvement increase,proposed scheme,shortcut link,content addressable network,average number,proposed shortcutting scheme,small world network |
Field | DocType | Citations |
Computer science,Small-world network,Content addressable network,Computer network,Overlay network,Distributed hash table,Distributed computing | Conference | 1 |
PageRank | References | Authors |
0.36 | 3 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Akira Ohtsubo | 1 | 3 | 1.10 |
| Shigeaki Tagashira | 2 | 94 | 28.39 |
| Satoshi Fujita | 3 | 46 | 18.99 |