Related papers: Exclusive Queueing Processes and their Application…
In this paper, we provide a review on the kernel method, which is one of the options for characterizing so-called exact tail asymptotic properties in stationary probabilities of two-dimensional random walks, discrete or continuous (or…
In this paper, by the singular-perturbation technique, we investigate the heavy-traffic behavior of a priority polling system consisting of three M/M/1 queues with threshold policy. It turns out that the scaled queue-length of the…
Recently, it was shown that spatial correlations may have a drastic effect on the dynamics of real-space condensates in driven mass-transport systems: in models with a spatially correlated steady state, the condensate is quite generically…
The discrete-time version of totally asymmetric simple-exclusion process (TASEP) on a finite one-dimensional lattice is studied with the periodic boundary condition. Each particle at a site hops to the next site with probability $0 \leq p…
Properties of the one-dimensional totally asymmetric simple exclusion process (TASEP), and their connection with the dynamical scaling of moving interfaces described by a Kardar-Parisi-Zhang (KPZ) equation are investigated. With periodic…
This paper examines a discrete-time queuing system with applications to telecommunications traffic. The arrival process is a particular Markov modulated process which belongs to the class of discrete batched Markovian arrival processes. The…
Statistical mechanics of a disordered system of cars on a single-lane road is developed. Behaviour of cars is defined by conditional probability of car velocity depending on the distance and velocity of the car ahead. A system consisting of…
This paper introduces a novel approach employing extreme value theory to analyze queue lengths within a corridor controlled by adaptive controllers. We consider the maximum queue lengths of a signalized corridor consisting of nine…
Generalization of the one-dimensional totally asymmetric exclusion process (TASEP) with open boundary conditions in which particles are allowed to jump $l$ sites ahead with the probability $p_l\sim 1/l^{\sigma+1}$ is studied by Monte Carlo…
As the simplest model of transport of interacting particles in a disordered medium, we consider the asymmetric simple exclusion process (ASEP) in which particles with hard-core interactions perform biased random walks, on the supercritical…
We introduce a fractional generalization of the Erlang Queues $M/E_k/1$. Such process is obtained through a time-change via inverse stable subordinator of the classical queue process. We first exploit the (fractional) Kolmogorov forward…
The totally asymmetric simple exclusion principle (TASEP) is a fundamental model in nonequilibrium statistical mechanics. It describes the stochastic unidirectional movement of particles along a 1D chain of ordered sites. We consider the…
Congestion and extreme events in transportation networks are emergent phenomena with significant socio-economic implications. In this work, we study congestion and extreme event properties on real urban street (planar) networks drawn from…
Queueing networks are systems of theoretical interest that find widespread use in the performance evaluation of interconnected resources. In comparison to counterpart models in genetics or mathematical biology, the stochastic (jump)…
We revisit the totally asymmetric simple exclusion process with open boundaries (TASEP), focussing on the recent discovery by de Gier and Essler that the model has a dynamical transition along a nontrivial line in the phase diagram. This…
Understanding queuing dynamics of TCP is important for correct router buffer sizing as well as for optimizing the performance of the TCP protocol itself. However, modeling of buffer content dynamics under TCP has received relatively little…
We consider multi-component matching systems in heavy traffic consisting of $K\geq 2$ distinct perishable components which arrive randomly over time at high speed at the assemble-to-order station, and they wait in their respective queues…
These days enterprise applications try to integrate online processing and batch jobs into a common software stack for seamless monitoring and driverless operations. Continuous integration of these systems results in choking of the poorly…
A typical polling system consists of a number of queues, attended by a single server in a fixed order. The vast majority of papers on polling systems focusses on Poisson arrivals, whereas very few results are available for general arrivals.…
A FORTRAN program to simulate the operation of infinite servers queues is presented in this work. Poisson arrivals processes are considered but not only. For many parameters of interest in queuing systems study or application, either there…