English
Related papers

Related papers: Stability and busy periods in a multiclass queue w…

200 papers

This paper considers a parallel system of queues fed by independent arrival streams, where the service rate of each queue depends on the number of customers in all of the queues. Necessary and sufficient conditions for the stability of the…

Probability · Mathematics 2010-01-12 Sem Borst , Matthieu Jonckheere , Lasse Leskelä

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

Probability · Mathematics 2014-08-04 Marko Boon , Rob van der Mei , Erik Winands

We study a many-server queuing system with general service time distribution and state dependent service rates. The dynamics of the system are modeled using measure valued processes which keep track of the residual service times. Under…

Probability · Mathematics 2013-04-09 Anup Biswas

In this paper, we present a condition to obtain instability for a class of queueing networks where the arrival rates in each server are constant and the departure rate in each server is a decreasing function of the queue lengths of other…

Probability · Mathematics 2023-08-01 Pierre Popineau , Seva Shneer

We introduce a novel single-server queue with general retrial times and event-dependent arrivals. This is a versatile model for the study of service systems, in which the server needs a non-negligible time to retrieve waiting customers upon…

Probability · Mathematics 2022-03-08 Ioannis Dimitriou

Motivated by applications that involve setting proper staffing levels for multi-server queueing systems with batch arrivals, we present a thorough study of the queue-length process $\{Q(t); t \geq 0\}$, departure process $\{D(t); t \geq…

Probability · Mathematics 2022-06-20 Andrew Daw , Brian Fralix , Jamol Pender

In this paper, we study Markov-dependent reflected autoregressive processes, and other related models the analysis of which results in a vector-valued fixed-point functional equation of a certain type. In queueing terms, such processes…

Probability · Mathematics 2025-06-23 Ioannis Dimitriou

Recent development of peer-to-peer (P2P) services (e.g. streaming, file sharing, and storage) systems introduces a new type of queue systems that receive little attention before, where both job and server arrive and depart randomly. Current…

Performance · Computer Science 2016-05-11 Taoyu Li , Minghua Chen , Tony Lee , Xing Li

In this paper, we consider a L\'evy-driven fluid queueing system where the server may subject to breakdowns and repairs. In addition, the server will leave for a vacation each time when he finds an empty system. We cast the queueing process…

Probability · Mathematics 2015-06-16 Jinbiao Wu , Zaiming Liu , Yi Peng

We study a system, where a random flow of customers is served by servers (called agents) invited on-demand. Each invited agent arrives into the system after a random time; after each service completion, an agent returns to the system or…

Probability · Mathematics 2017-11-28 Lam M. Nguyen , Alexander Stolyar

We focus on a particular connection between queueing and risk models in a multi-dimensional setting. We first consider the joint workload process in a queueing model with parallel queues and simultaneous arrivals at the queues. For the case…

Probability · Mathematics 2015-08-05 E. S. Badila , O. J. Boxma , J. A. C. Resing , E. M. M. Winands

We consider a heterogeneous queueing system consisting of one large pool of $O(r)$ identical servers, where $r\to\infty$ is the scaling parameter. The arriving customers belong to one of several classes which determines the service times in…

Probability · Mathematics 2011-05-04 David Gamarnik , Alexander Stolyar

We consider the $N$-model queueing system with a waiting time dependent threshold on the diagonal: the service discipline is First--Come--First--Served, but type-1 jobs can only be served by server 2 if their waiting time exceeds a…

Probability · Mathematics 2025-11-17 Sanne van Kempen , Elene Anton , Fiona Sloothaak

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

A many-server queueing system is considered in which customers arrive according to a renewal process and have service and patience times that are drawn from two independent sequences of independent, identically distributed random variables.…

Probability · Mathematics 2012-04-30 Weining Kang , Kavita Ramanan

In this paper, we characterize the stability region of multi-queue multi-server (MQMS) queueing systems with stationary channel and packet arrival processes. Toward this, the necessary and sufficient conditions for the stability of the…

Information Theory · Computer Science 2015-03-19 Hassan Halabian , Ioannis Lambadaris , Chung-Horng Lung

We investigate the long-run behavior of single-server queues with Hawkes arrivals and general service distributions and related optimization problems. In detail, utilizing novel coupling techniques, we establish finite moment bounds for the…

Probability · Mathematics 2023-11-14 Xinyun Chen , Guiyu Hong

This paper proposes a stochastic framework to evaluate the performance of public transit systems under short random service suspensions. We aim to derive closed-form formulations of the mean and variance of the queue length and waiting…

Probability · Mathematics 2023-01-04 Baichuan Mo , Li Jin , Haris N. Koutsopoulos , Zuo-Jun Max Shen , Jinhua Zhao

In this paper, we consider the M/GI/1 queue with single vacations under the gated service discipline. We obtain the probability generating function of the stationary queue length, the Laplace-Stieltjes transform of the system delay…

Probability · Mathematics 2026-04-14 Tetsuya Takine

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
‹ Prev 1 2 3 10 Next ›