Related papers: Exclusive Queueing Processes and their Application…
We introduce a new model to study the oscillations of opposite flows sharing a common bottleneck and moving on two Totally Asymmetric Simple Exclusion Process (TASEP) lanes. We provide a theoretical analysis of the phase diagram, valid when…
Interaction between vehicles and pedestrians is seen in many areas such as crosswalks and intersections. In this paper, we study a totally asymmetric simple exclusion process with a bottleneck at a boundary caused by an interaction. Due to…
The non-stationary Erlang-A queue is a fundamental queueing model that is used to describe the dynamic behavior of large scale multi-server service systems that may experience customer abandonments, such as call centers, hospitals, and…
We are concerned with an $M/M$-type join the shortest queue ($M/M$-JSQ for short) with $k$ parallel queues for an arbitrary positive integer $k$, where the servers may be heterogeneous. We are interested in the tail asymptotic of the…
We study the totally asymmetric simple exclusion process (TASEP) on complex networks, as a paradigmatic model for transport subject to excluded volume interactions. Building on TASEP phenomenology on a single segment and borrowing ideas…
The totally asymmetric simple exclusion process (TASEP) is a well studied example of far-from-equilibrium dynamics. Here, we consider a TASEP with open boundaries but impose a global constraint on the total number of particles. In other…
The totally asymmetric simple exclusion process (TASEP) is a basic model of statistical mechanics that has found numerous applications. We consider the case of TASEP with a finite chain where particles may enter from the left and leave to…
We consider the asymmetric simple exclusion process (TASEP) on open network consisting of three consecutively coupled macroscopic chain segments with a shortcut between the tail of the first segment and the head of the third one. The model…
This work is concerned with the excited state quantum phase transitions (ESQPTs) defined in Ann.Phys. 323, 1106 (2008). In many-body models that exhibit such transitions, the ground state quantum phase transition (QPT) occurs in parallel…
We introduce the prioritising exclusion process, a stochastic scheduling mechanism for a priority queueing system in which high priority customers gain advantage by overtaking low priority customers. The model is analogous to a totally…
In an accelerated exclusion process (AEP), each particle can "hop" to its adjacent site if empty as well as "kick" the frontmost particle when joining a cluster of size $\ell \leq \ell_\text{max}$. With various choices of the interaction…
In TCEs (Temporary Crowded Events), for example, music festivals, users are faced with problems accessing the Internet. TCEs are limited time events with a high concentration of people moving within the event enclosure while accessing the…
Max-algebra models of tandem single-server queueing systems with both finite and infinite buffers are developed. The dynamics of each system is described by a linear vector state equation similar to those in the conventional linear systems…
Quantum walks are standard tools for searching graphs for marked vertices, and they often yield quadratic speedups over a classical random walk's hitting time. In some exceptional cases, however, the system only evolves by sign flips,…
We propose and study a one-dimensional (1D) model consisting of two lanes with open boundaries. One of the lanes executes diffusive and the other lane driven unidirectional or asymmetric exclusion dynamics, which are mutually coupled…
We report here results on the study of the totally asymmetric simple exclusion processes (TASEP), defined on an open network, consisting of head and tail simple chain segments with a double-chain section inserted in-between. Results of…
This paper addresses the analysis of the queue-length process of single-server queues under overdispersion, i.e., queues fed by an arrival process for which the variance of the number of arrivals in a given time window exceeds the…
We introduce a framework and develop a theory of transitory queueing models. These are models that are not only non-stationary and time-varying but also have other features such as the queueing system operates over finite time, or only a…
Packet traffic in complex networks undergoes the jamming transition from free-flow to congested state as the number of packets in the system increases. Here we study such jamming transition when queues are operated by the priority queuing…
We introduce a QPLEX Decision Process (QDP) as a model for dynamic control of queueing systems with non-stationary arrivals, general service distributions, and service-level chance constraints. QDPs integrate QPLEX, a computational modeling…