Probability, Markov Chains, Queues, and Simulation

The Mathematical Basis of Performance Modeling

Nonfiction, Science & Nature, Mathematics, Applied, Statistics
Cover of the book Probability, Markov Chains, Queues, and Simulation by William J. Stewart, Princeton University Press
View on Amazon View on AbeBooks View on Kobo View on B.Depository View on eBay View on Walmart
Author: William J. Stewart ISBN: 9781400832811
Publisher: Princeton University Press Publication: July 6, 2009
Imprint: Princeton University Press Language: English
Author: William J. Stewart
ISBN: 9781400832811
Publisher: Princeton University Press
Publication: July 6, 2009
Imprint: Princeton University Press
Language: English

Probability, Markov Chains, Queues, and Simulation provides a modern and authoritative treatment of the mathematical processes that underlie performance modeling. The detailed explanations of mathematical derivations and numerous illustrative examples make this textbook readily accessible to graduate and advanced undergraduate students taking courses in which stochastic processes play a fundamental role. The textbook is relevant to a wide variety of fields, including computer science, engineering, operations research, statistics, and mathematics.

The textbook looks at the fundamentals of probability theory, from the basic concepts of set-based probability, through probability distributions, to bounds, limit theorems, and the laws of large numbers. Discrete and continuous-time Markov chains are analyzed from a theoretical and computational point of view. Topics include the Chapman-Kolmogorov equations; irreducibility; the potential, fundamental, and reachability matrices; random walk problems; reversibility; renewal processes; and the numerical computation of stationary and transient distributions. The M/M/1 queue and its extensions to more general birth-death processes are analyzed in detail, as are queues with phase-type arrival and service processes. The M/G/1 and G/M/1 queues are solved using embedded Markov chains; the busy period, residual service time, and priority scheduling are treated. Open and closed queueing networks are analyzed. The final part of the book addresses the mathematical basis of simulation.

Each chapter of the textbook concludes with an extensive set of exercises. An instructor's solution manual, in which all exercises are completely worked out, is also available (to professors only).

  • Numerous examples illuminate the mathematical theories
  • Carefully detailed explanations of mathematical derivations guarantee a valuable pedagogical approach
  • Each chapter concludes with an extensive set of exercises
View on Amazon View on AbeBooks View on Kobo View on B.Depository View on eBay View on Walmart

Probability, Markov Chains, Queues, and Simulation provides a modern and authoritative treatment of the mathematical processes that underlie performance modeling. The detailed explanations of mathematical derivations and numerous illustrative examples make this textbook readily accessible to graduate and advanced undergraduate students taking courses in which stochastic processes play a fundamental role. The textbook is relevant to a wide variety of fields, including computer science, engineering, operations research, statistics, and mathematics.

The textbook looks at the fundamentals of probability theory, from the basic concepts of set-based probability, through probability distributions, to bounds, limit theorems, and the laws of large numbers. Discrete and continuous-time Markov chains are analyzed from a theoretical and computational point of view. Topics include the Chapman-Kolmogorov equations; irreducibility; the potential, fundamental, and reachability matrices; random walk problems; reversibility; renewal processes; and the numerical computation of stationary and transient distributions. The M/M/1 queue and its extensions to more general birth-death processes are analyzed in detail, as are queues with phase-type arrival and service processes. The M/G/1 and G/M/1 queues are solved using embedded Markov chains; the busy period, residual service time, and priority scheduling are treated. Open and closed queueing networks are analyzed. The final part of the book addresses the mathematical basis of simulation.

Each chapter of the textbook concludes with an extensive set of exercises. An instructor's solution manual, in which all exercises are completely worked out, is also available (to professors only).

More books from Princeton University Press

Cover of the book Collected Works of C.G. Jung, Volume 12 by William J. Stewart
Cover of the book Clear and Simple as the Truth by William J. Stewart
Cover of the book Interaction Ritual Chains by William J. Stewart
Cover of the book Working Together by William J. Stewart
Cover of the book Neuro by William J. Stewart
Cover of the book Immigrants by William J. Stewart
Cover of the book Japan Transformed by William J. Stewart
Cover of the book Strong Borders, Secure Nation by William J. Stewart
Cover of the book The Economics of Enough by William J. Stewart
Cover of the book At Lake Scugog by William J. Stewart
Cover of the book Hasidism by William J. Stewart
Cover of the book Read My Lips by William J. Stewart
Cover of the book Math Bytes by William J. Stewart
Cover of the book Elliptic Tales by William J. Stewart
Cover of the book Game Theory for Applied Economists by William J. Stewart
We use our own "cookies" and third party cookies to improve services and to see statistical information. By using this website, you agree to our Privacy Policy