Research Article
Storage load balancing via local interactions among peers in unstructured P2P networks
@INPROCEEDINGS{10.1145/1146847.1146903, author={Kei Ohnishi and Kento Ichikawa and Masato Uchida and Hiroshi Yamamoto and Yuji Oie}, title={Storage load balancing via local interactions among peers in unstructured P2P networks}, proceedings={1st International ICST/Create-Net Workshop on Peer-to-Peer Information Management}, publisher={ACM}, proceedings_a={P2PIM}, year={2006}, month={6}, keywords={}, doi={10.1145/1146847.1146903} }- Kei Ohnishi
Kento Ichikawa
Masato Uchida
Hiroshi Yamamoto
Yuji Oie
Year: 2006
Storage load balancing via local interactions among peers in unstructured P2P networks
P2PIM
ACM
DOI: 10.1145/1146847.1146903
Abstract
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 storage load balancing will be achieved. Furthermore, since the proposed method causes peers adjacent to peers of high degree to hold several files, it is also expected that good search performance will be obtained. In addition, a replication method that makes a replica of a requested file in a peer on the present search path with probability inversely proportional to the degree of the peer is prepared as a method for comparison. The probability is, in contrast to the proposed method, statically determined prior to the start of the search according to the theory to ensure good load balancing. The experimental results show that both the proposed method and the method for comparison achieve global load balancing, although they have totally different strategies in terms of storage load balancing. It is, however, shown that only the proposed method does not require appropriate adjustment of parameter values to a given network topology prior to the start of the search in order to achieve good search performance. This is a significant advantage over the method for comparison.
