Related papers: Queueing systems with pre-scheduled random arrival…
Polling systems are a well-established subject in queueing theory. However, their formal treatments generally rely heavily on relatively sophisticated theoretical tools, such as moment generating functions and Laplace transforms, and…
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 consider a polling system: a queueing system of $N\ge 1$ queues with Poisson arrivals $Q_1,...,Q_N$ visited in a cyclic order (with or without switchover times) by a single server. For this system we derive the probability generating…
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…
It's a situation everyone dreads. A road is down to one lane for repairs. Traffic is let through one way until the backlog clears and then traffic is let through the other way to clear that backlog and so on. When stuck in a very long queue…
This paper approaches the application of the waiting model with Poisson inputs and priorities in the port activity. The arrival of ships in the maritime terminal is numerically modelled, and specific parameters for the distribution…
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…
We study systems of particles on a line which have a maximum, are locally finite and evolve with independent increments. ``Quasi-stationary states'' are defined as probability measures, on the \sigma-algebra generated by the gap variables,…
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…
Properties of arrival times are studied for a Cox process with independent (and stationary) increments. Under a reasonable setting the directing random measure is shown to take over independent (and stationary) increments of the process,…
We consider a service system where agents are invited on-demand. Customers arrive exogenously as a Poisson process and join a customer queue upon arrival if no agent is available. Agents decide to accept or decline invitations after some…
In this paper we prove the Poisson Hypothesis for the limiting behavior of the large queueing systems in some simple ("mean-field") cases. We show in particular that the corresponding dynamical systems, defined by the non-linear Markov…
We study the rare event behavior of the workload process in a transitory queue, where the arrival epochs (or points) of a finite number of jobs are assumed to be the ordered statistics of independent and identically distributed (i.i.d.)…
Queuing systems with an unlimited number of devices with an incoming nonstationary Poisson flow and a random flow controlled by a Markov chain are investigated. The inexpediency of ap-proximation of the birth process by Poisson flows in…
In this paper we study a two-queue polling model with zero switch-over times and $k$-limited service (serve at most $k_i$ customers during one visit period to queue $i$, $i=1,2$) in each queue. The arrival processes at the two queues are…
We introduce the first class of perfect sampling algorithms for the steady-state distribution of multi-server queues with general interarrival time and service time distributions. Our algorithm is built on the classical dominated coupling…
The paper deals with a certain class of random evolutions. We develop a construction that yields an invariant measure for a continuous-time Markov process with random transitions. The approach is based on a particular way of constructing…
Queueing networks are typically modelled assuming that the arrival process is exogenous, and unaffected by admission control, scheduling policies, etc. In many situations, however, users choose the time of their arrival strategically,…
In this paper we investigate Gaussian queues in the light-traffic and in the heavy-traffic regime. The setting considered is that of a centered Gaussian process $X\equiv\{X(t):t\in\mathbb R\}$ with stationary increments and variance…
We describe all countable particle systems on $\mathbb{R}$ which have the following three properties: independence, Gaussianity and stationarity. More precisely, we consider particles on the real line starting at the points of a Poisson…