DocumentCode :
959578
Title :
Efficiently serving dynamic data at highly accessed web sites
Author :
Challenger, James R. ; Dantzig, Paul ; Iyengar, Arun ; Squillante, Mark S. ; Zhang, Li
Author_Institution :
IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA
Volume :
12
Issue :
2
fYear :
2004
fDate :
4/1/2004 12:00:00 AM
Firstpage :
233
Lastpage :
246
Abstract :
We present architectures and algorithms for efficiently serving dynamic data at highly accessed Web sites together with the results of an analysis motivating our design and quantifying its performance benefits. This includes algorithms for keeping cached data consistent so that dynamic pages can be cached at the Web server and dynamic content can be served at the performance level of static content. We show that our system design is able to achieve cache hit ratios close to 100% for cached data which is almost never obsolete by more than a few seconds, if at all. Our architectures and algorithms provide more than an order of magnitude improvement in performance using an order of magnitude fewer servers over that obtained under conventional methods.
Keywords :
Internet; Web sites; cache storage; Web server; cache hit ratio; cached data; dynamic content; dynamic data; highly accessed Web site; static content; Algorithm design and analysis; Databases; Performance analysis; Prefetching; Service oriented architecture; Stochastic processes; System analysis and design; Web page design; Web pages; Web server;
fLanguage :
English
Journal_Title :
Networking, IEEE/ACM Transactions on
Publisher :
ieee
ISSN :
1063-6692
Type :
jour
DOI :
10.1109/TNET.2004.826289
Filename :
1288129
Link To Document :
بازگشت