Maintaining strong cache consistency in the World-Wide Web
Maintaining strong cache consistency in the World-Wide Web
复制标题
DOI：
10.1109/icdcs.1997.597804
复制
发表时间：
1997-05
期刊：
影响因子：
--
通讯作者：
P. Cao;Chengjie Liu
中科院分区：
文献类型：
--
作者：
P. Cao;Chengjie Liu
随着Web规模的不断扩大，缓存变得越来越重要。缓存随之而来的是缓存一致性问题。传统观点认为，强缓存一致性对于Web来说代价太高，而生存时间(Time-to-Live，TTL)等弱一致性方法最合适。本文比较了三种一致性方法：自适应TTL、每次轮询和失效，并在模拟环境中使用原型实现和跟踪重放。我们的结果表明，与自适应TTL相比，无效产生的网络流量和服务器工作负载更少或相当，并且平均客户端响应时间略低，而每次轮询会产生更多的网络流量和更长的客户端响应时间。我们证明，与流行的观点相反，对于Web，强缓存一致性可以在比目前的弱一致性方法更少或不额外的代价下被维护，并且应该使用基于失效的协议来维护。
As the Web continues to explode in size, caching becomes increasingly important. With caching comes the problem of cache consistency. Conventional wisdom holds that strong cache consistency is too expensive for the Web, and weak consistency methods such as Time-To-Live (TTL) are most appropriate. The article compares three consistency approaches: adaptive TTL, polling-every-time, and invalidation, using prototype implementation and trace replay in a simulated environment. Our results show that invalidation generates less or a comparable amount of network traffic and server workload than adaptive TTL and has a slightly lower average client response time, while polling-every-time generates more network traffic and longer client response times. We show that, contrary to popular belief, strong cache consistency can be maintained for the Web with little or no extra cost than the current weak consistency approaches, and it should be maintained using an invalidation based protocol.