English
Related papers

Related papers: A Two-Queue Polling Model with Two Priority Levels…

200 papers

This paper studies a diffusion model that arises as the limit of a queueing system scheduling problem in the asymptotic heavy traffic regime of Halfin and Whitt. The queueing system consists of several customer classes and many servers…

Probability · Mathematics 2007-05-23 Rami Atar

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 studies an infinite buffer single server queueing model with exponentially distributed service times and negative arrivals. The ordinary (positive) customers arrive in batches of random size according to renewal arrival process,…

Probability · Mathematics 2023-01-13 U. C. Gupta , Nitin Kumar , F. P. Barbhuiya

Amid unprecedented times caused by COVID-19, healthcare systems all over the world are strained to the limits of, or even beyond, capacity. A similar event is experienced by some healthcare systems regularly, due to for instance seasonal…

Performance · Computer Science 2020-04-30 Binyamin Oz , Seva Shneer , Ilze Ziedins

In the infinite servers queue with Poisson arrivals real life practical applications, the busy period and the busy cycle probabilistic study is of main importance. But it is a very difficult task. In this text, we show that by solving a…

Probability · Mathematics 2022-04-05 Manuel Alberto M. Ferreira

We consider a queue to which only a finite pool of $n$ customers can arrive, at times depending on their service requirement. A customer with stochastic service requirement $S$ arrives to the queue after an exponentially distributed time…

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

This work studies queues in a Euclidean space. Consider $N$ servers that are distributed uniformly in $[0,1]^d$. Customers arrive at the servers according to independent stationary processes. Upon arrival, they probabilistically decide…

Probability · Mathematics 2024-09-05 B. R. Vinay Kumar , Lasse Leskelä

Two independent Poisson streams of jobs flow into a single-server service system having a limited common buffer that can hold at most one job. If a type-i job (i=1,2) finds the server busy, it is blocked and routed to a separate type-i…

Discrete Mathematics · Computer Science 2012-06-26 Konstantin Avrachenkov , Philippe Nain , Uri Yechiali

Queuing models provide insight into the temporal inhomogeneity of human dynamics, characterized by the broad distribution of waiting times of individuals performing tasks. We study the queuing model of an agent trying to execute a task of…

Physics and Society · Physics 2012-06-05 Hang-Hyun Jo , Raj Kumar Pan , Kimmo Kaski

A key operational challenge for call centers is to decide, in real time, which waiting customer should be served by which available agent. This is known as skill-based routing, and the decision becomes especially difficult in large systems…

Systems and Control · Electrical Eng. & Systems 2026-05-12 Baris Ata , Ebru Kasikaralar

The paper studies a multiserver retrial queueing system with $m$ servers. Arrival process is a point process with strictly stationary and ergodic increments. A customer arriving to the system occupies one of the free servers. If upon…

Probability · Mathematics 2021-07-01 Vyacheslav M. Abramov

In this thesis, we study the optimal tradeoff of average delay, average service cost, and average utility for single server queueing models, with and without admission control. The continuous time and discrete time queueing models that we…

Performance · Computer Science 2015-03-24 Vineeth Bala Sukumaran

We consider the processor sharing $M/M/1$-PS queue which also models balking. A customer that arrives and sees $n$ others in the system "balks" (i.e., decides not to enter) with probability $1-b_n$. If $b_n$ is inversely proportional to…

Probability · Mathematics 2011-04-26 Qiang Zhen , Johan S. H. van Leeuwaarden , Charles Knessl

The problems arising when the moments of service time distributions, for which the MGinf queue system busy period and busy cycle become very easy to study, are presented and it is shown how to overcome them. The busy cycle renewal function…

Probability · Mathematics 2021-10-08 Manuel Alberto M. Ferreira

This paper studies a scheduling control problem for a single-server multiclass queueing network in heavy traffic, operating in a changing environment. The changing environment is modeled as a finite state Markov process that modulates the…

Probability · Mathematics 2012-11-30 Amarjit Budhiraja , Arka Ghosh , Xin Liu

Use-case-specific network slicing in decentralized multi-tenancy cloud environments is a promising approach to bridge the gap between the demand and supply of resources in next-generation communication networks. Our findings associate…

Networking and Internet Architecture · Computer Science 2024-05-20 Anthony Kiggundu , Bin Han , Dennis Krummacker , Hans D. Schotten

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

Strategic customer behavior is strongly influenced by the level of information that is provided to customers. Hence, to optimize the design of queueing systems, many studies consider various versions of the same service model and compare…

Optimization and Control · Mathematics 2019-06-14 Yiannis Dimitrakopoulos , Antonis Economou , Stefanos Leonardos

During the last decade bike sharing systems have emerged as a public transport mode in urban short trips in more than 500 major cities around the world. For the mobility service mode, many challenges from its operations are not well…

Performance · Computer Science 2016-06-16 Quan-Lin Li , Rui-Na Fan , Jing-Yu Ma

We model a long queue of humans by a continuous-space model in which, when a customer moves forward, they stop a random distance behind the previous customer, but do not move at all if their distance behind the previous customer is below a…

Probability · Mathematics 2015-11-18 David Aldous