相关论文: Zero-automatic queues and product form
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 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…
Stochastic reaction networks are dynamical models of biochemical reaction systems and form a particular class of continuous-time Markov chains on $\mathbb{N}^n$. Here we provide a fundamental characterisation that connects structural…
We consider in this paper a non work-conserving Generalized Processor Sharing (GPS) system composed of two queues with Poisson arrivals and exponential service times. Using general results due to Fayolle \emph{et al}, we first establish the…
Retrial phenomenon naturally arises in various systems such as call centers, cellular networks and random access protocols in local area networks. This paper gives a comprehensive survey on theory and applications of retrial queues in these…
We study automatic sequences and automatic systems generated by general constant length (nonprimitive) substitutions. While an automatic system is typically uncountable, the set of automatic sequences is countable, implying that most…
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…
A generalized zero-range process with a limited number of long-range interactions is studied as an example of a transport process in which particles at a T-junction make a choice of which branch to take based on traffic levels on each…
Closed queuing networks with finite capacity buffers and skip-over policies are fundamental models in the performance evaluation of computer and communication systems. This technical report presents the details of computational algorithms…
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…
There are $n$ queues, each with a single server. Customers arrive in a Poisson process at rate $\lambda n$, where $0<\lambda<1$. Upon arrival each customer selects $d\geq2$ servers uniformly at random, and joins the queue at a least-loaded…
In this paper, we consider discrete-time D-BMAP/G/\inf queueing model. We construct effective discrete-time Markovian dynamics for this model and utilize it to derive exact time-dependent distribution of customer number and the…
The investigation of random walks is central to a variety of stochastic processes in physics, chemistry, and biology. To describe a transport phenomenon, we study a variant of the one-dimensional persistent random walk, which we call a…
We consider a one-dimensional traffic model with a slow-to-start rule. The initial position of the cars in $\mathbb R$ is a Poisson process of parameter $\lambda$. Cars have speed 0 or 1 and travel in the same direction. At time zero the…
Product-form stationary distributions in Markov chains have been a foundational advance and driving force in our understanding of stochastic systems. In this paper, we introduce a new product-form relationship that we call "graph-based…
In this paper we develop the first perfect sampling algorithm for queues with Hawkes input, i.e. single-server queues with Hawkes arrivals and i.i.d. service times of general distribution. In addition to the stability condition, we also…
In this paper, we consider a $G_t/G_t/\infty$ infinite server queueing model in a random environment. More specifically, the arrival rate in our server is modeled as a highly fluctuating stochastic process, which arguably takes into account…
The cellular automaton model for traffic flow exhibits a jamming transition from a free-flow phase to a congested phase. In the deterministic case this transition corresponds to a critical point with diverging correlation length. In 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,…
This paper considers the mean waiting times in discrete-time preemptive-resume and nonpreemptive priority single-server queues fed by K independent batch Markovian arrival streams with geometrically distributed idle periods. While being…