NDLI: New Web cache replacement approaches based on internal requests factor

Content Provider	IEEE Xplore Digital Library
Author	Sarhan, Amany Elmogy, Ahmed M. Ali, Sally Mohamed
Copyright Year	2014
Description	Author affiliation: Computers and Control Engineering, Tanta University, Egypt (Ali, Sally Mohamed) \|\| Computers and Control Engineering Department, Tanta University, Egypt (Sarhan, Amany; Elmogy, Ahmed M.)
Abstract	The increasing demand for World Wide Web (WWW) services has led to a considerable increase in the amount of Internet traffic. As a result, the network becomes highly prone to congestion which increases the load on servers, resulting in increasing the access times of WWW documents. Thus, web caching is crucial for reducing the load on network, shorten network latency and improve clients' waiting time. Many web cashing systems and policies have been proposed to determine which objects to evict from the cache memory to accommodate new ones. Most of these systems and policies are mainly based on the enhancement of a well-known scheme called the Least Frequently Used (LFU) scheme. Although most of the proposed schemes could overcome the disadvantages of the LFU, they still have lots of overhead and are difficult to implement. This work proposes replacement approaches with better characteristics as they are easier to be implemented than the previous approaches. The proposed approaches consider the internal requests generated in each web site. We added this factors to two famous approaches; LFU and Weighting Replacement Policy (WRP) to strength their performance. The experimental results indicate the superiority of the proposed approaches compared to both LFU and WRP, in terms of improvement in cache performance.
Starting Page	383
Ending Page	389
File Size	624386
Page Count	7
File Format	PDF
e-ISBN	9781479965946
DOI	10.1109/ICCES.2014.7030990
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2014-12-22
Publisher Place	Egypt
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Web Cache Least Frequently Used (LFU) Weighting-Replacement-Policy (WRP) Abstracts Hit Ratio Replacement Algorithms Reliability Equations
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

On the existence of a spectrum of policies that subsumes the least recently used (lru) and least frequently used (lfu) policies.

On the existence of a spectrum of policies that subsumes the least recently used (lru) and least frequently used (lfu) policies (1999).

LRFU (Least Recently/Frequently Used) Replacement Policy: A Spectrum of Block Replacement Policies (1996)

Evaluation of Enhanced Replacement Scheme (ERS) on Simplescalar Simulation Tool

Least recently plus five least frequently replacement policy (lr+5lf) (2010).

Web Cache Page Replacement by Using LRU and LFU Algorithms with Hit Ratio: A Case Unification

1 a framework for mf-lru (most frequently-least recently used) replacement policy.

On the Existence of a Spectrum of Policies That Subsumes the Least Recently Used (LRU) and Least Frequently Used (LFU) Policies (1999)

Cache Replacement Algorithms for YouTube

New Web cache replacement approaches based on internal requests factor

Similar Documents

On the existence of a spectrum of policies that subsumes the least recently used (lru) and least frequently used (lfu) policies.

On the existence of a spectrum of policies that subsumes the least recently used (lru) and least frequently used (lfu) policies (1999).

LRFU (Least Recently/Frequently Used) Replacement Policy: A Spectrum of Block Replacement Policies (1996)

Evaluation of Enhanced Replacement Scheme (ERS) on Simplescalar Simulation Tool

Least recently plus five least frequently replacement policy (lr+5lf) (2010).

Web Cache Page Replacement by Using LRU and LFU Algorithms with Hit Ratio: A Case Unification

1 a framework for mf-lru (most frequently-least recently used) replacement policy.

On the Existence of a Spectrum of Policies That Subsumes the Least Recently Used (LRU) and Least Frequently Used (LFU) Policies (1999)

Cache Replacement Algorithms for YouTube

New Web cache replacement approaches based on internal requests factor