A Dynamic Popularity-Aware Load Balancing Algorithm for Structured P2P Systems

Abstract : 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.
Document type :
Conference papers
Complete list of metadatas

Cited literature [6 references]  Display  Hide  Download

https://hal.inria.fr/hal-01551309
Contributor : Hal Ifip <>
Submitted on : Friday, June 30, 2017 - 10:35:28 AM
Last modification on : Friday, December 1, 2017 - 1:10:03 AM
Long-term archiving on : Monday, January 22, 2018 - 9:59:54 PM

File

978-3-642-35606-3_9_Chapter.pd...
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Citation

Narjes Soltani, Ehsan Khaneghah, Mohsen Sharifi, Seyedeh Mirtaheri. A Dynamic Popularity-Aware Load Balancing Algorithm for Structured P2P Systems. 9th International Conference on Network and Parallel Computing (NPC), Sep 2012, Gwangju, South Korea. pp.77-84, ⟨10.1007/978-3-642-35606-3_9⟩. ⟨hal-01551309⟩

Share

Metrics

Record views

77

Files downloads

69