Show simple item record

dc.contributor.authorCakiroglu, S.en_US
dc.contributor.authorArikan, E.en_US
dc.date.accessioned2016-02-08T11:54:55Z
dc.date.available2016-02-08T11:54:55Z
dc.date.issued2003en_US
dc.identifier.issn15301346en_US
dc.identifier.urihttp://hdl.handle.net/11693/27495
dc.description.abstractCaching 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.language.isoEnglishen_US
dc.source.titleProceedings - IEEE Symposium on Computers and Communicationsen_US
dc.relation.isversionofhttp://dx.doi.org/10.1109/ISCC.2003.1214156en_US
dc.subjectApproximate solutionen_US
dc.subjectDiscrete optimization problemsen_US
dc.subjectFully connected networksen_US
dc.subjectNetwork trafficen_US
dc.subjectPaging algorithmsen_US
dc.subjectPlacement algorithmen_US
dc.subjectRandomized Algorithmsen_US
dc.subjectWorst-case performanceen_US
dc.subjectAlgorithmsen_US
dc.subjectCommunicationen_US
dc.subjectComplex networksen_US
dc.subjectDigital storageen_US
dc.subjectOptimizationen_US
dc.subjectWorld Wide Weben_US
dc.titleReplacement problem in Web cachingen_US
dc.typeConference Paperen_US
dc.departmentDepartment of Electrical and Electronics Engineering
dc.citation.spage425en_US
dc.citation.epage430en_US
dc.identifier.doi10.1109/ISCC.2003.1214156en_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record