Skip to main content

Online service with delay

Publication ,  Conference
Azar, Y; Ganesh, A; Ge, R; Panigrahi, D
Published in: Proceedings of the Annual ACM Symposium on Theory of Computing
June 19, 2017

In this paper, 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 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, that 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.

Duke Scholars

Published In

Proceedings of the Annual ACM Symposium on Theory of Computing

DOI

ISSN

0737-8017

Publication Date

June 19, 2017

Volume

Part F128415

Start / End Page

551 / 563
 

Citation

APA
Chicago
ICMJE
MLA
NLM
Azar, Y., Ganesh, A., Ge, R., & Panigrahi, D. (2017). Online service with delay. In Proceedings of the Annual ACM Symposium on Theory of Computing (Vol. Part F128415, pp. 551–563). https://doi.org/10.1145/3055399.3055475
Azar, Y., A. Ganesh, R. Ge, and D. Panigrahi. “Online service with delay.” In Proceedings of the Annual ACM Symposium on Theory of Computing, Part F128415:551–63, 2017. https://doi.org/10.1145/3055399.3055475.
Azar Y, Ganesh A, Ge R, Panigrahi D. Online service with delay. In: Proceedings of the Annual ACM Symposium on Theory of Computing. 2017. p. 551–63.
Azar, Y., et al. “Online service with delay.” Proceedings of the Annual ACM Symposium on Theory of Computing, vol. Part F128415, 2017, pp. 551–63. Scopus, doi:10.1145/3055399.3055475.
Azar Y, Ganesh A, Ge R, Panigrahi D. Online service with delay. Proceedings of the Annual ACM Symposium on Theory of Computing. 2017. p. 551–563.

Published In

Proceedings of the Annual ACM Symposium on Theory of Computing

DOI

ISSN

0737-8017

Publication Date

June 19, 2017

Volume

Part F128415

Start / End Page

551 / 563