Related papers: A rate balance principle and its application to qu…
An infinite buffer batch service vacation queue has been studied where service rate of the batch is dependent on the size of the batch and vacation rate is dependent on the queue size at vacation initiation epoch. The arrivals follow the…
Motivated by growing applications in two-sided markets, we study a parallel matching queue with reneging. Demand and supply units arrive to the system and are matched in an FCFS manner according to a compatibility graph specified by an…
In this paper one presents method for the computation of convergence bounds for four classes of multiserver queueing systems, described by inhomogeneous Markov chains. Specifically one considers inhomogeneous $M/M/S$ queueing system with…
We consider multi-class single-server queueing networks that have a product form stationary distribution. A new limit result proves a sequence of such networks converges weakly to a stochastic flow level model. The stochastic flow level…
Just as transition rates in a canonical ensemble must respect the principle of detailed balance, constraints exist on transition rates in driven steady states. I derive those constraints, by maximum information-entropy inference, and apply…
A multi-channel queueing system is considered. The arriving requests differ in their type. Requests of each type arrive according to a Poisson process. The number of channels required for service with the rate equal to 1 depends of the…
We investigate a processor sharing queue with renewal arrivals and generally distributed service times. Impatient jobs may abandon the queue, or renege, before completing service. The corresponding stochastic processes are represented by…
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…
Discrete-time queueing models find huge applications as they are used in modeling queueing systems arising in digital platforms like telecommunication systems, computer networks, etc. In this paper, we analyze an infinite-buffer queueing…
This paper presents a comprehensive review of stochastic processes, with a particular focus on Markov chains and jump processes. The main results related to queuing systems are analyzed. Additionally, conditions that ensure the stability,…
In this brief paper we find computable exponential convergence rates for a large class of stochastically ordered Markov processes. We extend the result of Lund, Meyn, and Tweedie (1996), who found exponential convergence rates for…
In traditional priority queues, we assume that every customer upon arrival has a fixed, class-dependent priority, and that a customer may not commence service if a customer with a higher priority is present in the queue. However, in…
Multi-class queueing networks (McQNs) extend the classical concept of Jackson network by allowing jobs of different classes to visit the same server. While such a generalization seems rather natural, from a structural perspective there is a…
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…
We study a token-based central queue with multiple customer types. Customers of each type arrive according to a Poisson process and have an associated set of compatible tokens. Customers may only receive service when they have claimed a…
We consider a system of ordered cars moving in $\R$ from right to left. Each car is represented by a point in $\R$; two or more cars can occupy the same point but cannot overpass. Cars have two possible velocities: either 0 or 1. An…
We study the accumulation of resources within a target due to the interplay between continual delivery, driven by 1D stochastic search processes, and sequential consumption. The assumption of sequential consumption is key because it changes…
An overview of the recursive equations based models and their applications in simulation based analysis and optimization of queueing systems is given. These models provide a variety of systems with a convenient and unified representation in…
We suggest an approach to obtaining general two-sided bounds on the rate of convergence in terms of special "weighted" norms related to total variation. Some important classes of continuous-time Markov chains are considered:…
This paper studies birth and death processes in interactive random environments where the birth and death rates and the dynamics of the state of the environment are dependent on each other. Two models of a random environment are considered:…