Skip to main content

CCAN: Cache-Based CAN Using the Small World Model

  • Conference paper
Advances in Web-Age Information Management (WAIM 2004)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3129))

Included in the following conference series:

  • 878 Accesses

Abstract

The small world model has been used to improve the routing performance in P2P networks recently. In this paper, we proposed CCAN, a cache-based CAN, which is based on the small world model. CCAN caches the long contact and takes a novel probabilistic cache replacing strategy. The probabilistic cache scheme proves to be a new approach to model the small world phenomenon. Experiments in both the static and the dynamic network show that CCAN can be converged to a stable status with the cache scheme, and the routing performance is improved with almost zero overheads in the network compared with CAN.

Research described in this paper is supported by The Science & Technology Committee of Shanghai Municipality Key Technologies R&D Project Grant 03dz15027 and by The Science & Technology Committee of Shanghai Municipality Key Project Grant 025115032.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Gnutella, http://www.gnutella.co.uk

  2. Lv, Q., Shenker, S., et al.: Search and Replication in Unstructured Peer-to-Peer Networks. In: Proceedings of ACM SIGGRAPH, August 02 (2002)

    Google Scholar 

  3. Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A scalable content-addressable network. In: Proc. ACM SIGCOMM, San Diego, CA, August 2001, pp. 161–172 (2001)

    Google Scholar 

  4. Iamnitchi, A., Ripeanu, M., Foster, I.: Locating Data in (Small-World?) Peer-to-Peer Scientific Collaborations. In: 1st International Peer To Peer Systems Workshop, IPTPS 2002 (2002)

    Google Scholar 

  5. Kleinberg, J.: The small-world phenomenon: an algorithmic perspective. Cornell Computer Science Technical Report 99-1776 (2000)

    Google Scholar 

  6. Manku, G.S., Bawa, M., Raghavan, P.: Symphony: Distributed hashing in a small world. In: Proc. 4th USENIX Symposium on Internet Technologies and Systems, USITS 2003 (2003)

    Google Scholar 

  7. Malkhi, D., Naor, M., Ratajczak, D.: Viceroy: A scalable and dynamic emulation of the butterfly. In: Proc 21st ACM Symposium on Principles of Distributed Computing (PODC 2002), pp. 183–192 (2002)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Zou, F., Li, Y., Zhang, L., Ma, F. (2004). CCAN: Cache-Based CAN Using the Small World Model. In: Li, Q., Wang, G., Feng, L. (eds) Advances in Web-Age Information Management. WAIM 2004. Lecture Notes in Computer Science, vol 3129. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-27772-9_18

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-27772-9_18

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-22418-1

  • Online ISBN: 978-3-540-27772-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics