%0 Conference Proceedings
%T A Dynamic Popularity-Aware Load Balancing Algorithm for Structured P2P Systems
%+ Iran University of Science and Technology [Tehran] (IUST)
%A Soltani, Narjes
%A Khaneghah, Ehsan, Mousavi
%A Sharifi, Mohsen
%A Mirtaheri, Seyedeh, Leili
%Z Part 2: Network Architecture and Protocol Design
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 9th International Conference on Network and Parallel Computing (NPC)
%C Gwangju, South Korea
%Y James J. Park
%Y Albert Zomaya
%Y Sang-Soo Yeo
%Y Sartaj Sahni
%I Springer
%3 Network and Parallel Computing
%V LNCS-7513
%P 77-84
%8 2012-09-06
%D 2012
%R 10.1007/978-3-642-35606-3_9
%K Structured P2P Systems
%K Load Balancing
%K Node Movement
%K Replication
%Z Computer Science [cs]Conference papers
%X Load balancing is one of the main challenges of structured P2P systems that use distributed hash tables (DHT) to map data items (objects) onto the nodes of the system. In a typical P2P system with N nodes, the use of random hash functions for distributing keys among peer nodes can lead to O(log N) imbalance. Most existing load balancing algorithms for structured P2Psystems are not proximity-aware, assume uniform distribution of objects in the system and often ignore node heterogeneity. In this paper we propose a load balancing algorithm that considers node heterogeneity, changes in object popularities, and link latencies between nodes. It also considers the load transfer time as an important factor in calculating the cost of load balancing. We present the algorithm using node movement and replication mechanisms. We also show via simulation how well the algorithm performs under different loads in a typical structured P2P system.
%G English
%Z TC 10
%Z WG 10.3
%2 https://inria.hal.science/hal-01551309/document
%2 https://inria.hal.science/hal-01551309/file/978-3-642-35606-3_9_Chapter.pdf
%L hal-01551309
%U https://inria.hal.science/hal-01551309
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-AICT
%~ IFIP-TC
%~ IFIP-TC10
%~ IFIP-NPC
%~ IFIP-WG10-3
%~ IFIP-LNCS-7513