Abstract
Purchase PDF (795 K)
E-mail Article
Add to my Quick Links
Cited By in Scopus (0)
Purchase PDF (920 K)
doi:10.1016/j.comnet.2006.07.005 
Copyright © 2006 Elsevier B.V. All rights reserved.
Received 18 May 2005;
References and further reading may be available for this article. To view references and further reading you must purchase this article.
Abstract
In most DHT-based peer-to-peer systems, objects are totally declustered since such systems use a hash function to distribute objects evenly. However, such an object de-clustering can result in significant inefficiencies in advanced access operations such as multi-dimensional range queries, continuous updates, etc, which are common in many emerging peer-to-peer applications. In this paper, we propose CISS (Cooperative Information Sharing System), a framework that supports efficient object clustering for DHT-based peer-to-peer applications. CISS uses a Locality Preserving Function (LPF) instead of a hash function, thereby achieving a high level of clustering without requiring any changes to existing DHT implementations. To maximize the benefit of object clustering, CISS provides efficient routing protocols for multi-dimensional range queries and continuous updates. Furthermore, our cluster-preserving load balancing schemes distribute loads without hotspots while preserving the object clustering property. We demonstrate the performance benefits of CISS through extensive simulation.
Keywords: Distributed hash table (DHT); Object clustering; Peer-to-peer application; Multi-dimensional range query; Load balancing
Article Outline
- 1. Introduction
- 2. Related work
- 3. System architecture
- 4. Technical issues
- 4.1. Locality preserving function (LPF)
- 4.2. Efficient routing protocols for range queries and updates
- 4.3. Cluster-preserving load balancing
- 5. Performance evaluation
- 5.1. Query and update routing protocols
- 5.2. Load balancing
- 6. Conclusion
- References
- Vitae
