English
Related papers

Related papers: The Battle of Infinity: Explosive Demand Surge vs …

200 papers

We establish a heavy-traffic limit theorem on convergence in distribution for the number of customers in a many-server queue when the number of servers tends to infinity. No critical loading condition is assumed. Generally, the limit…

Probability · Mathematics 2010-01-14 Anatolii A. Puhalskii , Josh E. Reed

We consider the $\Delta_{(i)}/G/1$ queue, in which a a total of $n$ customers independently demand service after an exponential time. We focus on the case of heavy-tailed service times, and assume that the tail of the service time…

Probability · Mathematics 2016-05-23 Gianmarco Bet , Remco van der Hofstad , Johan S. H. van Leeuwaarden

This paper purpose is to investigate exponential behavior conditions for the infinite servers queue with Poisson arrivals busy period length distribution. It is presented a general theoretical result that is the basis of this work. The…

Probability · Mathematics 2021-09-30 Manuel Alberto M. Ferreira , José António Filipe

Amid unprecedented times caused by COVID-19, healthcare systems all over the world are strained to the limits of, or even beyond, capacity. A similar event is experienced by some healthcare systems regularly, due to for instance seasonal…

Performance · Computer Science 2020-04-30 Binyamin Oz , Seva Shneer , Ilze Ziedins

This paper studies the effect of an overdispersed arrival process on the performance of an infinite-server system. In our setup, a random environment is modeled by drawing an arrival rate $\Lambda$ from a given distribution every $\Delta$…

Probability · Mathematics 2016-02-02 Mariska Heemskerk , Johan van Leeuwaarden , Michel Mandjes

The infinite-server queueing models with homogeneous and non-homogeneous arrivals of customers and catastrophes are considered. The probability generating functions of joint distributions of numbers of busy servers and served customers, as…

Optimization and Control · Mathematics 2018-07-24 Khanik Kerobyan

We obtain asymptotic bounds for the tail distribution of steady-state waiting time in a two server queue where each server processes incoming jobs at a rate equal to the rate of their arrivals (that is, the half-loaded regime). The job…

Probability · Mathematics 2016-04-05 Jose Blanchet , Karthyek Murthy

In this paper we study the number of customers in infinite-server queues with a self-exciting (Hawkes) arrival process. Initially we assume that service requirements are exponentially distributed and that the Hawkes arrival process is of a…

Probability · Mathematics 2018-05-02 David Koops , Mayank Saxena , Onno Boxma , Michel Mandjes

This paper concerns the recurrence structure of the infinite server queue, as viewed through the prism of the maximum dater sequence, namely the time to drain the current work in the system as seen at arrival epochs. Despite the importance…

Probability · Mathematics 2026-01-12 Sergey Foss , Peter Glynn

We study the asymptotic response time tail in the M/G/n multi-server queue with heavy-tailed (regularly varying) job sizes, a setting representative of modern computing workloads. For single-server systems, tail optimization is well…

Performance · Computer Science 2026-05-14 Zhouzi Li , Mor Harchol-Balter , Alan Scheller-Wolf

We consider a service system with an infinite number of exponential servers sharing a finite service capacity. The servers are ordered according to their speed, and arriving customers join the fastest idle server. A capacity allocation is…

Probability · Mathematics 2018-08-23 Refael Hassin , Liron Ravner

Stochastic service systems describe situations in which customers compete for service from scarce resources. Think of check-in lines at airports, waiting rooms in hospitals or queues in supermarkets, where the scarce resource is human…

Probability · Mathematics 2017-06-30 Britt W. J. Mathijsen

We study a variant of the $k$-server problem, the infinite server problem, in which infinitely many servers reside initially at a particular point of the metric space and serve a sequence of requests. In the framework of competitive…

Data Structures and Algorithms · Computer Science 2017-03-01 Christian Coester , Elias Koutsoupias , Philip Lazos

We consider the problem of scheduling a queueing system in which many statistically identical servers cater to several classes of impatient customers. Service times and impatience clocks are exponential while arrival processes are renewal.…

Probability · Mathematics 2007-05-23 Rami Atar , Avi Mandelbaum , Martin I. Reiman

Motivated by timeouts in Internet services, we consider networks of infinite server queues in which routing decisions are based on deadlines. Specifically, at each node in the network, the total service time equals the minimum of several…

Performance · Computer Science 2016-09-20 Neal Master , Nicholas Bambos

In many different settings, requests for service can arrive in near or true simultaneity with one another. This creates batches of arrivals to the underlying queueing system. In this paper, we study the staffing problem for the batch…

Performance · Computer Science 2023-05-31 Andrew Daw , Robert C. Hampshire , Jamol Pender

The model is motivated by the problem of load distribution in large-scale cloud-based data processing systems. We consider a heterogeneous service system, consisting of multiple large server pools. The pools are different in that their…

Probability · Mathematics 2015-06-11 Alexander Stolyar

A service system with multiple types of customers, arriving according to Poisson processes, is considered. The system is heterogeneous in that the servers also can be of multiple types. Each customer has an independent exponentially…

Probability · Mathematics 2016-05-20 Alexander Stolyar

Motivated by the impact of emerging technologies on toll parks, this paper studies a problem of equilibrium, social welfare, and revenue for an infinite-server queue. More specifically, we assume that a customer's utility consists of a…

Optimization and Control · Mathematics 2022-12-23 Yan Su

We are interested in a large queue in a $GI/G/k$ queue with heterogeneous servers. For this, we consider tail asymptotics and weak limit approximations for the stationary distribution of its queue length process in continuous time under a…

Probability · Mathematics 2017-03-10 Masakiyo Miyazawa
‹ Prev 1 2 3 10 Next ›