Stewart, William J. Author
Biography not available.
Browse all ART CRITICISM books
Browse all Ashworth books
Browse all FOLKLORE books
Browse all GARDENS books
Browse all GRAPHIC NOVELS books
Browse all Hamilton books
Browse all HISTORY - MEDIEVAL books
Browse all HUMOUR books
Browse all KINDRED books
Browse all LITERARY STUDIES books
Browse all LONDON books
Browse all Lozada books
Browse all Medical : Nursing - Mental Health books
Browse all MIND books
Browse all MUSEOLOGY books
Browse all NON-CLASSIFIABLE books
Browse all NONLINEAR SCIENCE books
Browse all Ormonde books
Browse all POPULAR SCIENCE books
Browse all RELIGIOUS STUDIES books
Browse all SPIRIT books
Browse all SPORT books
Browse all TRAVEL WRITING books
Out of Stock
Hardback ยท ISBN 9780691140629
Inclusive of GST and other taxes
Arriving at your doorstep in 10-15 days
Our logisitcs team will make sure everyitem is delivered safely
| ISBN | 9780691140629 |
|---|---|
| Publisher | Princeton University Press |
| Publication date | July 2009 |
| Language | English |
| MRP | ยฃ138.00 GBP |
| Page count | 778 |
| Item weight | 342 g |
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).
Log in to write a review for this book.
No reviews yet. Be the first to share your opinion.
Biography not available.