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

DOI10.1016/J.JPDC.2007.10.005zbMath1243.68077OpenAlexW2127829194MaRDI QIDQ436777

Haiying Shen, Cheng-Zhong Xu

Publication date: 26 July 2012

Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jpdc.2007.10.005

zbMATH Keywords

load balancingdistributed hash tablepeer to peer

Mathematics Subject Classification ID

Distributed systems (68M14)

Uses Software

• Pastry

Cites Work

• Simple efficient load-balancing algorithms for peer-to-peer systems
• On the analysis of randomized load balancing schemes
• Space-filling curves and their use in the design of geometric data structures
• A stochastic process on the hypercube with applications to peer-to-peer networks
• Balanced binary trees for ID management and load balance in distributed hash tables
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Hash-based proximity clustering for efficient load balancing in heterogeneous DHT networks