• About
  • Policies
  • What is openaccess
  • Library
  • Contact
Advanced search
      View Item 
      •   BUIR Home
      • Scholarly Publications
      • Faculty of Engineering
      • Department of Electrical and Electronics Engineering
      • View Item
      •   BUIR Home
      • Scholarly Publications
      • Faculty of Engineering
      • Department of Electrical and Electronics Engineering
      • View Item
      JavaScript is disabled for your browser. Some features of this site may not work without it.

      Replacement problem in Web caching

      Thumbnail
      View / Download
      2.6 Mb
      Author
      Çakıroğlu, Seda
      Arıkan, Erdal
      Date
      2003-06-07
      Source Title
      Proceedings - IEEE Symposium on Computers and Communications
      Print ISSN
      1530-1346
      Publisher
      IEEE
      Pages
      425 - 430
      Language
      English
      Type
      Conference Paper
      Item Usage Stats
      176
      views
      138
      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 solution
      Discrete 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
      Permalink
      http://hdl.handle.net/11693/27495
      Published Version (Please cite this version)
      http://dx.doi.org/10.1109/ISCC.2003.1214156
      Collections
      • Department of Electrical and Electronics Engineering 3524
      Show full item record

      Browse

      All of BUIRCommunities & CollectionsTitlesAuthorsAdvisorsBy Issue DateKeywordsTypeDepartmentsThis CollectionTitlesAuthorsAdvisorsBy Issue DateKeywordsTypeDepartments

      My Account

      Login

      Statistics

      View Usage StatisticsView Google Analytics Statistics

      Bilkent University

      If you have trouble accessing this page and need to request an alternate format, contact the site administrator. Phone: (312) 290 1771
      Copyright © Bilkent University - Library IT

      Contact Us | Send Feedback | Off-Campus Access | Admin | Privacy