Abstracl-Large scale blerarchlcal cacbe. for web contell! have been deployed widely J.q lUI attempt to reduce delivery debYS aDd bandwldtb consumption and al80 to Improve tbe scalability of coutent dilll emmaUon through the world wide web. Irrespectively of tbe speclOc replacement algorithm employed In each cadle, a de faeto cbaraeterIsUc of contemporary hterardllcal cadles II that a hit for a document at an I-level cache Ipds to the eachlng of the docllment In aIl lntermed.iate caches Oevels 1-1, ... 11) on the path towards the leaf eache tbat received the Initial request this paper presents various algorithms that revise this stllldard behavior and attempt to be more seledive In choosing the caches that get to store a local copy of the requested document. As these algorithm. operate independently of the actual replacement algorithm running In each IDdlvldual cacbe, they are referred to al mas IlIgo,.JtJtm$. Three new meta algorithms are proposed and compared against tbe de facto one and a recently proposed Doe by means of synthetic and trace-drlven amuIa!fon •• The best of the new meta algorithm. appun to be leading to Improved performance ander mo.t simnlated scenarios, especially under a low availability of storage. Tbe latter observallon makes tbe presented meta a1goritbm. particularly favorable for the handOng ofJarge data objects lacb as stored music files or short video ellp •. Addilionally, a ample ioad balancing algorithm that Is based on the toncept of meta algorithms Is proposed aDd evaluated. The algorithm is sbown to be able to provIde for aD effective balandDg of load thus pouibly addressing the recentiy dlseovered "filterlng effect" in blerarchleal web caches.
LCD is proposed in REF for web caching.
Meta algorithms for hierarchical Web caches
IEEE International Conference on Performance, Computing, and Communications, 2004
IEEE International Conference on Performance, Computing, and Communications, 2004
Computer Science