Abstract — Our work examines the role of overlay topology on the performance of unstructured peer-to-peer systems. We focus on two metrics of performance: (a) search protocol performance, a local gain perceived directly by a user of the system and (b) utilization of the network, a global property that is of interest to network service providers. We present a class of overlay topologies based on distance between a node and its neighbors. We show, by simulation, that a particular topology instance of this class where every node has many close neighbors and few random neighbors exhibits better properties than other examined instances. In this overlay topology, the chances of locating files are high and the nodes where these files are found are, on average, close to the query source. This improvement in search protocol performance is achieved while decreasing the traffic load on the links in the underlying network. We propose a simple greedy algorithm to construct such topologies where each node operates independently and in a decentralized manner to select its neighbors. I.
|
2113
|
Chord: A scalable peer-to-peer lookup service for internet applications
– Stoica, Morris, et al.
|
|
1749
|
A scalable content-addressable network
– Ratnasamy, Francis, et al.
- 2001
|
|
1154
|
Random graphs
– Bollobás
- 1985
|
|
1137
|
Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems
– Rowstron, Druschel
- 2001
|
|
768
|
Tapestry: An infrastructure for fault-tolerant wide-area location and routing
– Zhao, Kubiatowicz, et al.
- 2001
|
|
739
|
A Case for End System Multicast
– Chu, Rao, et al.
- 2000
|
|
682
|
A measurement study of peer-to-peer file sharing systems
– Saroiu, Gummadi, et al.
- 2002
|
|
329
|
The small world problem
– Milgram
- 1967
|
|
269
|
Collective dynamics of “small-world” networks, Nature 393
– WATTS, STROGATZ
- 1998
|
|
248
|
Worlds: The Dynamics of Networks Between Order and Randomness
– Small
- 1999
|
|
192
|
Topologicallyaware overlay construction and server selection,” 2002. [Online]. Available: citeseer.ist.psu.edu/ratnasamy02topologicallyaware.html
– Ratnasamy, Handley, et al.
|
|
191
|
Peer-to-Peer: Harnessing the Power of Disruptive Technologies, chapter 8 and 2. Edited by Andy Oram
– Oram, O’Reilly
- 2001
|
|
174
|
Mapping the gnutella network: Properties of large-scale peer-to-peer systems and implications for system design
– RIPEANU, FOSTER, et al.
|
|
170
|
Analyzing peer-to-peer traffic across large networks
– Sen, Wang
- 2005
|
|
163
|
A quantitative comparison of graph-based models for Internet topology
– Zegura, Calvert, et al.
- 1997
|
|
129
|
Efficient content location using interest-based locality in peer-to-peer systems
– Sripanidkulchai, Maggs, et al.
- 2003
|
|
105
|
Efficient peer-to-peer keyword searching
– Reynolds, Vahdat
- 2002
|
|
104
|
Routing algorithms for DHTs: Some open questions
– Ratnasamy, Shenker, et al.
- 2002
|
|
80
|
Navigation in a Small World
– Kleinberg
|
|
53
|
pSearch: Information Retrieval in Structured Overlays
– Tang, Xu, et al.
- 2002
|
|
51
|
Using the small-world model to improve Freenet performance
– Zhang, Goel, et al.
- 2002
|
|
45
|
The small world problem. Psychology Today, 2: 60–67
– Milgram
- 1967
|
|
39
|
Topology-Aware Overlay Networks for Group Communication
– Kwon, Fahmy
- 2002
|
|
33
|
Modeling peer-to-peer network topologies through “small-world” models and power laws
– Jovanović, Annexstein, et al.
- 2001
|
|
11
|
Six Degrees of Separation: A Play (Vintage
– Guare
- 1990
|
|
10
|
Scalable Peer Finding on the Internet
– Banerjee, Kommareddy, et al.
- 2002
|
|
9
|
Diameter of the world-wide web. Nature
– Albert, Jeong, et al.
- 1999
|
|
7
|
Finding Close Friends over the Internet
– Shankar, Komareddy, et al.
- 2001
|
|
7
|
A simulator for peer-topeer networks, in
– Merugu, Srinivasan, et al.
- 2003
|
|
6
|
The Small-World Phenomenon:An Algorithmic Perspective
– Kleinberg
- 2000
|
|
6
|
Six Degrees of Separation: A Play. Vintage Books
– Guare
- 1990
|
|
5
|
Random Graphs, Cambridge University Press, 2001. [120] Mathew Penrose, "The longest edge of the random minimal spanning tree
– Bollob'as
- 1997
|
|
2
|
Freenet: A
– Clarke, Sandberg, et al.
- 2001
|
