Advertisement

A Scalable Architecture for Cooperative Web Caching

  • Riccardo Lancellotti
  • Bruno Ciciani
  • Michele Colajanni
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2376)

Abstract

Cooperative Web caching is the most common solution for augmenting the low cache hit rates due to single proxies. However, both purely hierarchical and flat architectures suffer from scalability problems due to cooperation protocol overheads. We present a new cooperative architecture that organizes cache servers in well connected clusters and implements a novel cooperation model based on a two-tier lookup process. The experimental results carried out on a working prototype show that the proposed architecture is really effective in supporting cooperative Web caching because it guarantees cache hit rates comparable to those of the most performing architectures and it reduces cooperation overhead at a small fraction of that of other protocols.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    IRCache: Ircache project (1995)-http://www.ircache.net.
  2. [2]
    AT&T: At&t (2002)-http://www.att.com.
  3. [3]
    Akamai: Akamai inc. (2002)-http://www.akamai.com.
  4. [4]
    DigitalIsland: Digital island inc. (2002)-http://www.digitalisland.com.
  5. [5]
    Wang, J.: A survey of web caching schemes for the internet. ACM Computer Communication Review 29 (1999)Google Scholar
  6. [6]
    Rodriguez, P., Spanner, C., Biersack, E.: Web caching architectures: hierarchical and distributed caching. In: Proc. of Web Caching Workshop (WCW’99). (1999)Google Scholar
  7. [7]
    Rabinovich, M., Spatscheck, O.: Web Caching and Replication. Addison Wesley (2002)Google Scholar
  8. [8]
    Wessels, D.: Web Caching. O’Reilly (2001)Google Scholar
  9. [9]
    Yu, P.S., MacNair, E.A.: Performance study of a collaborative method for hierarchical caching in proxy servers. Computer Networks and ISDN Systems (1998) 215–224Google Scholar
  10. [10]
    Wessels, D., Claffy, K.: Internet cache protocol (icp), version 2 (1997) RFC 2186.Google Scholar
  11. [11]
    Fan, L., Cao, P., Almeida, J., Broder, A.Z.: Summary cache: A scalable wide-area web cache sharing protocol. IEEE/ACM Transactions on Networking 8 (2000) 281–293CrossRefGoogle Scholar
  12. [12]
    Santoro, A., Ciciani, B., Colajanni, M., Quaglia, F.: Two-tier cooperation: A scalable protocol for web cache sharing. In: Proc. of IEEE International Symposium on Network Computing and Applications, Cambridge, MA (2002)Google Scholar
  13. [13]
    Gadde, S., Rabinovich, M., Chase, J.: An approach to building large internet caches. In: Proc. Sixth Workshop on Hot Topics in Operating Systems (HotOS-VI). (1997)Google Scholar
  14. [14]
    Collins, R., Nordstrom, H., Russkov, A., Wessels, D.: Squid web proxy cache (2002)-http://www.squid-cache.org.
  15. [15]
    Goemans, M.X., Williamson, D.P.: A general approximation technique for constrained forest problems. In: Proc. of ACM-SIAM Symposium on Discrete Algorithms. (1992)Google Scholar
  16. [16]
    Wessels, D.: Squid Programmers Guide. (2002)Google Scholar
  17. [17]
    Vixie, P., Wessels, D.: Hyper text caching protocol (htcp/0.0) (2000) RFC 2756.Google Scholar
  18. [18]
    Gadde, S., Chase, J., Rabinovich, M.: A taste of crispy squid. In: Proc. of Workshop on Internet Server Performance (WISP’98). (1998)Google Scholar
  19. [19]
    Russkov, A., Wessels, D.: Web polygraph (2000)-http://www.web-polygraph.org.
  20. [20]
    Papoulis, A., Pillai, S.U.: Probability, Random Variables and Stochastic Processes. McGraw-Hill (2001)Google Scholar
  21. [21]
    Bloom, B.: Space/time trade-offs in hash coding with allowable errors. Communications of the ACM 13 (1970) 422–426zbMATHCrossRefGoogle Scholar
  22. [22]
    Rousskov, A., Wessels, D.: Cache digests. Computer Networks and ISDN Systems 30 (1998)Google Scholar
  23. [23]
    Valloppillil, V., Ross, K.: Cache array routing protocol v1.0 (1998)Google Scholar
  24. [24]
    Ross, K.W.: Hash-routing for collections of shared web caches. IEEE Network Magazine (1997)Google Scholar
  25. [25]
    Rabinovich, M., Chase, J., Gadde, S.: Not all hits are created equal: Cooperative proxy caching over a wide-area network. In: Proc. of Third International WWW Caching Workshop. (1998)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Riccardo Lancellotti
    • 1
  • Bruno Ciciani
    • 2
    • 4
  • Michele Colajanni
    • 3
  1. 1.Dip. di Informatica, Sistemi e ProduzioneUniversità di Roma “Tor Vergata”Italy
  2. 2.Dip. di Informatica e SistemisticaUniversità di Roma “La Sapienza”Italy
  3. 3.Dip. di Ingegneria dell’InformazioneUniversità di Modena e Reggio EmiliaItaly
  4. 4.IBM Thomas J. Watson Research Center

Personalised recommendations