Related papers: Analyzing a Tandem Fluid Queueing Model with Stoch…
The mathematical approaches for modeling dynamic traffic can roughly be divided into two categories: discrete packet routing models and continuous flow over time models. Despite very vital research activities on models in both categories,…
We consider stability and network capacity in discrete time queueing systems. Relationships between four common notions of stability are described. Specifically, we consider rate stability, mean rate stability, steady state stability, and…
A queueing model has $J\ge2$ heterogeneous service stations, each consisting of many independent servers with identical capabilities. Customers of $I\ge2$ classes can be served at these stations at different rates, that depend on both the…
We study a two-stage tandem service queue attended by two servers. Each job-server pair must complete both service phases together, with the server unable to begin a new job until the current one is fully processed after two stages.…
Network capacity region of multi-queue multi-server queueing system with random ON-OFF connectivities and stationary arrival processes is derived in this paper. Specifically, the necessary and sufficient conditions for the stability of the…
This paper examines a continuous-time routing system with general interarrival and service time distributions, operating under the join-the-shortest-queue and power-of-two-choices policies. Under a weaker set of assumptions than those…
In this paper we study coordinated multipath routing at the flow-level in networks with routes of length one. As a first step the static case is considered, in which the number of flows is fixed. A clustering pattern in the rate allocation…
We consider a service system with an infinite number of exponential servers sharing a finite service capacity. The servers are ordered according to their speed, and arriving customers join the fastest idle server. A capacity allocation is…
We consider a model of Internet congestion control that represents the randomly varying number of flows present in a network where bandwidth is shared fairly between document transfers. We study critical fluid models obtained as formal…
Robustness and cascading failures in interdependent systems has been an active research field in the past decade. However, most existing works use percolation-based models where only the largest component of each network remains functional…
Tanker water systems play critical role in providing adequate service to meet potable water demands in the face of acute water crisis in many cities globally. Managing tanker movements among the supply and demand sides requires an efficient…
We consider a multi-class queueing network as a model of packet transfer in a communication network. We define a second stochastic model as a model document transfer in a communication network where the documents transferred have a general…
Let $X$ be the constrained random walk on ${\mathbb Z}_+^2$ with increments $(1,0)$, $(-1,0)$, $(0,1)$ and $(0,-1)$; $X$ represents, at arrivals and service completions, the lengths of two queues working in parallel whose service and…
We consider a dynamic model of traffic that has received a lot of attention in the past few years. Users control infinitesimal flow particles aiming to travel from an origin to a destination as quickly as possible. Flow patterns vary over…
In an earlier paper, a randomized load balancing model was studied in a heavy traffic asymptotic regime where the load balancing stream is thin compared to the total arrival stream. It was shown that the limit is given by a system of…
We introduce a new model to study the oscillations of opposite flows sharing a common bottleneck and moving on two Totally Asymmetric Simple Exclusion Process (TASEP) lanes. We provide a theoretical analysis of the phase diagram, valid when…
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…
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…
This paper continues the study of equilibria for flows over time in the fluid queueing model recently considered by Koch and Skutella [10]. We provide a constructive proof for the existence and uniqueness of equilibria in the case of a…
We study how the choice of packet scheduling algorithms influences end-to-end performance on long network paths. Taking a network calculus approach, we consider both deterministic and statistical performance metrics. A key enabling…