Communication networks and computer systems have become extremely complex. The statistical resource sharing induced by the random behaviour of users and the underlying protocols and algorithms may affect quality of service. The book introduces the main results of queueing theory useful for analysing the performance of these systems. These mathematical tools are key to the development of robust dimensioning rules and engineering methods. A number of examples illustrate their practical interest.
- Introduction
- Exponential Distribution (look inside)
- Poisson Processes
- Markov Chains
- Markov Processes
- Queues
- Queueing Networks
- Circuit Traffic (look inside)
- Real-time Traffic
- Elastic Traffic
- Network Performance (exercises)
You will find here some applets which implement the formulas that are introduced in the book.
A list of errata is available. If you have any question, remark or if you want to point out a bug, you can send us an email: or .
