English
Related papers

Related papers: Two-parameter Sample Path Large Deviations for Inf…

200 papers

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

A Large Deviation Principle (LDP) is established for the stationary distribution of the number of customers in a many--server queue in heavy traffic for a moderate deviation scaling akin to the Halfin--Whitt regime. The interarrival and…

Probability · Mathematics 2025-12-17 Anatolii A. Puhalskii

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…

Probability · Mathematics 2010-07-13 Guodong Pang , Ward Whitt

A parallel server system with $n$ identical servers is considered. The service time distribution has a finite mean $1/\mu$, but otherwise is arbitrary. Arriving customers are be routed to one of the servers immediately upon arrival.…

Probability · Mathematics 2017-02-15 Sergey Foss , Alexander Stolyar

In this paper, we study the stability of light traffic achieved by a scheduling algorithm which is suitable for heterogeneous traffic networks. Since analyzing a scheduling algorithm is intractable using the conventional mathematical tool,…

Networking and Internet Architecture · Computer Science 2016-04-07 Rukhsana Ruby , Victor C. M. Leung

The Join-the-Shortest-Queue routing policy is studied in an asymptotic regime where the number of processors $n$ scales with the arrival rate. A large deviation principle (LDP) for the occupancy process is established, as $n\to \infty$, in…

Probability · Mathematics 2025-08-12 Amarjit Budhiraja , Eric Friedlander , Ruoyu Wu

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

We consider an acyclic network of single-server queues with heterogeneous processing rates. It is assumed that each queue is fed by the superposition of a large number of i.i.d. Gaussian processes with stationary increments and positive…

Probability · Mathematics 2020-09-01 Martin Zubeldia , Michel Mandjes

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

This paper considers Gaussian flows multiplexed in a queueing network. A single node being a useful but often incomplete setting, we examine more advanced models. We focus on a (two-node) tandem queue, fed by a large number of Gaussian…

Probability · Mathematics 2007-05-23 Michel Mandjes , Miranda van Uitert

This paper studies statistical inference in a network of infinite-server queues, with the aim of estimating the underlying parameters (routing matrix, arrival rates, parameters pertaining to the service times) using observations of the…

Probability · Mathematics 2025-06-10 Hritika Gupta , Michel Mandjes , Liron Ravner , Jiesen Wang

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 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 join-the-shortest-queue model which is as follows. There are $K$ single FIFO servers and $M$ arrival processes. The customers from a given arrival process can be served only by servers from a certain subset of all servers. The…

Probability · Mathematics 2007-05-23 Anatolii A. Puhalskii , Alexander A. Vladimirov

We consider an infinite-server queue into which customers arrive according to a Cox process and have independent service times with a general distribution. We prove a functional large deviations principle for the equilibrium queue length…

Probability · Mathematics 2020-03-30 Justin Dean , Ayalvadi Ganesh , Edward Crane

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

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

This paper considers a network of infinite-server queues with the special feature that, triggered by specific events, the network population vector may undergo a linear transformation (a `multiplicative transition'). For this model we…

Probability · Mathematics 2017-11-15 Dieter Fiems , Michel Mandjes , Brendan Patch

In this paper, a many-sources large deviations principle (LDP) for the transient workload of a multi-queue single-server system is established where the service rates are chosen from a compact, convex and coordinate-convex rate region and…

Probability · Mathematics 2009-02-27 Vijay G. Subramanian , Tara Javidi , Somsak Kittipiyakul

In this paper we consider the problem of maximum throughput for tandem queueing system. We modeled this system as a Quasi-Birth-Death process. In order to do this we named level the number of customers waiting in the first buffer (including…

Performance · Computer Science 2015-12-21 Daniel Marian Merezeanu , Daniela Andone
‹ Prev 1 2 3 10 Next ›