Publication Type
Conference Proceeding Article
Version
publishedVersion
Publication Date
3-2004
Abstract
Distributed hash table (DHT) overlay networks offer an efficient and robust technique for wire-area data storage and queries. Workload from real applications that use DHT networks will likely exhibit significant skews that can result in bottlenecks and failures that limit the overall scalability of the DHT approach. We present the content and load-aware scalable hashing (CLASH) protocol that can enhance the load distribution behavior of a DHT. CLASH relies on a variable-length identifier key scheme, where the length of any individual key is a function of load. CLASH uses variable-length keys to cluster content-related objects on single nodes to achieve processing efficiencies, and minimally disperse objects across multiple servers when hotspots occur. We demonstrate the performance benefits of CLASH through analysis and simulation.
Discipline
Software Engineering
Research Areas
Software and Cyber-Physical Systems
Publication
24th International Conference on Distributed Computing Systems ICDCS 2004: Proceedings: 24-26 March, Hachioji, Tokyo, Japan
First Page
273
Last Page
281
ISBN
9780769520865
Identifier
10.1109/ICDCS.2004.1281592
Publisher
IEEE Computer Society
City or Country
Los Alamitos, CA
Citation
MISRA, Archan; CASTRO, Paul; and LEE, Jinwon.
CLASH: A Protocol for Internet-Scale Utility-Oriented Distributed Computing. (2004). 24th International Conference on Distributed Computing Systems ICDCS 2004: Proceedings: 24-26 March, Hachioji, Tokyo, Japan. 273-281.
Available at: https://ink.library.smu.edu.sg/sis_research/699
Copyright Owner and License
Authors
Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-No Derivative Works 4.0 International License.
Additional URL
https://doi.ieeecomputersociety.org/10.1109/ICDCS.2004.1281592