Book Synopsis

This book introduces the theoretical fundamentals for modeling queues in discrete-time, and the basic procedures for developing queuing models in discrete-time. There is a focus on applications in modern telecommunication systems.

It presents how most queueing models in discrete-time can be set up as discrete-time Markov chains. Techniques such as matrix-analytic methods (MAM) that can used to analyze the resulting Markov chains are included. This book covers single node systems, tandem system and queueing networks. It shows how queues with time-varying parameters can be analyzed, and illustrates numerical issues associated with computations for the discrete-time queueing systems. Optimal control of queues is also covered.

Get the Book at Springer

Preface
Chapter 1 Introduction
Chapter 2 Arrival and Service Processes
Chapter 3 Discrete-Time Markov Chains
Chapter 4 Numerical Computations with Discrete-Time Markov Chains
Chapter 5 Basic Single Node Queueing Models with Infinite Buffers
Chapter 6 Basic Single Node Queueing Models with Finite Buffers

Chapter 7 Multiserver Single Node Queueing Models
Chapter 8 Single Node Queueing Models with Server Vacations
Chapter 9 Single Node Queueing Models with Priorities
Chapter 11 Queues with Time Varying Parameters
Chapter 12 Tandem Queues and Queueing Networks
Chapter 13 Optimization and Control of Discrete-Time Queues