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

Kei Ohnishi, Hiroshi Yamamoto, Kento Ichikawa, Masato Uchida, Yuji Oie

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Citations (Scopus)

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.

Original languageEnglish
Title of host publicationProceedings of the 1st International Conference on Scalable Information Systems, InfoScale '06
Volume152
DOIs
Publication statusPublished - 2006
Externally publishedYes
Event1st International Conference on Scalable Information Systems, InfoScale '06 - Hong Kong, China
Duration: 2006 May 302006 Jun 1

Other

Other1st International Conference on Scalable Information Systems, InfoScale '06
CountryChina
CityHong Kong
Period06/5/3006/6/1

Fingerprint

Resource allocation
Peer to peer networks
Topology

ASJC Scopus subject areas

  • Human-Computer Interaction

Cite this

Ohnishi, K., Yamamoto, H., Ichikawa, K., Uchida, M., & Oie, Y. (2006). Storage load balancing via local interactions among peers in unstructured P2P networks. In Proceedings of the 1st International Conference on Scalable Information Systems, InfoScale '06 (Vol. 152). [1146903] https://doi.org/10.1145/1146847.1146903

Storage load balancing via local interactions among peers in unstructured P2P networks. / Ohnishi, Kei; Yamamoto, Hiroshi; Ichikawa, Kento; Uchida, Masato; Oie, Yuji.

Proceedings of the 1st International Conference on Scalable Information Systems, InfoScale '06. Vol. 152 2006. 1146903.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Ohnishi, K, Yamamoto, H, Ichikawa, K, Uchida, M & Oie, Y 2006, Storage load balancing via local interactions among peers in unstructured P2P networks. in Proceedings of the 1st International Conference on Scalable Information Systems, InfoScale '06. vol. 152, 1146903, 1st International Conference on Scalable Information Systems, InfoScale '06, Hong Kong, China, 06/5/30. https://doi.org/10.1145/1146847.1146903
Ohnishi K, Yamamoto H, Ichikawa K, Uchida M, Oie Y. Storage load balancing via local interactions among peers in unstructured P2P networks. In Proceedings of the 1st International Conference on Scalable Information Systems, InfoScale '06. Vol. 152. 2006. 1146903 https://doi.org/10.1145/1146847.1146903
Ohnishi, Kei ; Yamamoto, Hiroshi ; Ichikawa, Kento ; Uchida, Masato ; Oie, Yuji. / Storage load balancing via local interactions among peers in unstructured P2P networks. Proceedings of the 1st International Conference on Scalable Information Systems, InfoScale '06. Vol. 152 2006.
@inproceedings{ac1b85d80e7d43e2b5ee72c40d52acc9,
title = "Storage load balancing via local interactions among peers in unstructured P2P networks",
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.",
author = "Kei Ohnishi and Hiroshi Yamamoto and Kento Ichikawa and Masato Uchida and Yuji Oie",
year = "2006",
doi = "10.1145/1146847.1146903",
language = "English",
isbn = "1595934286",
volume = "152",
booktitle = "Proceedings of the 1st International Conference on Scalable Information Systems, InfoScale '06",

}

TY - GEN

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

AU - Ohnishi, Kei

AU - Yamamoto, Hiroshi

AU - Ichikawa, Kento

AU - Uchida, Masato

AU - Oie, Yuji

PY - 2006

Y1 - 2006

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=34547290956&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=34547290956&partnerID=8YFLogxK

U2 - 10.1145/1146847.1146903

DO - 10.1145/1146847.1146903

M3 - Conference contribution

SN - 1595934286

SN - 9781595934284

VL - 152

BT - Proceedings of the 1st International Conference on Scalable Information Systems, InfoScale '06

ER -