Name
Abstract | ||
|---|---|---|
AbstractIn this article, we introduce the online service with delay problem. In this problem, there are n points in a metric space that issue service requests over time, and there is a server that serves these requests. The goal is to minimize the sum of distance traveled by the server and the total delay (or a penalty function thereof) in serving the requests. This problem models the fundamental tradeoff between batching requests to improve locality and reducing delay to improve response time, which has many applications in operations management, operating systems, logistics, supply chain management, and scheduling. Our main result is to show a poly-logarithmic competitive ratio for the online service with delay problem. This result is obtained by an algorithm that we call the preemptive service algorithm. The salient feature of this algorithm is a process called preemptive service, which uses a novel combination of (recursive) time forwarding and spatial exploration on a metric space. We also generalize our results to k > 1 servers and obtain stronger results for special metrics such as uniform and star metrics that correspond to (weighted) paging problems. |
Year | DOI | Venue |
|---|---|---|
2021 | 10.1145/3459925 | ACM Transactions on Algorithms |
Keywords | DocType | Volume |
Paging, weighted paging, k-server, online algorithms, competitive ratio | Journal | 17 |
Issue | ISSN | Citations |
3 | 1549-6325 | 0 |
PageRank | References | Authors |
0.34 | 0 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yossi Azar | 1 | 3330 | 365.24 |
| Arun Ganesh | 2 | 3 | 0.75 |
| Rong Ge | 3 | 1626 | 76.01 |
| Debmalya Panigrahi | 4 | 269 | 35.78 |