Processing Networks: Fluid Models and Stability | Agenda Bookshop Skip to content
Online orders placed from 19/12 onward will not arrive in time for Christmas.
Online orders placed from 19/12 onward will not arrive in time for Christmas.
A01=J. G. Dai
A01=J. Michael Harrison
Age Group_Uncategorized
Age Group_Uncategorized
Author_J. G. Dai
Author_J. Michael Harrison
automatic-update
Category1=Non-Fiction
Category=KCH
Category=KCHS
Category=KJT
Category=PBT
Category=PBWL
Category=UB
COP=United Kingdom
Delivery_Delivery within 10-20 working days
Language_English
PA=In stock
Price_€50 to €100
PS=Active
softlaunch

Processing Networks: Fluid Models and Stability

English

By (author): J. G. Dai J. Michael Harrison

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. See more
Current price €56.69
Original price €62.99
Save 10%
A01=J. G. DaiA01=J. Michael HarrisonAge Group_UncategorizedAuthor_J. G. DaiAuthor_J. Michael Harrisonautomatic-updateCategory1=Non-FictionCategory=KCHCategory=KCHSCategory=KJTCategory=PBTCategory=PBWLCategory=UBCOP=United KingdomDelivery_Delivery within 10-20 working daysLanguage_EnglishPA=In stockPrice_€50 to €100PS=Activesoftlaunch
Delivery/Collection within 10-20 working days
Product Details
  • Weight: 730g
  • Dimensions: 156 x 234mm
  • Publication Date: 15 Oct 2020
  • Publisher: Cambridge University Press
  • Publication City/Country: United Kingdom
  • Language: English
  • ISBN13: 9781108488891

About J. G. DaiJ. Michael Harrison

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 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.

Customer Reviews

Be the first to write a review
0%
(0)
0%
(0)
0%
(0)
0%
(0)
0%
(0)
We use cookies to ensure that we give you the best experience on our website. If you continue we'll assume that you are understand this. Learn more
Accept