中文
相关论文

相关论文: Moderate deviations of many-server queues in the H…

200 篇论文

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…

概率论 · 数学 2007-12-28 Guodong Pang , Rishi Talreja , 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…

概率论 · 数学 2017-03-10 Masakiyo Miyazawa

We consider the Halfin-Whitt diffusion process $X_d(t)$, which is used, for example, as an approximation to the $m$-server $M/M/m$ queue. We use recently obtained integral representations for the transient density $p(x,t)$ of this diffusion…

概率论 · 数学 2015-05-06 Qiang Zhen , Charles Knessl

We consider the so-called GI/GI/N queue, in which a stream of jobs with independent and identically distributed service times arrive as a renewal process to a common queue that is served by $N$ identical parallel servers in a…

概率论 · 数学 2017-12-06 Reza Aghajani , Kavita Ramanan

A multi-class single-server queueing model with finite buffers, in which scheduling and admission of customers are subject to control, is studied in the moderate deviation heavy traffic regime. A risk-sensitive cost set over a finite time…

概率论 · 数学 2018-05-02 Rami Atar , Asaf Cohen

We consider the FCFS $\mathit{GI}/\mathit{GI}/n$ queue in the so-called Halfin-Whitt heavy traffic regime. We prove that under minor technical conditions the associated sequence of steady-state queue length distributions, normalized by…

概率论 · 数学 2013-12-04 David Gamarnik , David A. Goldberg

We consider queueing systems with n parallel queues under a Join the Shortest Queue (JSQ) policy in the Halfin-Whitt heavy traffic regime. We use the martingale method to prove that a scaled process counting the number of idle servers and…

概率论 · 数学 2015-09-22 Patrick Eschenfeldt , David Gamarnik

This paper studies a class of load balancing algorithms for many-server ($N$ servers) systems assuming finite buffer with size $b-1$ (i.e. a server can have at most one job in service and $b-1$ jobs in queue). We focus on steady-state…

概率论 · 数学 2018-04-10 Xin Liu , Lei Ying

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…

概率论 · 数学 2014-01-17 Yunan Liu , Ward Whitt

The Join-the-Shortest-Queue-d routing policy is considered for a large system with $n$ servers. Moderate deviation principles (MDP) for the occupancy process and the empirical queue length process are established as $n\to \infty$. Each MDP…

概率论 · 数学 2025-03-06 Zhenhua Wang , Ruoyu Wu

This paper studies the heavy-traffic (HT) behaviour of queueing networks with a single roving server. External customers arrive at the queues according to independent renewal processes and after completing service, a customer either leaves…

概率论 · 数学 2016-11-09 Marko Boon , Rob van der Mei , Erik Winands

In order to obtain Markov heavy-traffic approximations for infinite-server queues with general non-exponential service-time distributions and general arrival processes, possibly with time-varying arrival rates, we establish heavy-traffic…

概率论 · 数学 2010-07-13 Guodong Pang , Ward Whitt

A multiclass queueing system is considered, with heterogeneous service stations, each consisting of many servers with identical capabilities. An optimal control problem is formulated, where the control corresponds to scheduling and routing,…

概率论 · 数学 2007-05-23 Rami Atar

We study a dynamic scheduling problem for a multi-class queueing network with a large pool of statistically identical servers. The arrival processes are Poisson, and service times and patience times are assumed to be exponentially…

概率论 · 数学 2015-10-30 Ari Arapostathis , Anup Biswas , Guodong Pang

The Join-the-Shortest Queue (JSQ) policy is a classical benchmark for the performance of many-server queueing systems due to its strong optimality properties. While the exact analysis of the JSQ policy is an open question to date, even…

概率论 · 数学 2025-05-27 Zhisheng Zhao , Sayan Banerjee , Debankur Mukherjee

We consider a stochastic network with mobile users in a heavy-traffic regime. We derive the scaling limit of the multi-dimensional queue length process and prove a form of spatial state space collapse. The proof exploits a recent result by…

概率论 · 数学 2013-05-24 Sem Borst , Florian Simatos

Many networking-related settings can be modeled by Markov-modulated infinite-server systems. In such models, the customers' arrival rates and service rates are modulated by a Markovian background process, additionally, there are infinitely…

概率论 · 数学 2016-08-16 Joke Blom , Koen De Turck , Michel Mandjes

Moderate deviation principle is achieved by the weak convergence approach for a stochastic Schr\"odinger type equation with linear drift term and noise driven by a $Q$-Wiener process. The central limit theorem is also shown for the equation…

概率论 · 数学 2024-09-27 Parisa Fatheddin , Hannelore Lisei

We study multiclass many-server queues for which the arrival, service and abandonment rates are all modulated by a common finite-state Markov process. We assume that the system operates in the "averaged" Halfin-Whitt regime, which means…

概率论 · 数学 2019-07-15 Ari Arapostathis , Anirban Das , Guodong Pang , Yi Zheng

We study a single server FIFO queue that offers general service. Each of n customers enter the queue at random time epochs that are inde- pendent and identically distributed. We call this the random scattering traffic model, and the…

概率论 · 数学 2017-08-21 Peter W. Glynn , Harsha Honnappa