Replacement problem in Web caching
Author
Çakıroğlu, Seda
Arıkan, Erdal
Date
2003-06-07Source Title
Proceedings - IEEE Symposium on Computers and Communications
Print ISSN
1530-1346
Publisher
IEEE
Pages
425 - 430
Language
English
Type
Conference PaperItem Usage Stats
176
views
views
138
downloads
downloads
Abstract
Caching has been recognized as an effective scheme for avoiding service bottleneck and reducing network traffic in World Wide Web. Our work focuses on the replacement problem in Web caching, which arises due to limited storage. We seek the best configuration for a fully connected network of N caches. The problem is formulated as a discrete optimization problem. A number of low complexity heuristics are studied to obtain approximate solutions. Performances are tested under fictitious probabilistic request sequences access logs of real Web traffic. LFD (longest-forward-distance), the classical optimal off-line paging algorithm, is observed not to be optimal. Instead a window scheme should be used. Under an unchanging request pattern, a simple static placement algorithm achieves the maximum hit rates using the arrival probabilities. Otherwise, for quick adaptation to changing requests and for better worst-case performances a randomized algorithm should be chosen. We also give an analysis of Web data to propose best heuristics for its characteristics. © 2003 IEEE.
Keywords
Approximate solutionDiscrete optimization problems
Fully connected networks
Network traffic
Paging algorithms
Placement algorithm
Randomized Algorithms
Worst-case performance
Algorithms
Communication
Complex networks
Digital storage
Optimization
World Wide Web