Related papers: A Decomposition Approach to the Weighted $k$-serve…
We study the $k$-server problem with time-windows. In this problem, each request $i$ arrives at some point $v_i$ of an $n$-point metric space at time $b_i$ and comes with a deadline $e_i$. One of the $k$ servers must be moved to $v_i$ at…
We give the first polylogarithmic-competitive randomized online algorithm for the $k$-server problem on an arbitrary finite metric space. In particular, our algorithm achieves a competitive ratio of O(log^3 n log^2 k log log n) for any…
We study the problem of metrical service systems with multiple servers (MSSMS), which generalizes two well-known problems -- the $k$-server problem, and metrical service systems. The MSSMS problem is to service requests, each of which is an…
We present an $O((\log k)^2)$-competitive randomized algorithm for the $k$-server problem on hierarchically separated trees (HSTs). This is the first $o(k)$-competitive randomized algorithm for which the competitive ratio is independent of…
We initiate a formal study of fairness for the $k$-server problem, where the objective is not only to minimize the total movement cost, but also to distribute the cost equitably among servers. We first define a general notion of…
Resource allocation in distributed and networked systems such as the Cloud is becoming increasingly flexible, allowing these systems to dynamically adjust toward the workloads they serve, in a demand-aware manner. Online balanced…
We study three classical online problems -- $k$-server, $k$-taxi, and chasing size $k$ sets -- through a lens of smoothed analysis. Our setting allows request locations to be adversarial up to small perturbations, interpolating between…
The problem of online scheduling of multi-server jobs is considered, where there are a total of $K$ servers, and each job requires concurrent service from multiple servers for it to be processed. Each job on its arrival reveals its…
In the reordering buffer problem (RBP), a server is asked to process a sequence of requests lying in a metric space. To process a request the server must move to the corresponding point in the metric. The requests can be processed slightly…
In this paper we study a dynamic resource allocation problem which we call the stochastic k-server problem. In this problem, requests for some service to be performed appear at various locations over time, and we have a collection of k…
We consider a variant of the online buffer management problem in network switches, called the $k$-frame throughput maximization problem ($k$-FTM). This problem models the situation where a large frame is fragmented into $k$ packets and…
We consider the generalized $k$-server problem on uniform metrics. We study the power of memoryless algorithms and show tight bounds of $\Theta(k!)$ on their competitive ratio. In particular we show that the \textit{Harmonic Algorithm}…
We design and implement two single-pass semi-streaming algorithms for the maximum weight $k$-disjoint matching ($k$-DM) problem. Given an integer $k$, the $k$-DM problem is to find $k$ pairwise edge-disjoint matchings such that the sum of…
Suppose that $n$ items arrive online in random order and the goal is to select $k$ of them such that the expected sum of the selected items is maximized. The decision for any item is irrevocable and must be made on arrival without knowing…
We study a weighted online bipartite matching problem: $G(V_1, V_2, E)$ is a weighted bipartite graph where $V_1$ is known beforehand and the vertices of $V_2$ arrive online. The goal is to match vertices of $V_2$ as they arrive to vertices…
Motivated by the desire to utilize a limited number of configurable optical switches by recent advances in Software Defined Networks (SDNs), we define an online problem which we call the Caching in Matchings problem. This problem has a…
In the classical Online Metric Matching problem, we are given a metric space with $k$ servers. A collection of clients arrive in an online fashion, and upon arrival, a client should irrevocably be matched to an as-yet-unmatched server. The…
Consider the continuous distributed monitoring model in which $n$ distributed nodes, receiving individual data streams, are connected to a designated server. The server is asked to continuously monitor a function defined over the values…
We introduce the mobile server problem, inspired by current trends to move computational tasks from cloud structures to multiple devices close to the end user. An example for this are embedded systems in autonomous cars that communicate in…
We consider the offline sorting buffer problem. The input is a sequence of items of different types. All items must be processed one by one by a server. The server is equipped with a random-access buffer of limited capacity which can be…