<?xml version="1.0" encoding="UTF-8"?><xml><records><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Pallis, George</style></author><author><style face="normal" font="default" size="100%">Athena Vakali</style></author><author><style face="normal" font="default" size="100%">Sidiropoulos, Eythimis</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">FRES-CAR: An Adaptive Cache Replacement Policy</style></title><secondary-title><style face="normal" font="default" size="100%">WIRI</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2005</style></year></dates><publisher><style face="normal" font="default" size="100%">IEEE Computer Society</style></publisher><pages><style face="normal" font="default" size="100%">74-81</style></pages><isbn><style face="normal" font="default" size="100%">0-7695-2414-1</style></isbn><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;Caching Web objects has become a common practicetowards improving content delivery and usersâ€™ servicing.A Web caching framework is characterized by its cachereplacement policy, which identifies the objects (i.e. theelements on a Web page, which include text, graphics,and scripts) to be replaced in a cache upon a requestarrival. In this paper, we present a cache replacementalgorithm (so-called FRES-CAR), which identifies theobjects that should be evicted by considering togetherthree important criteria: objectâ€™s frequency, recency andsize. Experimentation under synthetic workloads hasshown that FRES-CAR achieves higher hit rates whencompared with the most popular and existing algorithms.&lt;/p&gt;
</style></abstract></record></records></xml>