Competitive Analysis of Online Facility Assignment for General Layout of Servers on a Line
Tsubasa Harada, Toshiya Itoh

TL;DR
This paper introduces a new online algorithm PTCP for facility assignment on a line, achieving the best known competitive ratio for layouts with small diameter-to-adjacency ratios, and establishes its optimality within a certain class.
Contribution
The paper proposes the PTCP algorithm for OFAL, providing a tight competitive ratio bound and demonstrating its optimality among MPFS algorithms for various server layouts.
Findings
PTCP has a competitive ratio of (2α(S)+1).
The ratio is optimal within the MPFS class.
Performance varies with server layout, from constant to linear in k.
Abstract
In the online facility assignment on a line with a set of servers and a capacity , each server with a capacity is placed on a line, and a request arrives on a line one-by-one. The task of an online algorithm is to irrevocably match a current request with one of the servers with vacancies before the next request arrives. An algorithm can match up to requests to a server . In this paper, we propose a new online algorithm PTCP (Policy Transition at Critical Point) for and show that PTCP is -competitive, where is informally the ratio of the diameter of to the maximum distance between two adjacent servers in . Depending on the layout of servers, ranges from constant (independent of ) to . Among all of known algorithms for…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsOptimization and Search Problems · Distributed systems and fault tolerance · Auction Theory and Applications
