eTextbook: Probability, Markov Chains, Queues, and Simulation

Book Jacket Image

List Price 1: $99.95

Rent for 6 months *$39.98

* 6 months - expires 10/15/14
You save $59.97

Prices do not include sales tax, which may apply.

List Price 1: $99.95

eTextbook Purchase: $79.96

You save $19.99

Are you a school looking to buy multiple copies of this book?

  • Free Book Promotion

    For a limited time, this book is eligible for free.

    Click here to redeem the Facebook Offer

    Author(s): Stewart, William J.

    ISBN 10: 0691140626. See all ISBN's

    ISBN 13: 9780691140629

    Edition:

    Publisher: Princeton University Press

    This is an eTextbook Learn More

    Description:

    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

    Professors: A supplementary Solutions Manual is available for this book. It is restricted to teachers using the text in courses. For information on how to obtain a copy, refer to: http://press.princeton.edu/class_use/solutions.html

    All ISBN's for this title:

    ISBN 10: 0691140626, ISBN 13: 9780691140629, eISBN 10: 1400832810, eISBN 13: 9781400832811

    1. List price can refer to either the digital or print list price, whichever is available to Kno.
  • Cool Product Features

    Kno In Action

    Search

    Journal

    Flashcards

    Kno Me

    Smart Links