Synopses & Reviews
Sample-Path Analysis of Queueing Systems uses a deterministic (sample-path) approach to analyze stochastic systems, primarily queueing systems and more general input-output systems. Among other topics of interest it deals with establishing fundamental relations between asymptotic frequencies and averages, pathwise stability, and insensitivity. These results are utilized to establish useful performance measures. The intuitive deterministic approach of this book will give researchers, teachers, practitioners, and students better insights into many results in queueing theory. The simplicity and intuitive appeal of the arguments will make these results more accessible, with no sacrifice of mathematical rigor. Recent topics such as pathwise stability are also covered in this context. The book consistently takes the point of view of focusing on one sample path of a stochastic process. Hence, it is devoted to providing pure sample-path arguments. With this approach it is possible to separate the issue of the validity of a relationship from issues of existence of limits and/or construction of stationary framework. Generally, in many cases of interest in queueing theory, relations hold, assuming limits exist, and the proofs are elementary and intuitive. In other cases, proofs of the existence of limits will require the heavy machinery of stochastic processes. The authors feel that sample-path analysis can be best used to provide general results that are independent of stochastic assumptions, complemented by use of probabilistic arguments to carry out a more detailed analysis. This book focuses on the first part of the picture. It does however, provide numerous examples that invoke stochastic assumptions, which typically are presented at the ends of the chapters.
Review
` ... it contains a wealth of useful material for those giving courses in stochastic processes at all levels, and its extremely readable style makes it suitable for anyone with previous exposure to basic probability and stochastic processes.' Short Book Reviews, 19:2 (1999) `... this monograph is well written, fairly comprehensive and a welcome addition to the growing number of books on queuing theory. It is of interest to a wide audience of operations researchers, applied probabilists and engineers.' Mathematical reviews, 2002d
Synopsis
Sample-Path Analysis of Queueing Systems uses a deterministic (sample-path) approach to analyze stochastic systems, primarily queueing systems and more general input-output systems. Among other topics of interest it deals with establishing fundamental relations between asymptotic frequencies and averages, pathwise stability, and insensitivity. These results are utilized to establish useful performance measures. The intuitive deterministic approach of this book will give researchers, teachers, practitioners, and students better insights into many results in queueing theory. The simplicity and intuitive appeal of the arguments will make these results more accessible, with no sacrifice of mathematical rigor. Recent topics such as pathwise stability are also covered in this context.The book consistently takes the point of view of focusing on one sample path of a stochastic process. Hence, it is devoted to providing pure sample-path arguments. With this approach it is possible to separate the issue of the validity of a relationship from issues of existence of limits and/or construction of stationary framework. Generally, in many cases of interest in queueing theory, relations hold, assuming limits exist, and the proofs are elementary and intuitive. In other cases, proofs of the existence of limits will require the heavy machinery of stochastic processes. The authors feel that sample-path analysis can be best used to provide general results that are independent of stochastic assumptions, complemented by use of probabilistic arguments to carry out a more detailed analysis. This book focuses on the first part of the picture. It does however, provide numerous examples that invoke stochasticassumptions, which typically are presented at the ends of the chapters.
Description
Includes bibliographical references (p. [275]-291) and index.
Table of Contents
Preface. 1. Introduction and Overview. 2. Background and Fundamental Results. 3. Processes with General State Space. 4. Processes with Countable State Space. 5. Sample-Path Stability. 6. Little's Formula and Extensions. 7. Insensitivity of Queueing Networks. 8. Sample-Path Approach to Palm Calculus. Appendices. A. Ergodic Theory and Random Marked Point Processes. B. Limit Theorems for Markov and Regenerative Processes. C. Stability in Stochastic Models. References. Index.