Simple dynamic load balancing mechanism for structured P2P network and its evaluation

Authors:
Atsushi Takeda;Takuma Oide;Akiko Takahashi
Affiliations:
Department of Information Science, Tohoku Gakuin University, 2-1-1 Tenjinzawa, Izumi-ku, Sendai 981-3193, Japan.;Advanced Course of Information and Electronic System Engineering, Sendai National College of Technology, 4-16-1 Ayashi-Chuoh, Aoba-ku, Sendai 989-3128, Japan.;Department of Information Systems, Sendai National College of Technology, 4-16-1 Ayashi-Chuoh, Aoba-ku, Sendai 989-3128, Japan
Venue:
International Journal of Grid and Utility Computing
Year:
2012

Citing 14
Cited 0

Skip lists: a probabilistic alternative to balanced trees

Communications of the ACM
A scalable content-addressable network

Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Protecting Free Expression Online with Freenet

IEEE Internet Computing
Chord: a scalable peer-to-peer lookup protocol for internet applications

IEEE/ACM Transactions on Networking (TON)
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems

Middleware '01 Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg
Mercury: supporting scalable multi-attribute range queries

Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Efficient, Proximity-Aware Load Balancing for DHT-Based P2P Systems

IEEE Transactions on Parallel and Distributed Systems
Decentralized algorithms using both local and random probes for P2P load balancing

Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
GosSkip, an Efficient, Fault-Tolerant and Self Organizing Overlay Using Gossip-based Construction and Skip-Lists Principles

P2P '06 Proceedings of the Sixth IEEE International Conference on Peer-to-Peer Computing
Skip graphs

ACM Transactions on Algorithms (TALG)
Range queries on structured overlay networks

Computer Communications
Hash-based proximity clustering for efficient load balancing in heterogeneous DHT networks

Journal of Parallel and Distributed Computing
Dynamic load balancing in distributed hash tables

IPTPS'05 Proceedings of the 4th international conference on Peer-to-Peer Systems
Tapestry: a resilient global-scale overlay for service deployment

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Many proposals have been advanced for structured Peer-to-peer (P2P) networks, but it is difficult for existing structured P2P networks to achieve dynamic load balancing sufficiently. In this paper, we propose a new structured P2P network called Well-distribution Algorithm for an Overlay Network (Waon), which achieves dynamic load balancing among nodes. Waon uses a simple algorithm of load balancing and a routing table-based on the number of hops between nodes to distribute a communication load uniformly. The proposed scheme enables object deployment based on object semantics. Consequently, Waon can support range queries. Furthermore, the proposed scheme enables node deployment-based on node locality. Therefore, Waon can reduce the communication load on the physical network. Using simulation results, this report describes that Waon achieves dynamic load balancing sufficiently. Furthermore, simulation results in this paper demonstrate that Waon can reduce the load on the physical network.