Related papers: Heavy-Traffic Analysis of Queueing Systems with no…
Randomized load balancing networks arise in a variety of applications, and allow for efficient sharing of resources, while being relatively easy to implement. We consider a network of parallel queues in which incoming jobs with independent…
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 establish heavy traffic limit theorems for queue-length processes in critically loaded single class queueing networks with state dependent arrival and service rates. A distinguishing feature of our model is non-Markovian state…
In this paper we analyze a single server queue with batch arrivals and semi-Markovian service times. We also include the feature that the first service of each busy period might have a different distribution than subsequent service times.…
This report considers a fairly general model of constrained queuing networks that allows us to represent both MMBP (Markov Modulated Bernoulli Processes) arrivals and time-varying service constraints. We derive a set of sufficient…
We study the convergence of the $M/G/1$ processor-sharing, queue length process in the heavy traffic regime, in the finite variance case. To do so, we combine results pertaining to L\'{e}vy processes, branching processes and queuing theory.…
We study the microscopic time fluctuations of traffic-load and the global statistical properties of a dense traffic of particles on scale-free cyclic graphs. For a wide range of driving rates $R$ the traffic is stationary and the load…
The problem of increased queueing delays in the Internet motivates the study of currently implemented transport protocols and active queue management (AQM) policies. We study Compound TCP (default protocol in Windows) with Random Early…
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…
We investigate an M/M/1 queue operating in two switching environments, where the switch is governed by a two-state time-homogeneous Markov chain. This model allows to describe a system that is subject to regular operating phases alternating…
The tandem fluid queueing model is a useful tool for performance analysis and control design for a variety of transportation systems. In this article, we study the joint impact of stochastic capacity and spillback on the long-time…
A macroscopic model-based approach for estimation of the traffic state, specifically of the (total) density and flow of vehicles, is developed for the case of "mixed" traffic, i.e., traffic comprising both ordinary and connected vehicles.…
Throughput-optimal transmission scheduling in wireless networks has been a well considered problem in the literature, and the method for achieving optimality, MaxWeight scheduling, has been known for several decades. This algorithm achieves…
Following recent developments in the application of Stein's method in queueing theory, this paper is intended to be a short treatment showing how Stein's method can be developed and applied to the single server queue in heavy traffic. Here…
Given a random variable $N$ with values in ${\mathbb{N}}$, and $N$ i.i.d. positive random variables $\{\mu_k\}$, we consider a queue with renewal arrivals and $N$ exponential servers, where server $k$ serves at rate $\mu_k$, under two work…
We introduce an original minimax framework for finite-time performance analysis in queueing control and propose a surprisingly simple Lyapunov-based scheduling policy with superior finite-time performance. The framework quantitatively…
This paper studies an important rate allocation problem that arises in many networked and distributed systems: steady-state traffic rate allocation from multiple sources to multiple service nodes when both (i) the access-path delay on each…
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…
We consider a load balancing model where a Poisson stream of jobs arrive at a system of many servers whose service time distribution possesses a finite second moment. A small fraction of arrivals pass through the so called power-of-choice…
We consider a two-node tandem queueing network in which the upstream queue is M/G/1 and each job reuses its upstream service requirement when moving to the downstream queue. Both servers employ the first-in-first-out policy. We investigate…