Related papers: Queueing systems with renovation vs. queues with R…
We consider a stable open queuing network as a steady non-equilibrium system of interacting particles. The network is completely specified by its underlying graphical structure, type of interaction at each node, and the Markovian transition…
Polling systems have been widely studied, however most of these studies focus on polling systems with renewal processes for arrivals and random variables for service times. There is a need driven by practical applications to study polling…
In this paper, we study the stability of queues with impatient customers. Under general stationary ergodic assumptions, we first provide some conditions for such a queue to be regenerative (i.e. to empty a.s. an infinite number of times).…
We consider a system where randomly generated updates are to be transmitted to a monitor, but only a single update can be in the transmission service at a time. Therefore, the source has to prioritize between the two possible transmission…
Today's queueing network systems are more rapidly evolving and more complex than those of even a few years ago. The goal of this paper is to study customers' behavior in an unobservable Markovian M/M/1 queue where consumers have to choose…
The dynamics and the stationary states for the competition between pattern reconstruction and asymmetric sequence processing are studied here in an exactly solvable feed-forward layered neural network model of binary units and patterns near…
This paper considers a network of infinite-server queues with the special feature that, triggered by specific events, the network population vector may undergo a linear transformation (a `multiplicative transition'). For this model we…
Queueing networks are notoriously difficult to analyze sans both Markovian and stationarity assumptions. Much of the theoretical contribution towards performance analysis of time-inhomogeneous single class queueing networks has focused on…
We identify general conditions under which regenerative processes with dependent cycles and cycle lengths are asymptotically independent. The result is applied to various models. In particular, independent L\'evy processes with dependent…
To reduce computational complexity, macro-energy system models commonly implement reduced time-series data. For renewable energy systems dependent on seasonal storage and characterized by intermittent renewables, like wind and solar,…
Time delays are a common perturbation in systems with many states, such as networked, distributed, or decentralized systems. Current methods analyzing the stability of large systems with time delay typically produce very conservative…
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…
This is an annotated bibliography on estimation and inference results for queues and related stochastic models. The purpose of this document is to collect and categorise works in the field, allowing for researchers and practitioners to…
This paper studies the performance of transmission schemes that have rate that increases with average SNR while maintaining a fixed outage probability. This is in contrast to the classical Zheng-Tse diversity-multiplexing tradeoff (DMT)…
The paper studies a multiserver retrial queueing system with $m$ servers. Arrival process is a point process with strictly stationary and ergodic increments. A customer arriving to the system occupies one of the free servers. If upon…
Steady-state solutions for a variety of relevant queueing systems are known today, e.g., from queueing theory, effective bandwidths, and network calculus. The behavior during transient phases, on the other hand, is understood to a much…
In this paper, we consider a new queueing model where queues balance themselves according to a mean field interaction with a time delay. Unlike other work with delayed information our model considers multi-server queues with customer…
This self-contained discussion relates the long-run average holding cost per unit time to the long-run average response time per customer in a $G/G/1$ queue with no assumption made on the order of service. The only restriction established…
We establish the averaging property for a queuing process with one server, M(t)/GI/1. It is a new relation between the output flow rate and the input flow rate, crucial in the study of the Poisson Hypothesis. Its implications include the…
Motivated by applications in online marketplaces such as ride-hailing platforms and payment channel networks, we study a single-server queue with state-dependent arrival control. The service operator dynamically chooses the arrival rate as…