Queues with service resetting
Ofek Lauber Bonomo, Uri Yechiali, Shlomi Reuveni

TL;DR
This paper develops a comprehensive theory for queues with service resetting, considering independent sources of service time variability, and identifies conditions under which resetting improves queue performance.
Contribution
It introduces a new theoretical framework for $S ext{ extasciitilde}X$ queues with service resetting, analyzing cases with sum or product of service components, and evaluates resetting policies.
Findings
Resetting can reduce mean service time under certain conditions.
Explicit expressions for service time distribution and queue metrics are derived.
Numerical simulations confirm the analytical results.
Abstract
Service time fluctuations heavily affect the performance of queueing systems, causing long waiting times and backlogs. Recently, it was shown that when service times are solely determined by the server, service resetting can mitigate the deleterious effects of service time fluctuations and drastically improve queue performance (Bonomo et al.,2022). Yet, in many queueing systems, service times have two independent sources: the intrinsic server slowdown () and the jobs' inherent size (). In these, so-called queues (Gardner et al., 2017), service resetting results in a newly drawn server slowdown while the inherent job size remains unchanged. Remarkably, resetting can be useful even then. To show this, we develop a comprehensive theory of queues with service resetting. We consider cases where the total service time is either a product or a sum of the service slowdown…
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
TopicsAdvanced Queuing Theory Analysis · Network Traffic and Congestion Control · Optimization and Search Problems
