Sciweavers

Share
INFOSCALE
2006
ACM

Storage load balancing via local interactions among peers in unstructured P2P networks

9 years 4 months ago
Storage load balancing via local interactions among peers in unstructured P2P networks
— The present paper introduces a replication method that is meant to balance the storage load of peers in unstructured peer-to-peer (P2P) networks for file sharing and to provide good search performance. According to the random walk theory on an arbitrary network, the frequency of arrival of a random walker to a peer is proportional to the degree of the peers. Therefore, to limit the increase in the number of hops required to find a requested file, it is better to make as many files as possible in peers of high degree when using random-walk-based query forwarding methods. However, this causes a load bias to peers of high degree. That is, there is a trade-off between storage load balancing and search performance. The replication method presented herein replicates a requested file in a peer of low load adjacent to a peer of interest on the present search path by using dynamically varying values that represent the state of the load of peers. Therefore, it is expected that local sto...
Kei Ohnishi, Hiroshi Yamamoto, Kento Ichikawa, Mas
Added 13 Jun 2010
Updated 13 Jun 2010
Type Conference
Year 2006
Where INFOSCALE
Authors Kei Ohnishi, Hiroshi Yamamoto, Kento Ichikawa, Masato Uchida, Yuji Oie
Comments (0)
books