Distributed cloud applications, including batch processing, streaming, and scale-out
databases, generate a significant amount of network traffic and a considerable fraction of …

The classical paging problem, introduced by Sleator and Tarjan in 1985, formalizes the
problem of caching pages in RAM in order to minimize IOs. Their online formulation ignores …

In an α-way set-associative cache, the cache is partitioned into disjoint sets of size α, and
each item can only be cached in one set, typically selected via a hash function. Set …

In the file caching problem, the input is a sequence of requests for files out of a slow
memory. A file has two attributes, a positive retrieval cost and an integer size. An algorithm is …

We initiate the study of a natural and practically relevant new variant of online caching
where the to-be-cached items can have dependencies. We assume that the universe is a …

We study the online restricted caching problem, where each memory item can be placed in
only a restricted subset of cache locations. We solve this problem through a more general …

It is natural to generalize the online\(k\)-Server problem by allowing each request to specify
not only a point p, but also a subset S of servers that may serve it. To date, only a few special …

This paper is concerned with online caching algorithms for the (n, k)-companion cache,
defined by Brehob et al.(J. Scheduling 6 (2003) 149). In this model the cache is composed of …

This paper is concerned with online cachingalg orithms for the (n, k)-companion cache,
defined by Brehob et. al.[3]. In this model the cache is composed of two components: ak-way …

We study web caching with request reordering. The goal is to maintain a cache of web
documents so that a sequence of requests can be served at low cost. To improve cache hit …