Skip to main content
SpringerLink
Log in

A locality aware cache diffusion system

  • Published:
The Journal of Supercomputing Aims and scope Submit manuscript

Abstract

Web caching is a widely deployed technique to reduce the load to web servers and to reduce the latency for web browsers. Peer-to-Peer (P2P) web caching has been a hot research topic in recent years as it can create scalable and robust designs for decentralized internet-scale applications. However, many P2P web caching systems suffer expensive overheads such as lookup and publish messages, and lack locality awareness. In this paper, we present the development of a locality aware cache diffusion system that makes use of routing table locality, aggregation, and soft state to overcome these limitations. The analysis and experiments show that our cache diffusion system reduces the amount of information processed by nodes, reduces the number of index messages sent by nodes, and improves the locality of cache pointers.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Barford P, Crovella M (1998) Generating representative web workloads for network and server performance evaluation. In: Measurement and modeling of computer systems, 1998, pp 151–160

  2. Busari M, Williamson CL (2001) On the sensitivity of web proxy cache performance to workload characteristics. In: INFOCOM, 2001, pp 1225–1234

  3. Casey J, Zhou W (2005) Reducing the bandwidth requirements of P2P keyword indexing. In: Lecture notes in computer science, vol 3719. Springer, Berlin, pp 50–59

    Google Scholar 

  4. Casey J, Chonka A, Zhou W (2007) Adjacency cache: fast web cache indexing and lookup. In: 6th IEEE/ACIS international conference on computer and information science (ICIS 2007), 2007, pp 616–621

  5. Castro M et al (2002) Exploiting network proximity in distributed hash tables. In: International workshop on future directions in distributed computing, 2002, pp 52–55

  6. Castro M (2002) SCRIBE: A large-scale and decentralized application-level multicast infrastructure. IEEE J Sel Areas Commun (JSAC) 20(8):1489–1499

    Article  Google Scholar 

  7. Castro M et al (2003) SplitStream: high-bandwidth multicast in cooperative environments. In: ACM symposium on operating systems principles, 2003, pp 298–313

  8. Chandramouli B, Yang J, Vahdat A (2006) Distributed network querying with bounded approximate caching. In: Lecture notes in computer science, vol 3882. Springer, Berlin, pp 374–388

    Google Scholar 

  9. Chun B-G, Zhao BY, Kubiatowicz JD (2005) Impact of neighbor selection on performance and resilience of structured P2P networks. In: 4th International workshop on peer-to-peer systems, 2005, pp 264–274

  10. Chun B-G et al (2006) ChunkCast: an anycast service for large content distribution. In: The 5th international workshop on peer-to-peer systems (IPTPS’06), 2006

  11. Cutting D (2004) Lucene, http://lucene.apache.org/java/docs/

  12. Dabek F et al (2004) Vivaldi: a decentralized network coordinate system. In: ACM SIGCOMM’04, 2004, pp 15–26

  13. Dolev D, Mokryn O, Shavitt Y (2003) On multicast trees: structure and size estimation. In: IEEE INFOCOM’03, 2003, pp 1011–1021

  14. El-Ansary S et al (2003) Efficient broadcast in structured P2P networks. In: IPTPS’03, 2003, pp 304–314

  15. Gummadi KP, Saroiu S, Gribble SD (2002) King: estimating latency between arbitrary Internet end hosts. In: Proceedings of the 2nd ACM SIGCOMM workshop on Internet measurement, 2002, pp 5–18

  16. Knuth DE (1973) The art of computer programming, 2nd edn. Addison-Wesley, Reading

    Google Scholar 

  17. Loguinov D et al (2003) Graph-theoretic analysis of structured peer-to-peer systems: routing distances and fault resilience. In: ACM SIGCOMM, 2003, pp 1107–1120

  18. Michel BS et al (2000) URL forwarding and compression in adaptive web caching. In: IEEE INFOCOM, 2000, vol 2, pp 670–678

  19. Ng TSE, Zhang H (2001) Towards global network positioning. In: ACM SIGCOMM Internet measurement workshop, pp 25–29

  20. Oppenheimer D et al (2004) Scalable wide-area resource discovery. Technical Report CSD04-1334. University of California Berkeley, Berkeley, CA, USA

  21. Pappas V et al (2006) A comparative study of the DNS design with DHT-based alternatives. In: IEEE INFOCOM’06, 2006, pp 1–13

  22. Renesse RV, Binnan KP (2001) Astrolabe: a robust and scalable technology for distributed system monitoring, management, and data mining. ACM Trans Comput Syst 15:164–206

    Google Scholar 

  23. Rhea S et al (2004) Handling churn in a DHT. In: USENIX annual technical conference, 2004

  24. Serpanos DN, Karakostas G, Wolf WH (2000) Effective caching of web objects using Zipf’s law. In: The 2000 IEEE international conference on multimedia and expo, 2000, pp 727–730

  25. Shi W, Mao Y (2006) Performance evaluation of peer-to-peer web caching systems. J Syst Softw 79(5):714–726

    Article  Google Scholar 

  26. Sripanidkulchai K, Maggs B, Zhang H (2003) Efficient content location using interest-based locality in peer-to-peer systems. In: INFOCOM, 2003, pp 2166–2176

  27. Tati K, Voelker GM (2004) ShortCuts: using soft state to improve DHT routing. In: Lecture notes in computer science, vol 3293. Springer, Berlin, pp 44–62

    Google Scholar 

  28. Wessels D (2001) Web caching, 1st edn. O’Reilly & Associates, Sebastopol, pp xv, 300

    Google Scholar 

  29. Witten IH, Moffat A, Bell TC (1999) Managing gigabytes: compressing and indexing documents and images, 2nd edn. In: The Morgan Kaufmann series in multimedia information and systems. Morgan Kaufmann, San Francisco, pp xxxi, 519

    Google Scholar 

  30. Zegura EW, Calvert K, Donahoo MJ (1997) A quantitative comparison of graph-based models for internet topology. IEEE/ACM Trans Netw 5(6):770–783

    Article  Google Scholar 

  31. Zhou S, Ganger GR, Steenkiste P (2003) Balancing locality and randomness in DHTs. Carnegie Mellon University Technical Report CMU-CS-03-203

Download references

Author information

Authors and Affiliations

  1. UXC Applications Development, Hobart, TAS, 7001, Australia

    John Casey

  2. School of Information Technology, Deakin University, Burwood, VIC, 3125, Australia

    Wanlei Zhou

Authors
  1. John Casey
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Wanlei Zhou
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Wanlei Zhou.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Casey, J., Zhou, W. A locality aware cache diffusion system. J Supercomput 52, 1–22 (2010). https://doi.org/10.1007/s11227-009-0264-y

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11227-009-0264-y

Keywords

Search

Navigation