Techniques for Efficiently Serving and Caching Dynamic Web Content

This chapter presents an overview of techniques for efficiently serving and caching dynamic web data. We describe techniques for invoking server programs and architectures for serving dynamic web content. Caching is crucially important for improving the performance of Web sites generating significant dynamic data. We discuss techniques for caching dynamic Web data consistently. Fragmentbased web publication can significantly improve performance and increase the cacheability of dynamic web data. These techniques assume the existence of mechanisms for creating fragments. We discuss techniques for automatically detecting fragments in web pages.

[1]  K. Shin,et al.  Performance Guarantees for Web Server End-Systems: A Control-Theoretical Approach , 2002, IEEE Trans. Parallel Distributed Syst..

[2]  Eric Levy-Abegnoli,et al.  Architecture of a Web server accelerator , 2002, Comput. Networks.

[3]  Andrei Z. Broder,et al.  On the resemblance and containment of documents , 1997, Proceedings. Compression and Complexity of SEQUENCES 1997 (Cat. No.97TB100171).

[4]  Arun Iyengar,et al.  A publishing system for efficiently creating dynamic Web content , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[5]  Sharad Singhal,et al.  Web2K: Bringing QoS to Web Servers , 2000 .

[6]  Lakshmish Ramaswamy,et al.  Automatic detection of fragments in dynamically generated web pages , 2004, WWW '04.

[7]  Arun Iyengar,et al.  A Tiered System for Serving Differentiated Content , 2004, World Wide Web.

[8]  Divyakant Agrawal,et al.  Engineering and hosting adaptive freshness-sensitive web applications on data centers , 2003, WWW '03.

[9]  Prasant Mohapatra,et al.  A framework for managing QoS and improving performance of dynamic Web content , 2001, GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270).

[10]  Arun Iyengar,et al.  A scalable system for consistently caching dynamic Web data , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[11]  Miron Livny,et al.  Managing Memory to Meet Multiclass Workload Response Time Goals , 1993, VLDB.

[12]  Nina Bhatti,et al.  Web server support for tiered services , 1999, IEEE Netw..

[13]  Ludmila Cherkasova,et al.  Predictive admission control strategy for overloaded commercial Web server , 2000, Proceedings 8th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (Cat. No.PR00728).

[14]  Zhen Xiao,et al.  Moving Edge-Side Includes to the Real Edge - the Clients , 2003, USENIX Symposium on Internet Technologies and Systems.

[15]  Miron Livny,et al.  Goal-oriented buffer management revisited , 1996, SIGMOD '96.

[16]  Ludmila Cherkasova,et al.  Session-Based Admission Control: A Mechanism for Peak Load Management of Commercial Web Sites , 2002, IEEE Trans. Computers.

[17]  Arnd Christian König,et al.  Managing distributed memory to meet multiclass workload response time goals , 1999, Proceedings 15th International Conference on Data Engineering (Cat. No.99CB36337).

[18]  Krithi Ramamritham,et al.  Proxy-based acceleration of dynamically generated content on the world wide web: An approach and implementation , 2004, ACM Trans. Database Syst..

[19]  Mor Harchol-Balter,et al.  Priority mechanisms for OLTP and transactional Web applications , 2004, Proceedings. 20th International Conference on Data Engineering.

[20]  Prasant Mohapatra,et al.  An Admission Control Scheme for Predictable Server Response Time for Web Accesses , 2001, WWW '01.

[21]  David E. Culler,et al.  USENIX Association Proceedings of USITS ’ 03 : 4 th USENIX Symposium on Internet Technologies and Systems , 2003 .

[22]  Erich M. Nahum,et al.  A method for transparent admission control and request scheduling in e-commerce web sites , 2004, WWW '04.

[23]  Mark S. Squillante,et al.  Efficiently serving dynamic data at highly accessed web sites , 2004, IEEE/ACM Transactions on Networking.

[24]  Allan Kuchinsky,et al.  Quality is in the eye of the beholder: meeting users' requirements for Internet quality of service , 2000, CHI.

[25]  Mor Harchol-Balter,et al.  Improving preemptive prioritization via statistical characterization of OLTP locking , 2005, 21st International Conference on Data Engineering (ICDE'05).

[26]  Gerhard Weikum,et al.  Performance Evaluation of an Adaptive and Robust Load Control Method for the Avoidance of Data-Contention Thrashing , 1992, VLDB.

[27]  Tirthankar Lahiri,et al.  The Oracle database resource manager: Scheduling CPU resources at the application , 2001 .

[28]  Prasant Mohapatra,et al.  Overload control in QoS-aware web servers , 2003, Comput. Networks.

[29]  Miron Livny,et al.  Load control for locking: the “half-and-half” approach , 1990, PODS '90.

[30]  David R. Cheriton,et al.  Leases: an efficient fault-tolerant mechanism for distributed file cache consistency , 1989, SOSP '89.

[31]  John S. Heidemann,et al.  Application‐level differentiated services for Web servers , 1999, World Wide Web.

[32]  Douglas M. Freimuth,et al.  Kernel Mechanisms for Service Differentiation in Overloaded Web Servers , 2001, USENIX Annual Technical Conference, General Track.

[33]  Prashant J. Shenoy,et al.  Cooperative leases: scalable consistency maintenance in content distribution networks , 2002, WWW.

[34]  William LeFebvre,et al.  CNN.com: Facing a World Crisis , 2001, LiSA.

[35]  Allan Kuchinsky,et al.  Integrating user-perceived quality into Web server design , 2000, Comput. Networks.

[36]  Michael Dahlin,et al.  Volume Leases for Consistency in Large-Scale Systems , 1999, IEEE Trans. Knowl. Data Eng..

[37]  Tarek F. Abdelzaher,et al.  Web Content Adaptation to Improve Server Overload Behavior , 1999, Comput. Networks.