English
Related papers

Related papers: Two-Parameter Heavy-Traffic Limits for Infinite-Se…

200 papers

We establish heavy-traffic stochastic-process limits for waiting times in many-server queues with customer abandonment. If the system is asymptotically critically loaded, as in the quality-and-efficiency-driven (QED) regime, then a bounding…

Probability · Mathematics 2009-12-10 Rishi Talreja , Ward Whitt

We consider a two-node tandem queueing network in which the upstream queue is M/G/1 and each job reuses its upstream service requirement when moving to the downstream queue. Both servers employ the first-in-first-out policy. We investigate…

Probability · Mathematics 2017-02-08 H. Christian Gromoll , Bryce Terwilliger , Bert Zwart

This is an expository review paper illustrating the ``martingale method'' for proving many-server heavy-traffic stochastic-process limits for queueing models, supporting diffusion-process approximations. Careful treatment is given to an…

Probability · Mathematics 2007-12-28 Guodong Pang , Rishi Talreja , Ward Whitt

In this paper we analyze a single server queue with batch arrivals and semi-Markovian service times. We also include the feature that the first service of each busy period might have a different distribution than subsequent service times.…

Probability · Mathematics 2018-12-07 Abhishek , Rudesindo Núñez Queija , Marko Boon

We study a general $k$ dimensional infinite server queues process with Markov switching, Poisson arrivals and where the service times are fat tailed with index $\alpha\in (0,1)$. When the arrival rate is sped up by a factor $n^\gamma$, the…

Probability · Mathematics 2021-06-21 Landy Rabehasaina

We consider a multi-server queue in the Halfin-Whitt regime: as the number of servers $n$ grows without a bound, the utilization approaches 1 from below at the rate $\Theta(1/\sqrt{n})$. Assuming that the service time distribution is…

Probability · Mathematics 2008-03-19 David Gamarnik , Petar Momcilovic

This paper addresses the analysis of the queue-length process of single-server queues under overdispersion, i.e., queues fed by an arrival process for which the variance of the number of arrivals in a given time window exceeds the…

Probability · Mathematics 2020-04-21 Onno Boxma , Mariska Heemskerk , Michel Mandjes

In this paper we study a non-stationary Markovian queueing model of a two-processor heterogeneous system with time-varying arrival and service rates. We obtain the bounds on the rate of convergence and find the main limiting characteristics…

Probability · Mathematics 2018-06-28 A. Zeifman , Y. Satin , K. Kiseleva , T. Panfilova , V. Korolev

The focus of this paper is on the asymptotics of large-time numbers of customers in time-periodic Markovian many-server queues with customer abandonment in heavy traffic. Limit theorems are obtained for the periodic number-of-customers…

Probability · Mathematics 2014-06-03 Anatolii A. Puhalskii

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

Inspired by the work of Atar and Miyazawa [1] (2026) as well as applications to energy-saving problems, we are interested in the heavy-traffic limit of the stationary queue length distribution, which is not addressed in [1]. In this paper,…

Probability · Mathematics 2026-04-13 Masahiro Kobayashi , Masakiyo Miyazawa , Yutaka Sakuma

We consider a GI/H/n queueing system. In this system, there are multiple servers in the queue. The inter-arrival time is general and independent, and the service time follows hyper-exponential distribution. Instead of stochastic…

Performance · Computer Science 2014-09-16 Yousi Zheng , Ness Shroff , Prasun Sinha

The paper studies closed queueing networks containing a server station and $k$ client stations. The server station is an infinite server queueing system, and client stations are single-server queueing systems with autonomous service, i.e.…

Probability · Mathematics 2008-01-24 Vyacheslav M. Abramov

Let $Q_{\lambda}(t,y) $ be the number of people present at time $t$ with $y$ units of remaining service time in an infinite server system with arrival rate equal to $\lambda>0$. In the presence of a non-lattice renewal arrival process and…

Probability · Mathematics 2012-07-24 J. Blanchet , X. Chen , H. Lam

In this paper, we analyze a two-queue random time-limited Markov modulated polling model. In the first part of the paper, we investigate the fluid version: Fluid arrives at the two queues as two independent flows with deterministic rate.…

Probability · Mathematics 2021-12-10 Stella Kapodistria , Mayank Saxena , Onno Boxma , Offer Kella

A many-server heavy-traffic FCLT is proved for the $G_t/M/s_t+\mathit {GI}$ queueing model, having time-varying arrival rate and staffing, a general arrival process satisfying a FCLT, exponential service times and customer abandonment…

Probability · Mathematics 2014-01-17 Yunan Liu , Ward Whitt

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

We consider a stochastic fluid queue served by a constant rate server and driven by a process which is the local time of a certain Markov process. Such a stochastic system can be used as a model in a priority service system, especially when…

Probability · Mathematics 2007-09-11 Takis Konstantopoulos , Andreas Kyprianou , Marina Sirvio , Paavo Salminen

A FORTRAN program to simulate the operation of infinite servers queues is presented in this work. Poisson arrivals processes are considered but not only. For many parameters of interest in queuing systems study or application, either there…

Performance · Computer Science 2021-10-20 Manuel Alberto M. Ferreira

This paper studies an infinite-server queue in a random environment, meaning that the arrival rate, the service requirements and the server work rate are modulated by a general c\`{a}dl\`{a}g stochastic background process. To prove a large…

Probability · Mathematics 2015-02-04 H. M. Jansen , M. R. H. Mandjes , K. De Turck , S. Wittevrongel
‹ Prev 1 2 3 10 Next ›