Unbounded lower bound for k-server against weak adversaries

@article{Bienkowski2020UnboundedLB,
  title={Unbounded lower bound for k-server against weak adversaries},
  author={M. Bienkowski and J. Byrka and Christian Coester and Lukasz Je.z},
  journal={Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing},
  year={2020}
}
  • M. Bienkowski, J. Byrka, +1 author Lukasz Je.z
  • Published 2020
  • Mathematics, Computer Science
  • Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing
We study the resource augmented version of the k-server problem, also known as the k-server problem against weak adversaries or the (h,k)-server problem. In this setting, an online algorithm using k servers is compared to an offline algorithm using h servers, where h ≤ k. For uniform metrics, it has been known since the seminal work of Sleator and Tarjan (1985) that for any є>0, the competitive ratio drops to a constant if k=(1+є) · h. This result was later generalized to weighted stars (Young… Expand
The Infinite Server Problem
TLDR
This work shows a surprisingly tight connection between this problem and the resource augmentation version of the k-server problem, also known as the (h,k)- server problem, in which an online algorithm with k servers competes against an offline algorithm with h servers. Expand

References

SHOWING 1-10 OF 28 REFERENCES
Tight Bounds for Double Coverage Against Weak Adversaries
TLDR
It is proved that even if k > h the competitive ratio of DC does not improve; in fact, it increases slightly as k grows, tending to h + 1. Expand
Tight Bounds for Double Coverage Against Weak Adversaries
TLDR
It is proved that even if \(k>h\) the competitive ratio of DC does not improve; in fact, it increases up to \(h-1\) as k grows, and matching upper and lower bounds of \(\frac{k(h+1)}{k+1}\) on the competitive ratios on any tree metric are shown. Expand
Weak adversaries for the k-server problem
  • E. Koutsoupias
  • Mathematics, Computer Science
  • 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039)
  • 1999
TLDR
The technique is applied to give a simple condition for the Work Function Algorithm to be k-competitive; this condition results in a new proof that the k-server conjecture holds for k=2. Expand
Fusible HSTs and the Randomized k-Server Conjecture
  • James R. Lee
  • Computer Science, Mathematics
  • 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS)
  • 2018
TLDR
A poly(log k)-competitive randomized algorithm for the k-server problem on any metric space that maintains an approximation of the underlying metric space by a distribution over HSTs and adjusts the granularity and accuracy according to the aggregate behavior of the HST algorithms. Expand
The (h, k)-Server Problem on Bounded Depth Trees
TLDR
A new algorithm that is O(1)-competitive for constant depth trees, whenever $k =(1+\epsilon )h$ for any $\ep silon > 0$ gives the strongest known lower bound for the problem on general metrics. Expand
The Infinite Server Problem
TLDR
The infinite server problem is shown to be equivalent to the seemingly easier case in which all requests are in a fixed bounded interval away from the original position of the servers, and a lower bound is given for the competitive ratio. Expand
k-server via multiscale entropic regularization
TLDR
This work gives a new dynamic HST embedding that yields an O((logk)3 logΔ)-competitive algorithm on any metric space where the ratio of the largest to smallest non-zero distance is at most Δ. Expand
A primal-dual randomized algorithm for weighted paging
TLDR
A randomized O(log k) -competitive online algorithm for the weighted paging problem, where k is the cache size, which is the first randomized o(k)-competitive algorithm and its competitiveness matches the known lower bound on the problem. Expand
k-Servers with a Smile: Online Algorithms via Projections
TLDR
This algorithm has a competitive ratios that match some of the recent results given by Bubeck et al. (STOC 2018), whose algorithm was based on mirror-descent-based continuous dynamics prescribed via a differential inclusion. Expand
A Polylogarithmic-Competitive Algorithm for the k-Server Problem
TLDR
The first polylogarithmic-competitive randomized algorithm for the k-server problem on an arbitrary finite metric space is given, which improves upon the (2k-1)-competitive algorithm of Koutsoupias and Papadimitriou whenever n is sub-exponential in k. Expand
...
1
2
3
...