English
Related papers

Related papers: Gated Infinite Server Queues in Light Traffic

200 papers

We consider an M/M/Infinity service system in which an arriving customer is served by the first idle server in an infinite sequence S_1, S_2, ... of servers. We determine the first two terms in the asymptotic expansions of the moments of L…

Probability · Mathematics 2011-07-11 Patrick Eschenfeldt , Ben Gross , Nicholas Pippenger

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

This note describes several open questions concerning scaling limits of queue-length processes of symmetric queues in heavy traffic, distinguishing between service-time distributions with finite and infinite variance.

Probability · Mathematics 2022-02-08 Bert Zwart

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

In this paper, we consider a $G_t/G_t/\infty$ infinite server queueing model in a random environment. More specifically, the arrival rate in our server is modeled as a highly fluctuating stochastic process, which arguably takes into account…

Probability · Mathematics 2020-04-13 Harsha Honnappa , Yiran Liu , Samy Tindel , Aaron Yip

We study a queueing network with a single shared server, that serves the queues in a cyclic order according to the gated service discipline. External customers arrive at the queues according to independent Poisson processes. After…

Probability · Mathematics 2014-09-11 Marko Boon , Rob van der Mei , Erik Winands

We consider GI/Ph/n+M parallel-server systems with a renewal arrival process, a phase-type service time distribution, n homogenous servers, and an exponential patience time distribution with positive rate. We show that in the Halfin-Whitt…

Probability · Mathematics 2014-01-14 J. G. Dai , A. B. Dieker , Xuefeng Gao

We consider an $M/G/\infty$ queue with infinite expected service time. We then provide the transience/recurrence classification of the states (the system is said to be at state $n$ if there are $n$ customers being served), observing also…

Probability · Mathematics 2024-07-12 Serguei Popov

This paper studies the limiting behavior of a closed queueing network with multiple single-server and infinite-server stations. Under a heavy traffic asymptotic regime$\unicode{x2014}$where the number of jobs and single-server service rates…

Probability · Mathematics 2026-03-13 Amir A. Alwan , Barış Ata

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

In this paper continuity theorems are established for the number of losses during a busy period of the $M/M/1/n$ queue. We consider an $M/GI/1/n$ queueing system where the service time probability distribution, slightly different in a…

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

We consider a single server queue that serves a finite population of $n$ customers that will enter the queue (require service) only once, also known as the $\Delta_{(i)}/G/1$ queue. This paper presents a method for analyzing heavy-traffic…

Probability · Mathematics 2015-12-01 Gianmarco Bet , Remco van der Hofstad , Johan S. H. van Leeuwaarden

This work considers a many-server queueing system in which customers with i.i.d., generally distributed service times enter service in the order of arrival. The dynamics of the system is represented in terms of a process that describes the…

Probability · Mathematics 2007-08-08 Haya Kaspi , Kavita Ramanan

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

We study a sequence of single server queues with customer abandonment (GI/GI/1+GI) under heavy traffic. The patience time distributions vary with the sequence, which allows for a wider scope of applications. It is known ([20, 18]) that the…

Probability · Mathematics 2021-02-10 Chihoon Lee , Amy R. Ward , Heng-Qing Ye

In this paper, we present a functional fluid limit theorem and a functional central limit theorem for a queue with an infinity of servers M/GI/$\infty$. The system is represented by a point-measure valued process keeping track of the…

Probability · Mathematics 2009-09-29 Laurent Decreusefond , Pascal Moyal

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 investigate Gaussian queues in the light-traffic and in the heavy-traffic regime. The setting considered is that of a centered Gaussian process $X\equiv\{X(t):t\in\mathbb R\}$ with stationary increments and variance…

Probability · Mathematics 2012-06-07 Krzysztof Debicki , Kamil Marcin Kosinski , Michel Mandjes

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

This paper studies the asymptotic behavior of the steady-state waiting time, W_infty, of the M/G/1 queue with subexponenential processing times for different combinations of traffic intensities and overflow levels. In particular, we provide…

Probability · Mathematics 2011-03-22 Mariana Olvera-Cravioto , Peter W. Glynn
‹ Prev 1 2 3 10 Next ›