Related papers: On Pollaczek-Khinchine Formula for Peer-to-Peer Ne…
A new timeliness metric, called Age-of-Information (AoI), has recently attracted a lot of research interests for real-time applications with information updates. It has been extensively studied for various queueing models based on the…
We consider queueing models, where customers arrive according to a continuous-time binomial process on a finite interval. In this arrival process, a total of $K$ customers arrive in the finite time interval $[0,T]$, where arrival times of…
The paper studies closed queueing networks containing a server station and $k$ client stations. The server station is an infinite server queueing system, and client stations are single-server queueing systems with autonomous service, i.e.…
Demand for studying queueing systems with multiple servers providing correlated services was created about 60 years ago, motivated by various applications. In recent years, the importance of such studies has been significantly increased,…
In this work, we consider the case where a source with bursty traffic can adjust the transmission duration in order to increase the reliability. The source is equipped with a queue in order to store the arriving packets. We model the system…
The optimal tradeoff between average service cost rate, average utility rate, and average delay is addressed for a state dependent M/M/1 queueing model, with controllable queue length dependent service rates and arrival rates. For a model…
We investigate Markovian queues that are examined by a controller at random times determined by a Poisson process. Upon examination, the controller sets the service speed to be equal to the minimum of the current number of customers in the…
We study a make-to-order system with a finite set of customers. Production is stochastic with a nonlinear dependence between the ordered quantity and the production rate. Customers may have to queue until their turn arrives, and therefore…
We study a queueing network with a single shared server, that serves the queues in a cyclic order according to the gated service discipline. External customers arrive at the queues according to independent Poisson processes. After…
We study a single station two-stage reneging queue with Poisson arrivals, exponential services, and two levels of exponential reneging behaviors, extending the popular Erlang A model that assumes a constant reneging rate. We derive…
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…
In this paper we study a non-stationary Markovian queueing model of a two-processor heterogeneous system with time-varying arrival and service rates. We obtain the bounds on the rate of convergence and find the main limiting characteristics…
In this paper, a mixed integer linear formulation for problems considering time-of-use-type constraints for uninterruptible services is presented. Our work is motivated by demand response problems in power systems, in which certain devices…
We consider the $N$-model queueing system with a waiting time dependent threshold on the diagonal: the service discipline is First--Come--First--Served, but type-1 jobs can only be served by server 2 if their waiting time exceeds a…
We develop link rate control policies to minimize the queueing delay of packets in overloaded networks. We show that increasing link rates does not guarantee delay reduction during overload. We consider a fluid queueing model that…
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…
Consideration is given to the three different analytical methods for the computation of upper bounds for the rate of convergence to the limiting regime of one specific class of (in)homogeneous continuous-time Markov chains. This class is…
We study the information-theoretic limit of reliable information processing by a server with queue-length dependent quality of service. We define the capacity for such a system as the number of bits reliably processed per unit time, and…
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…
A heterogeneous closed network with one-server queues with finite capacity and one infinite-server queue is studied. A target application is bike-sharing systems. Heterogeneity is taken into account through clusters whose queues have the…