Related papers: Exclusion in a priority queue
We consider a Markovian single server queue in which customers are preemptively scheduled by exogenously assigned priority levels. The novelty in our model is that the priority levels are randomly assigned from a continuous probability…
The exclusive queueing process (EQP) incorporates the exclusion principle into classic queueing models. It can be interpreted as an exclusion process of variable system length. Here we extend previous studies of its phase diagram by…
We consider a one-dimensional stochastic reaction-diffusion generalizing the totally asymmetric simple exclusion process, and aiming at describing single lane roads with vehicles that can change speed. To each particle is associated a jump…
In traditional priority queues, we assume that every customer upon arrival has a fixed, class-dependent priority, and that a customer may not commence service if a customer with a higher priority is present in the queue. However, in…
We study the dynamical evolution toward steady state of the stochastic non-equilibrium model known as totally asymmetric simple exclusion process, in both uniform and non-uniform (staggered) one-dimensional systems with open boundaries.…
Stochastic driven flow along a channel can be modeled by the asymmetric simple exclusion process. We confirm numerically the presence of a dynamic queuing phase transition at a nonzero obstruction strength, and establish its scaling…
This paper proposes a totally asymmetric simple exclusion process on a traveling lane, which is equipped with a queueing system and functions of site assignments along the parking lane. In the proposed system, new particles arrive at the…
We introduce an extension of the M/M/1 queueing process with a spatial structure and excluded- volume effect. The rule of particle hopping is the same as for the totally asymmetric simple exclusion process (TASEP). A stationary-state…
We have introduced excluded volume effect, which is an important factor to model a realistic pedestrian queue, into queueing theory. The probability distributions of pedestrian number and pedestrian waiting time in a queue have been…
In this paper we consider a single-server cyclic polling system. Between visits to successive queues, the server is delayed by a random switch-over time. The order in which customers are served in each queue is determined by a priority…
Motivated by the operational problems in click and collect systems, such as curbside pickup programs, we study a joint admission control and capacity allocation problem. We consider a system where arriving customers have preferred service…
The slow-to-start mechanism is known to play an important role in the particular shape of the Fundamental diagram of traffic and to be associated to hysteresis effects of traffic flow.We study this question in the context of exclusion and…
We study a simple rate control scheme for a multiclass queuing network for which customers are partitioned into distinct flows that are queued separately at each station. The control scheme discards customers that arrive to the network…
Priority queues are fundamental abstract data structures, often used to manage limited resources in parallel programming. Several proposed parallel priority queue implementations are based on skiplists, harnessing the potential for…
We study a double-ended queue which consists of two classes of customers. Whenever there is a pair of customers from both classes, they are matched and leave the system immediately. The matching follows first-come-first-serve principle. If…
In a recent study [C Arita, Phys. Rev. E 80, 051119 (2009)], an extension of the M/M/1 queueing process with the excluded-volume effect as in the totally asymmetric simple exclusion process (TASEP) was introduced. In this paper, we consider…
In this paper we consider a single-server polling system with switch-over times. We introduce a new service discipline, mixed gated/exhaustive service, that can be used for queues with two types of customers: high and low priority…
We study infinite-server queues in which the arrival process is a Cox process (or doubly stochastic Poisson process), of which the arrival rate is given by shot noise. A shot-noise rate emerges as a natural model, if the arrival rate tends…
We provide the first analytical expressions for the expected waiting time of high-priority customers in the delayed APQ by exploiting a classical conservation law for work-conserving queues. Additionally, we describe an algorithm to compute…
The exclusive queueing process (EQP) has recently been introduced as a model for the dynamics of queues which takes into account the spatial structure of the queue. It can be interpreted as a totally asymmetric exclusion process of varying…