Request Distribution Aware Caching in Cluster-Based Web Servers

  • Tagung:

    Konferenzartikel 

  • Autoren:

    Walter F. Tichy
    Vlad Olaru     

  • Summary

    This paper presents a performance analysis of request distribution-aware caching in cluster-based Web servers. We use the Zipf-like request distribution curve to guide static Web document caching. A combination of cooperative caching and exclusive caching provides for a cluster-wide caching system that avoids document replication across the cluster. We explore the benefits of cooperative caching algorithms that use request distribution information to steer their behavior over general purpose cooperative caching algorithms. Exclusive caching exercises a &#64257ne-grained control over replication of data blocks across the cluster. The performance of the system has been assessed by using the WebStone benchmark. Our cluster-based server employs Linux kernel-level implementations of cooperative caching and exclusive caching. Current results show that request distribution-aware caching outperforms general-purpose caching algorithms, makes up for the performance loss of non-replicated data solutions and compares favorably to fully-replicated solutions.
  • Jahr:

    2004 

  • Links:
Beteiligte Mitarbeiter (zufällige Reihenfolge)
Titel Vorname Nachname
Prof. em. Dr. Walter F. Tichy
Dr. Vlad Olaru

Bibtex

@inproceedings{,
author={Walter F. Tichy, Vlad Olaru},
title={Request Distribution Aware Caching in Cluster-Based Web Servers},
year=2004,
month=Aug,
booktitle={Proc. of the 3rd IEEE International Symposium on Network Computing and Applications (IEEE NCA04)},
url={https://ps.ipd.kit.edu/downloads/ka_2004_request_distribution_aware_caching.pdf},
abstract={This paper presents a performance analysis of request distribution-aware caching in cluster-based Web servers. We use the Zipf-like request distribution curve to guide static Web document caching. A combination of cooperative caching and exclusive caching provides for a cluster-wide caching system that avoids document replication across the cluster. We explore the benefits of cooperative caching algorithms that use request distribution information to steer their behavior over general purpose cooperative caching algorithms. Exclusive caching exercises a &#64257ne-grained control over replication of data blocks across the cluster. The performance of the system has been assessed by using the WebStone benchmark. Our cluster-based server employs Linux kernel-level implementations of cooperative caching and exclusive caching. Current results show that request distribution-aware caching outperforms general-purpose caching algorithms, makes up for the performance loss of non-replicated data solutions and compares favorably to fully-replicated solutions.},
}