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 The Color of Success by William J. Stewart
Cover of the book Unceasing Strife, Unending Fear by William J. Stewart
Cover of the book The Grammar of Ornament by William J. Stewart
Cover of the book digitalSTS by William J. Stewart
Cover of the book Partiality by William J. Stewart
Cover of the book Religion in American Politics by William J. Stewart
Cover of the book Trigonometric Delights (New in Paperback) by William J. Stewart
Cover of the book Kierkegaard's Writings, XXII, Volume 22 by William J. Stewart
Cover of the book Trust in Numbers by William J. Stewart
Cover of the book Disruptive Fixation by William J. Stewart
Cover of the book The Altruism Equation by William J. Stewart
Cover of the book Alan Turing: The Enigma by William J. Stewart
Cover of the book Empires of the Silk Road by William J. Stewart
Cover of the book Tame Passions of Wilde by William J. Stewart
Cover of the book On Elizabeth Bishop 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