Replacement problem in Web caching
dc.citation.epage | 430 | en_US |
dc.citation.spage | 425 | en_US |
dc.contributor.author | Çakıroğlu, Seda | en_US |
dc.contributor.author | Arıkan, Erdal | en_US |
dc.coverage.spatial | Kemer-Antalya, Turkey | |
dc.date.accessioned | 2016-02-08T11:54:55Z | |
dc.date.available | 2016-02-08T11:54:55Z | |
dc.date.issued | 2003-06-07 | en_US |
dc.department | Department of Electrical and Electronics Engineering | en_US |
dc.description | Date of Conference: 30 June -3 July 2003 | |
dc.description | Conference name: Proceedings of the Eighth IEEE Symposium on Computers and Communications. ISCC 2003 | |
dc.description.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. | en_US |
dc.description.provenance | Made available in DSpace on 2016-02-08T11:54:55Z (GMT). No. of bitstreams: 1 bilkent-research-paper.pdf: 70227 bytes, checksum: 26e812c6f5156f83f0e77b261a471b5a (MD5) Previous issue date: 2003 | en |
dc.identifier.doi | 10.1109/ISCC.2003.1214156 | en_US |
dc.identifier.issn | 1530-1346 | |
dc.identifier.uri | http://hdl.handle.net/11693/27495 | |
dc.language.iso | English | en_US |
dc.publisher | IEEE | |
dc.relation.isversionof | http://dx.doi.org/10.1109/ISCC.2003.1214156 | en_US |
dc.source.title | Proceedings - IEEE Symposium on Computers and Communications | en_US |
dc.subject | Approximate solution | en_US |
dc.subject | Discrete optimization problems | en_US |
dc.subject | Fully connected networks | en_US |
dc.subject | Network traffic | en_US |
dc.subject | Paging algorithms | en_US |
dc.subject | Placement algorithm | en_US |
dc.subject | Randomized Algorithms | en_US |
dc.subject | Worst-case performance | en_US |
dc.subject | Algorithms | en_US |
dc.subject | Communication | en_US |
dc.subject | Complex networks | en_US |
dc.subject | Digital storage | en_US |
dc.subject | Optimization | en_US |
dc.subject | World Wide Web | en_US |
dc.title | Replacement problem in Web caching | en_US |
dc.type | Conference Paper | en_US |
Files
Original bundle
1 - 1 of 1
Loading...
- Name:
- Replacement problem in Web caching.pdf
- Size:
- 2.56 MB
- Format:
- Adobe Portable Document Format
- Description:
- Full printable version