Stochastic network optimization with application to communication and queueing systems
By: Michael J. Neely
Series: Synthesis lectures on communication networks -- # 7
Publisher: Morgan & Claypool
Published: 2010
Place of publication: San Rafael, Calif. (1537 Fourth Street, San Rafael, CA 94901 USA)
Language: eng
Format: [electronic resource] /
ISBN-13: 9781608454563; 9781608454556
Subjects: Queuing networks (Data transmission); Lyapunov functions; Stochastic systems; Dynamic programming
Other titles: Synthesis digital library of engineering and computer science.
Description: This text presents a modern theory of analysis, control, and optimization for dynamic networks. Mathematical techniques of Lyapunov drift and Lyapunov optimization are developed and shown to enable constrained optimization of time averages in general stochastic systems. The focus is on communication and queueing systems, including wireless networks with time-varying channels, mobility, and randomly arriving traffic. A simple drift-plus-penalty framework is used to optimize time averages such as throughput, throughput-utility, power, and distortion. Explicit performance-delay tradeoffs are provided to illustrate the cost of approaching optimality. This theory is also applicable to problems in operations research and economics, where energy-efficient and profit-maximizing decisions must be made without knowing the future.
Notes: Part of: Synthesis digital library of engineering and computer science.

Series from website.

Includes bibliographical references (p. 181-198).

Abstract freely available; full-text restricted to subscribers or individual document purchasers.

Also available in print.

Mode of access: World Wide Web.

System requirements: Adobe Acrobat Reader.
Table of contents: title: 1. Introduction; title: Example opportunistic scheduling problem; title: General stochastic optimization problems; title: Lyapunov drift and Lyapunov optimization; title: Differences from our earlier text; title: Alternative approaches; title: On general Markov decision problems; title: On network delay; title: Preliminaries; title: 2. Introduction to queues; title: Rate stability; title: Stronger forms of stability; title: Randomized scheduling for rate stability; title: Exercises; title: 3. Dynamic scheduling example; title: Scheduling for stability; title: Stability and average power minimization; title: Generalizations; title: 4. Optimizing time averages; title: Lyapunov drift and Lyapunov optimization; title: General system model; title: Optimality via [omega]-only policies; title: Virtual queues; title: The min drift-plus-penalty algorithm; title: Examples; title: Variable V algorithms; title: Place-holder backlog; title: Non-i.i.d. models and universal scheduling; title: Exercises; title: Appendix 4.A, proving theorem 4.5; title: 5. Optimizing functions of time averages; title: Solving the transformed problem; title: A flow-based network model; title: Multi-hop queueing networks; title: General optimization of convex functions of time averages; title: Non-convex stochastic optimization; title: Worst case delay; title: Alternative fairness metrics; title: Exercises; title: 6. Approximate scheduling; title: Time-invariant interference networks; title: Multiplicative factor approximations; title: 7. Optimization of renewal systems; title: The renewal system model; title: Drift-plus-penalty for renewal systems; title: Minimizing the drift-plus-penalty ratio; title: Task processing example; title: Utility optimization for renewal systems; title: Dynamic programming examples; title: Exercises; title: 8. Conclusions; title: Bibliography; title: Author's biography.