This paper surveys a variety of data compression methods spanning almost 40 years of
research, from the work of Shannon, Fano, and Huffman in the late 1940s to a technique …

Arithmetic coding for data compression Page 1 COMPUTING PRACTICES Edgar H. Sibley
Panel Editor The state of the art in data compression is arithmetic coding, not the betterknown …

In a multi-level cache such as those used for web caching, a hit at level l leads to the
caching of the requested object in all intermediate caches on the reverse path (levels l− 1 …

Im Zentrum des Interesses der Informatik hat sich in den letzten Jahren das Gebiet
Algorithmen und Datenstrukturen beachtlich entwickelt. Dabei geht es sowohl um den …

This handbook provides an up-to-date compendium of fundamental computer science
topics, techniques, and applications. Along with updating and revising many of the existing …

Large scale hierarchical caches for Web content have been deployed widely in an attempt to
reduce delivery delays and bandwidth consumption and also to improve the scalability of …

This chapter surveys results in the design and analysis of self-organizing data structures for
the search problem. The general search problem in pointer data structures can be phrased …

We show how to combine Fourier analysis with coupling arguments to bound the mixing
times of a variety of Markov chains. The mixing time is the number of steps a Markov chain …

We introduce and analyze new randomized policies for the management of web caches.
The proposed policies are fully scalable, ie, handling a hit or an eviction requires only O (1) …

In this paper we study the performance of a family of cache replacement algorithms. The
cache is decomposed into lists. Items enter the cache via the first list. An item enters the …