Probability, Stochastic Processes, and Queueing Theory : The Mathematics of Computer Performance Modeling

We will occasionally footnote a portion of text with a "**,, to indicate Notes on the that this portion can be initially bypassed. The reasons for bypassing a Text portion of the text include: the subject is a special topic that will not be referenced later, the material can be skipped on first reading, or the level of mathematics is higher than the rest of the text. In cases where a topic is self-contained, we opt to collect the material into an appendix that can be read by students at their leisure. The material in the text cannot be fully assimilated until one makes it Notes on "their own" by applying the material to specific problems. Self-discovery Problems is the best teacher and although they are no substitute for an inquiring mind, problems that explore the subject from different viewpoints can often help the student to think about the material in a uniquely per­ sonal way. With this in mind, we have made problems an integral part of this work and have attempted to make them interesting as well as informative.

This textbook provides a comprehensive introduction to probability and stochastic processes, and shows how these subjects may be applied in computer performance modeling. The author's aim is to derive probability theory in a way that highlights the complementary nature of its formal, intuitive, and applicative aspects while illustrating how the theory is applied in a variety of settings. Readers are assumed to be familiar with elementary linear algebra and calculus, including being conversant with limits, but otherwise, this book provides a self-contained approach suitable for graduate or advanced undergraduate students. The first half of the book covers the basic concepts of probability, including combinatorics, expectation, random variables, and fundamental theorems. In the second half of the book, the reader is introduced to stochastic processes. Subjects covered include renewal processes, queueing theory, Markov processes, matrix geometric techniques, reversibility, and networks of queues. Examples and applications are drawn from problems in computer performance modeling. Throughout, large numbers of exercises of varying degrees of difficulty will help to secure a reader's understanding of these important and fascinating subjects.