Skip to content
Register Sign in Wishlist

Processing Networks
Fluid Models and Stability

$59.99 (C)

  • Date Published: November 2020
  • availability: In stock
  • format: Hardback
  • isbn: 9781108488891

$ 59.99 (C)

Add to cart Add to wishlist

Other available formats:

Looking for an examination copy?

This title is not currently available for examination. However, if you are interested in the title for your course we can consider offering an examination copy. To register your interest please contact providing details of the course you are teaching.

Product filter button
About the Authors
  • This state-of-the-art account unifies material developed in journal articles over the last 35 years, with two central thrusts: It describes a broad class of system models that the authors call 'stochastic processing networks' (SPNs), which include queueing networks and bandwidth sharing networks as prominent special cases; and in that context it explains and illustrates a method for stability analysis based on fluid models. The central mathematical result is a theorem that can be paraphrased as follows: If the fluid model derived from an SPN is stable, then the SPN itself is stable. Two topics discussed in detail are (a) the derivation of fluid models by means of fluid limit analysis, and (b) stability analysis for fluid models using Lyapunov functions. With regard to applications, there are chapters devoted to max-weight and back-pressure control, proportionally fair resource allocation, data center operations, and flow management in packet networks. Geared toward researchers and graduate students in engineering and applied mathematics, especially in electrical engineering and computer science, this compact text gives readers full command of the methods.

    • Thorough explanations and illustrations, including pitfalls, equip readers to use the methods and avoid common errors
    • Applications in electrical engineering and computer science showcase the power of fluid-based stability analysis in technologically meaningful settings
    • Engaging presentation by two leading figures in the study of stochastic processing networks
    Read more

    Reviews & endorsements

    'The deep and rich theory of stochastic processing networks has served as the analytical foundation for the study of communication networks, cloud computing systems, and manufacturing networks. This book by two of the pioneers of the theory presents an authoritative and comprehensive treatment of the topic, and will serve as an important reference to researchers in the area.' R. Srikant, University of Illinois at Urbana-Champaign

    'A system of interconnected resources can become overloaded and unstable even though each of its individual resources has the capacity to meet the demands on it. This striking observation, first made thirty years ago, has stimulated a major field of research. This book, written by two of the pioneers and leading researchers in the field, is a clear and authoritative account of the state-of-the-art.' Frank Kelly, University of Cambridge

    'This book provides an elegant and unified exposition of the general modeling framework of stochastic processing networks (SPNs) and associated theory of stability using fluid models. Much of this material was only previously available in dispersed journal articles. Adopting a continuous-time Markov chain description for SPNs, valid under fairly general assumptions on arrivals, service times and controls, enables a self-contained, accessible treatment. An array of interesting examples and extensions, especially involving applications for telecommunication and data networks, enliven the volume. This monograph will be an invaluable premier resource for graduate students and researchers in computer science, electrical and industrial engineering, applied mathematics and operations management interested in theory and applications of stochastic processing networks.' Ruth J. Williams, University of California, San Diego

    See more reviews

    Customer reviews

    Not yet reviewed

    Be the first to review

    Review was not posted due to profanity


    , create a review

    (If you're not , sign out)

    Please enter the right captcha value
    Please enter a star rating.
    Your review must be a minimum of 12 words.

    How do you rate this item?


    Product details

    • Date Published: November 2020
    • format: Hardback
    • isbn: 9781108488891
    • length: 404 pages
    • dimensions: 234 x 156 x 23 mm
    • weight: 0.73kg
    • availability: In stock
  • Table of Contents

    1. Introduction
    2. Stochastic processing networks
    3. Markov representations
    4. Extensions and complements
    5. Is stability achievable?
    6. Fluid limits, fluid equations and positive recurrence
    7. Fluid equations that characterize specific policies
    8. Proving fluid model stability using Lyapunov functions
    9. Max-weight and back-pressure control
    10. Proportionally fair resource allocation
    11. Task allocation in server farms
    12. Multi-hop packet networks
    Appendix A. Selected topics in real analysis
    Appendix B. Selected topics in probability
    Appendix C. Discrete-time Markov chains
    Appendix D. Continuous-time Markov chains and phase-type distributions
    Appendix E. Markovian arrival processes
    Appendix F. Convergent square matrices.

  • Authors

    J. G. Dai, The Chinese University of Hong Kong
    Jim Dai received his PhD in mathematics from Stanford University. He is currently Presidential Chair Professor in the Institute for Data and Decision Analytics at The Chinese University of Hong Kong, Shenzhen. He is also the Leon C. Welch Professor of Engineering in the School of Operations Research and Information Engineering at Cornell University. He was honored by the Applied Probability Society of INFORMS with its Erlang Prize (1998) and with two Best Publication Awards (1997 and 2017). In 2018 he received The Achievement Award from ACM SIGMETRICS. Professor Dai served as Editor-In-Chief of Mathematics of Operations Research from 2012 to 2018.

    J. Michael Harrison, Stanford University, California
    J. Michael Harrison earned degrees in industrial engineering and operations research before joining the faculty of Stanford University's Graduate School of Business, where he served for 43 years. His research concerns stochastic models in business and engineering, including mathematical finance and processing network theory. His previous books include Brownian Models of Performance and Control (2013). Professor Harrison has been honored by INFORMS with its Expository Writing Award (1998), the Lanchester Prize for best research publication (2001), and the John von Neumann Theory Prize (2004); he was elected to the U.S. National Academy of Engineering in 2008.

Sorry, this resource is locked

Please register or sign in to request access. If you are having problems accessing these resources please email

Register Sign in
Please note that this file is password protected. You will be asked to input your password on the next screen.

» Proceed

You are now leaving the Cambridge University Press website. Your eBook purchase and download will be completed by our partner Please see the permission section of the catalogue page for details of the print & copy limits on our eBooks.

Continue ×

Continue ×

Continue ×
warning icon

Turn stock notifications on?

You must be signed in to your Cambridge account to turn product stock notifications on or off.

Sign in Create a Cambridge account arrow icon

Find content that relates to you

Join us online

This site uses cookies to improve your experience. Read more Close

Are you sure you want to delete your account?

This cannot be undone.


Thank you for your feedback which will help us improve our service.

If you requested a response, we will make sure to get back to you shortly.

Please fill in the required fields in your feedback submission.