While in theory systems with traffic intensity rho > 1 blow up, in reality they are stabilized by abandonments. We study limiting results for many-server systems with abandonments.

We introduces some more general processing networks and the maximum pressure policy, which uses local information for decentralized control of the network. Maximum pressure policies can guarantee the stability of MCQN as well as of more general processing networks, under some simple structure conditions, whenever traffic intensity rho < 1.

We present the ingenious scheme devised by Loynes to show that G/G/1 with stationary arrival and service processes is stable when the traffic intensity rho < 1, and transient if rho > 1. Under the stronger assumption that interarrivals and services are i.i.d., we explore the connection of the GI/GI/1 queue with the general random walk and obtain an insightful upper bound on waiting time.

We discuss the case in which arrivals, service, and routing are all memoryless, which is the classic Jackson network, and some related systems. For all of these, the stationary distribution is obtainable and is of product form.

Because time is not scaled, limiting results for many-server scaling retains dependence on the service time distribution, as we saw in the scaling of M/GI/1. We extend these infinite server results to general time-dependent arrival streams.

We discuss the classic Jackson network with general i.i.d. interarrivals and service times, the generalized Jackson network. Like the GI/GI/1 system, the generalized Jackson network cannot be analyzed in detail, and we discuss fluid and diffusion approximations to the network process.

We consider Brownian problems of scheduling and admission control, where we force congestion to be kept at the least costly nodes, and use admission control to regulate congestion.

We study matching in parallel specialized service systems.

We define fluid limits and show that stability of the fluid limits implies stability of the stochastic queueing system. This enables us to study stability of MCQN under various policies.

We introduce Brownian motion and related processes.

We discuss control of transient MCQN. We introduce queues with infinite supply of work that can achieve stability with traffic intensity rho = 1.

We define the single queue, introduce notation and some relations and properties, and present simple examples of queues. We also discuss simulation of queues.

Queueing networks are all pervasive; they occur in service, manufacturing, communication, computing, the internet, and transportation. Much of queueing theory is aimed at performance evaluation of stochastic systems. Extending the methods of deterministic optimization to stochastic models so as to achieve both performance evaluation and control is an important and notoriously hard area of research. In this book our aim is to familiarize the reader with recent techniques for scheduling and control of queueing networks, with emphasis on both evaluation and optimization.

We study a queueing system with memoryless Poisson arrivals and generally distributed processing times, the so-called M/G/1 system. Performance measures of this system can be derived exactly, using the principle of work conservation and the property of PASTA (Poisson arrivals see time averages).

We look at control of networks in balanced heavy traffic. We consider routing to parallel servers; this illustrates our aim to always pool system resources. We also observe state space collapse and biriefly discuss the diffusion limit for MCQN.

We consider scheduling of batches of jobs and scheduling of stationary streams of jobs. We discuss priority queues and other service policies.