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.

Direct and to the point, this book from one of the field's leaders covers Brownian motion and stochastic calculus at the graduate level, and illustrates the use of that theory in various application domains, emphasizing business and economics. The mathematical development is narrowly focused and briskly paced, with many concrete calculations and a minimum of abstract notation. The applications discussed include: the role of reflected Brownian motion as a storage model, queueing model, or inventory model; optimal stopping problems for Brownian motion, including the influential McDonald-Siegel investment model; optimal control of Brownian motion via barrier policies, including optimal control of Brownian storage systems; and Brownian models of dynamic inference, also called Brownian learning models, or Brownian filtering models.