Distributed Zone Partitioning Schemes for CAN and Its Application to the Load Balancing in Pure P2P Systems

IPSJ Web Site 12 References

Bibliographic Information

Other Title
  • P2Pのデータ配置と検索

Search this article

Abstract

In this paper we propose several distributed zone partitioning schemes for Content-Addressable Networks (CAN) that is known as a pure peer-to-peer system based on the Distributed Hash Table (DHT). The main objective of the proposed schemes is to balance the load of nodes in the CAN system in such a way that every node receives almost the same number of inquiries from the other nodes in the system. The result of simulations implies that by using the proposed schemes instead of a randomized zone partitioning scheme originally implemented in the CAN system we could reduce the response time for each inquiry to less than 75%.

In this paper, we propose several distributed zone partitioning schemes for Content-Addressable Networks (CAN), that is known as a pure peer-to-peer system based on the Distributed Hash Table (DHT). The main objective of the proposed schemes is to balance the load of nodes in the CAN system, in such a way that every node receives almost the same number of inquiries from the other nodes in the system. The result of simulations implies that, by using the proposed schemes instead of a randomized zone partitioning scheme originally implemented in the CAN system, we could reduce the response time for each inquiry to less than 75%.

Journal

References(12)*help

See more

Related Projects

See more

Keywords

Details 詳細情報について

Report a problem

Back to top