Queuing Theory Problems

Foreword
About the authors
Typographical conventions
1. Basic aspects of Queueing Theory
2. Basic single-node waiting systems
3. Queueing Networks
4. Intrinsic priorities
5. Time-sharing systems
I Appendices
A. Summary of the most common probability distributions
B. Summary of the most important results and models
C. Annotated bibliography

This book aims to provide a compendium of exercises (short questions, solved problems, and proposed problems) covering the basic aspects of queueing theory.
While it is not the objective of this book to address the explanation of the theoretical concepts underlying the solution of the problems presented here, a brief summary of these fundamentals has been included in each of the chapters that articulate the book. In this way, the already familiar reader will be able to consult small doubts in these summaries.