Optimal caching of files in a content distribution network (CDN) is a problem of fundamental
and growing commercial interest. Although many different caching algorithms are in use …

Cache policies to minimize the content retrieval cost have been studied through competitive
analysis when the miss costs are additive and the sequence of content requests is arbitrary …

The most common approach for modeling and solving routing and scheduling problems in a
dynamic setting is to solve, as close to optimal as possible, a series of deterministic, myopic …

We study the multi-user scheduling problem for minimizing the Age of Information (AoI) in
cellular wireless networks under stationary and non-stationary regimes. We derive …

We consider the classical uncoded caching problem from an online learning point-of-view. A
cache of limited storage capacity can hold C files at a time from a large catalog. A user …

We consider ranking and clustering problems related to the aggregation of inconsistent
information. Ailon, Charikar, and Newman [1] proposed randomized constant factor …

In this paper, we present a solution for a dynamic rescheduling problem involving new
orders arriving randomly while static orders have been given in advance in warehouse …

In the modern interactive computing era, computational problems such as scheduling, rout-
ing, sequencing, and resource management are online in nature. In the online framework, at …

In this paper, we study how to utilize forecasts to design online electrical vehicle (EV)
charging algorithms that can attain strong performance guarantees. We consider the …

We study competitive online algorithms for EV (electrical vehicle) charging under the
scenario of an aggregator serving a large number of EVs together with its background load …