The Community for Technology Leaders
27th International Conference on Distributed Computing Systems (ICDCS '07) (2007)
Toronto, Canada
June 25, 2007 to June 27, 2007
ISBN: 0-7695-2837-3
pp: 32
Hasan Guclu , Los Alamos National Laboratory
Murat Yuksel , University of Nevada - Reno
In unstructured peer-to-peer (P2P) networks, the overlay topology (or connectivity graph) among peers is a crucial component in addition to the peer/data organization and search. Topological characteristics have profound impact on the efficiency of search on such unstructured P2P networks as well as other networks. A key limitation of scalefree (power-law) topologies is the high load (i.e. high degree) on very few number of hub nodes. In a typical unstructured P2P network, peers are not willing to maintain high degrees/loads as they may not want to store large number of entries for construction of the overlay topology. So, to achieve fairness and practicality among all peers, hard cutoffs on the number of entries are imposed by the individual peers, which limits scale-freeness of the overall topology. Thus, it is expected that efficiency of the flooding search reduces as the size of the hard cutoff does. We investigate construction of scale-free topologies with hard cutoffs and effect of these hard cutoffs on the search efficiency.

H. Guclu and M. Yuksel, "Scale-Free Overlay Topologies with Hard Cutoffs for Unstructured Peer-to-Peer Networks," 2007 27th IEEE International Conference on Distributed Computing Systems Workshop(ICDCS), Toronto, Ont., 2007, pp. 32.
100 ms
(Ver 3.3 (11022016))