Related papers: Double-End Queues with Non-Poisson Inputs and Thei…
Inspired by quantum switches, we consider a discrete-time multi-way matching system with two classes of arrivals: requests for entangled pair of qubits between two nodes, and qubits from each node that can be used to serve the requests. An…
In this work, we focus on the stationary analysis of a specific class of continuous time Markov-modulated reflected random walks in the quarter plane with applications in the modelling of two-node Markov-modulated queueing networks with…
Using efficient point-to-point communication channels is critical for implementing fine grained parallel program on modern shared cache multi-core architectures. This report discusses in detail several implementations of wait-free…
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…
Motivated by the increasing popularity of learning and predicting human user behavior in communication and computing systems, in this paper, we investigate the fundamental benefit of predictive scheduling, i.e., predicting and pre-serving…
In this paper, we consider queueing systems where the dynamics are non-stationary and state-dependent. For performance analysis of these systems, fluid and diffusion models have been typically used. Although they are proven to be…
The Multi-class Queueing Network (McQN) arises as a natural multi-class extension of the traditional (single-class) Jackson network. In a single-class network subcriticality (i.e. subunitary nominal workload at every station) entails…
The Markovian arrival process (MAP) has proven a versatile model for fitting dependent and non-exponential interarrival times, with a number of applications to queueing, teletraffic, reliability or finance. Despite theoretical properties of…
We consider a novel, analytical queuing model for vehicle coordination at signal-free intersections. Vehicles arrive at an intersection according to Poisson processes, and the crossing times are constants dependent of vehicle types. We use…
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…
The efficient management of large-scale queueing networks is critical for a variety of sectors, including healthcare, logistics, and customer service, where system performance has profound implications for operational effectiveness and cost…
We consider a stochastic queueing system modelling the behaviour of a wireless network with nodes employing a discrete-time version of the standard decentralised medium access algorithm. The system is {\em unsaturated} -- each node receives…
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…
We analyze a boarding solution for a transport system in which the number of passengers allowed to enter a transport cabin is automatically controlled. Expressions charac- terizing the stochastic properties of the passenger queue length,…
We use multidimensional diffusion processes to approximate the dynamics of a queue served by many parallel servers. The queue is served in the first-in-first-out (FIFO) order and the customers waiting in queue may abandon the system without…
We study a queueing system with Poisson arrivals on a bus line indexed by integers. The buses move at constant speed to the right and the time of service per customer getting on the bus is fixed. The customers arriving at station i wait for…
We consider a point process $i+\xi_i$, where $i\in \bZ$ and the $\xi_{i}$'s are i.i.d. random variables with variance $\sigma^{2}$. This process, with a suitable rescaling of the distribution of $\xi_i$'s, converges to the Poisson process…
In this paper we analyze an $M/M/1$ queueing system with an arbitrary number of customer classes, with class-dependent exponential service rates and preemptive priorities between classes. The queuing system can be described by a…
We consider a system with N unit-service-rate queues in tandem, with exogenous arrivals of rate lambda at queue 1, under a back-pressure (MaxWeight) algorithm: service at queue n is blocked unless its queue length is greater than that of…
We consider queueing output processes of some elementary queueing models such as the M/M/1/K queue and the M/G/1 queue. An important performance measure for these counting processes is their variance curve, indicating the variance of the…