Skip to main content

CISS: An Efficient Object Clustering Framework for DHT-Based Peer-to-Peer Applications

  • Conference paper
Databases, Information Systems, and Peer-to-Peer Computing (DBISP2P 2004)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 3367))

Abstract

Distributed Hash Tables (DHTs) have been widely adopted in many Internet-scale P2P systems. Emerging P2P applications such as massively multi player online games (MMOGs) and P2P catalog systems frequently update data or issue multi-dimensional range queries, but existing DHT-based P2P systems can not support these applications efficiently due to object declustering. Object declustering can result in significant inefficiencies in data update and multi-dimensional range query routing. In this paper, we propose CISS, a framework that supports efficient object clustering for DHT-based P2P applications. While utilizing DHT as a basic lookup layer, CISS uses a Locality Preserving Function (LPF) instead of a hash function. Thus, CISS achieves a high level of clustering without requiring any changes to existing DHT implementations. Technically, we study LPF encoding function, efficient routing protocols for data updates and multi-dimensional range queries, and cluster-preserving load balancing. We demonstrate the performance benefits of CISS through simulation.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Andrzejak, A., Xu, Z.: Scalable, Efficient Range Queries for Grid Information Services. In: Proceedings of IEEE P2P, Sweden (September 2002)

    Google Scholar 

  2. Asano, T., Ranjan, D., Roose, T., Welzl, E., Widmaier, P.: Space Filling Curves and Their Use in Geometric Data Structures. Theoretical Computing Science 181, 3–15 (1997)

    Article  MATH  Google Scholar 

  3. Bharambe, A.R., Rao, S., Seshan, S.: Mercury: A Scalable Publish-Subscribe System for Internet Games. In: Proceedings of NetGames, Germany (April 2002)

    Google Scholar 

  4. Byers, J., Considine, J., Mitzenmacher, M.: Simple Load Balancing for Distributed Hash Tables. In: Proceedings of IPTPS, CA, USA (February 2003)

    Google Scholar 

  5. Dabek, F., Kaashoek, M.F., Karger, D., Morris, R., Stoica, I.: Wide-area cooperative storage with CFS. In: Proceedings of SOSP, Canada (October 2001)

    Google Scholar 

  6. Fall, K., Varadhan, K.: NS Manual

    Google Scholar 

  7. Gupta, A., Agrawal, D., El Abbadi, A.: Approximate Range Selection Queries in Peer-to-Peer Systems. In: Proceedings of CIDR, CA, USA (January 2003)

    Google Scholar 

  8. Harren, M., Hellerstein, J.M., Huebsch, R., Loo, B.T., Shenker, S., Stoica, I.: Complex Queries in DHT-based Peer-to-Peer Networks. In: Proceedings of IPTPS, MA, USA (March 2002)

    Google Scholar 

  9. Huebsch, R., Hellerstein, J.M., Lanham, N., Loo, B.T., Shenker, S., Stoica, I.: Querying the Internet with PIER. In: Proceedings of VLDB, Berlin (September 2003)

    Google Scholar 

  10. Knutsson, B., Lu, H., Xu, W., Hopkins, B.: Peer-to-Peer Support for Massively Multiplayer Games. In: Proceedings of INFOCOM, Hong Kong, China (March 2004)

    Google Scholar 

  11. Kothari, A., Agrawal, D., Gupta, A., Suri, S.: Range Addressable Network: A P2P Cache Architecture for Data Ranges. In: Proceedings of IEEE P2P, Sweden (September 2003)

    Google Scholar 

  12. Misra, A., Castro, P., Lee, J.: CLASH: A Protocol for Internet-Scale Utility-Oriented Distributed Computing. In: Proceedings of ICDCS, Japan (March 2004)

    Google Scholar 

  13. Papadimos, V., Maier, D., Tufte, K.: Distributed Query Processing and Catalogs for Peer-to-Peer Systems. In: Proceedings of CIDR, CA, USA (January 2003)

    Google Scholar 

  14. Rao, A., Lakshminarayanan, K., Surana, S., Karp, R., Stoica, I.: Load Balancing in Structured P2P Systems. In: Proceedings of IPTPS, CA, USA (February 2003)

    Google Scholar 

  15. Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A Scalable Content-Addressable Network. In: Proceedings of SIGCOMM, CA, USA (August 2001)

    Google Scholar 

  16. Ratnasamy, S., Hellerstein, J.M., Shenker, S.: Range Queries over DHTs, IRB-TR-03-009 (June 2003)

    Google Scholar 

  17. Rowstron, A., Druschel, P.: Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. In: Proceedings of IFIP/ACM International Conference on Distributed Systems Platforms (Middleware), Germany (November 2001)

    Google Scholar 

  18. Sahin, O., Gupta, A., Agrawal, D., El Abbadi, A.: A Peer-to-peer Framework for Caching Range Queries. In: Proceedings of ICDE, MA, USA (March 2004)

    Google Scholar 

  19. Schmidt, C., Parashar, M.: Flexible Information Discovery in Decentralized Distributed Systems. In: Proceedings of HPDC, WA, USA (June 2003)

    Google Scholar 

  20. Stoica, I., Morris, R., Karger, D., Kaashoek, M.F., Balakrishnan, H.: Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications. In: Proceedings of SIGCOMM, CA, USA (August 2001)

    Google Scholar 

  21. Zhao, B.Y., Kubiatowicz, J., Joseph, A.: Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and Routing, UCB Tech. Report UCB/CSD-01-1141

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lee, J., Lee, H., Kang, S., Choe, S., Song, J. (2005). CISS: An Efficient Object Clustering Framework for DHT-Based Peer-to-Peer Applications. In: Ng, W.S., Ooi, BC., Ouksel, A.M., Sartori, C. (eds) Databases, Information Systems, and Peer-to-Peer Computing. DBISP2P 2004. Lecture Notes in Computer Science, vol 3367. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-31838-5_15

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-31838-5_15

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-25233-7

  • Online ISBN: 978-3-540-31838-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics