Robust Scheduling for Queueing Networks

IfN is a queueing network and cs is the mean service time at server s of N , de ne NC,FCFS (respectively, NE,FCFS) to be the queueing network N where the service time at server s is a constant cs (respectively, an independent exponentially distributed random variable with mean cs) and the packets are served in a rst-comerst-served order. Recently, Harchol-Balter and Wolfe introduced the problem...

This note describes a simulation experiment involving nine exponential queues in series with a non-Poisson arrival process, which demonstrates that the heavy-traffic bottleneck phenomenon can occur in practice (at reasonable traffic intensities) as well as in theory (in the limit). The results reveal limitations in customary two-moment approximations for open queueing networks. queues * open qu...

Previous insensitivity results on queueing systems include on one hand, e.g., symmetric queues in isolation and, on the other hand, networks of processor sharing queues with globally dependent balanced service rates, i.e. so-called Whittle networks. In this paper we show that insensitivity property of a queueing network with balanced service rates is retained when each of the processor sharing ...

In modern networks serving real systems, there are a wide of variety of classes of messages. This results in the need for more sophisticated queueing policies. The desired queueing disciplines are expected to be able to consider all variables which are needed to handle messages appropriately. These variables include: diierent required service times, source traac chacteristics and quality of ser...

A queueing model for wireless communication network in which network coding is employed is introduced. It is shown that networks with coding are closely related to queueing networks with positive and negative customers. Analytical upper and lower bounds on the energy consumption and the delay are obtained using a Markov reward approach. The tradeoff between minimizing energy consumption and min...

We give a Taylor series expansion for the joint Laplace transform of stationary waiting times in open (max,+)-linear stochastic systems with Poisson input. Probabilistic expressions are derived for coefficients of all orders. Even though the computation of these coefficients can be hard for certain systems, it is sufficient to compute only a few coefficients to obtain good approximations (espec...

Fair scheduling algorithms have been proposed to tackle the problem of bursty and location-dependent errors in wireless packet networks. Most of those algorithms ensure the fairness property and guarantee the QoS of all sessions in a large-scale cellular network such as GSM or GPRS. In this paper, we propose the Weighted-Sacrificing Fair Queueing (WSFQ) scheduling algorithm for small-area and d...