Related papers: Transitory Queueing Networks
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…
The performance analysis of peer-to-peer (P2P) networks calls for a new kind of queueing model, in which jobs and service stations arrive randomly. Except in some simple special cases, in general, the queueing model with varying service…
This paper studies a scheduling control problem for a single-server multiclass queueing network in heavy traffic, operating in a changing environment. The changing environment is modeled as a finite state Markov process that modulates the…
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…
We consider multiclass feedforward queueing networks with first in first out and priority service disciplines at the nodes, and class dependent deterministic routing between nodes. The random behavior of the network is constructed from…
This note introduces a piecewise-deterministic queueing (PDQ) model to study the stability of traffic queues in parallel-link transportation systems facing stochastic capacity fluctuations. The saturation rate (capacity) of the PDQ model…
In Internet environment, traffic flow to a link is typically modeled by superposition of ON/OFF based sources. During each ON-period for a particular source, packets arrive according to a Poisson process and packet sizes (hence service…
Various empirical and theoretical studies indicate that cumulative network traffic is a Gaussian process. However, depending on whether the intensity at which sessions are initiated is large or small relative to the session duration tail,…
We consider a token bucket mechanism serving a heterogeneous flow with a focus on backlog, delay and packet loss properties. Previous models have considered the case for fixed size packets, i.e. "one token per packet" with and M/D/1 view on…
Recent development of peer-to-peer (P2P) services (e.g. streaming, file sharing, and storage) systems introduces a new type of queue systems that receive little attention before, where both job and server arrive and depart randomly. Current…
A stochastic model for a mobile network is studied. Users enter the network, and then perform independent Markovian routes between nodes where they receive service according to the Processor-Sharing policy. Once their service requirement is…
We consider a novel, analytical queuing model for vehicle coordination at signal-free intersections. Vehicles arrive at an intersection according to Poisson processes, and the crossing times are constants dependent of vehicle types. We use…
This paper analyzes stochastic networks consisting of a set of finite capacity sites where different classes of individuals move according to some routing policy. The associated Markov jump processes are analyzed under a thermodynamic limit…
While many classical traffic models treat the spatial extension of streets continuously or by discretization into cells of a certain length, we will subdivide roads into comparatively long homogeneous road sections of constant capacity with…
We consider a stochastic, dynamic job scheduling problem, formulated as a queueing control problem, in which a single server processes jobs of different types that arrive according to independent Poisson processes. The problem is defined on…
We study an open discrete-time queueing network that models the collection of data in a multi-hop sensor network. We assume data is generated at the sensor nodes as a discrete-time Bernoulli process. All nodes in the network maintain a…
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…
Join the shortest queue (JSQ) refers to networks whose incoming jobs are assigned to the shortest queue from among a randomly chosen subset of the queues in the system. After completion of service at the queue, a job leaves the network. We…
We consider the so-called GI/GI/N queue, in which a stream of jobs with independent and identically distributed service times arrive as a renewal process to a common queue that is served by $N$ identical parallel servers in a…
We study randomized experiments in a service system when stochastic congestion can arise from temporarily limited supply or excess demand. Such congestion gives rise to cross-unit interference between the waiting customers, and analytic…