Delay sensitive least frequently used algorithm for replacement in web caches

Authors:
S. Selvakumar;Swarup Kumar Sahoo;Vijay Venkatasubramani
Affiliations:
Department of Computer Science and Engineering, Regional Engineering College, Tiruchirappalli 620015, Tamil Nadu, India;Department of Computer Science and Engineering, Regional Engineering College, Tiruchirappalli 620015, Tamil Nadu, India;Department of Computer Science and Engineering, Regional Engineering College, Tiruchirappalli 620015, Tamil Nadu, India
Venue:
Computer Communications
Year:
2004

Citing 7
Cited 1

World-Wide Web proxies

Selected papers of the first conference on World-Wide Web
A caching relay for the World Wide Web

Selected papers of the first conference on World-Wide Web
Main memory caching of Web documents

Proceedings of the fifth international World Wide Web conference on Computer networks and ISDN systems
Performance engineering of the World Wide Web: application to dimensioning and cache design

Proceedings of the fifth international World Wide Web conference on Computer networks and ISDN systems
Proxy caching that estimates page load delays

Selected papers from the sixth international conference on World Wide Web
Characteristics of WWW Client-based Traces

Characteristics of WWW Client-based Traces
A hierarchical internet object cache

ATEC '96 Proceedings of the 1996 annual conference on USENIX Annual Technical Conference

Using data envelopment analysis to evaluate the efficiency of web caching object replacement strategies

Journal of Network and Computer Applications

Quantified Score

Hi-index	0.24

Visualization

Abstract

Caching at proxy servers plays an important role in reducing the response time, network delays, and load on the Web servers. The performance of caching depends critically on the design of the cache replacement algorithm. Most of the cache replacement algorithms consider only Hit-Ratio or Byte-Hit-Ratio, and ignore the fetch time of the documents to the cache. In this paper, a new delay conscious cache replacement algorithm has been proposed. The proposed algorithm considers the retrieval time of the document from servers in addition to the frequency of references to the document, the document size, and an ageing factor and maximizes a performance metric called Communication Delay Ratio (CDR). The new algorithm has been tested and compared to the existing policies such as, LRU, LFU, LNC-R-W3, and Greedy-Dual-Size Frequency.