Stochastic network optimization with application to communication and queueing systems
By: Neely, Michael J.
Material type:
BookSeries: Synthesis digital library of engineering and computer science: ; Synthesis lectures on communication networks: # 7.Publisher: San Rafael, Calif. (1537 Fourth Street, San Rafael, CA 94901 USA) : Morgan & Claypool, c2010Description: 1 electronic text (xii, 199 p. : ill.) : digital file.ISBN: 9781608454563 (electronic bk.).Subject(s): Dynamic programming | Queuing networks (Data transmission) | Stochastic systems | Lyapunov functions | dynamic scheduling | decision theory | wireless networks | Lyapunov optimization | congestion control | fairness | network utility maximization | multi-hop | mobile networks | routing | backpressure | max-weight | virtual queuesDDC classification: 519.703 Online resources: Abstract with links to resource Also available in print.| Item type | Current location | Call number | Status | Date due | Barcode | Item holds |
|---|---|---|---|---|---|---|
E books
|
PK Kelkar Library, IIT Kanpur | Available | EBKE288 |
Mode of access: World Wide Web.
System requirements: Adobe Acrobat Reader.
Part of: Synthesis digital library of engineering and computer science.
Series from website.
Includes bibliographical references (p. 181-198).
1. Introduction -- Example opportunistic scheduling problem -- General stochastic optimization problems -- Lyapunov drift and Lyapunov optimization -- Differences from our earlier text -- Alternative approaches -- On general Markov decision problems -- On network delay -- Preliminaries --
2. Introduction to queues -- Rate stability -- Stronger forms of stability -- Randomized scheduling for rate stability -- Exercises --
3. Dynamic scheduling example -- Scheduling for stability -- Stability and average power minimization -- Generalizations --
4. Optimizing time averages -- Lyapunov drift and Lyapunov optimization -- General system model -- Optimality via [omega]-only policies -- Virtual queues -- The min drift-plus-penalty algorithm -- Examples -- Variable V algorithms -- Place-holder backlog -- Non-i.i.d. models and universal scheduling -- Exercises -- Appendix 4.A, proving theorem 4.5 --
5. Optimizing functions of time averages -- Solving the transformed problem -- A flow-based network model -- Multi-hop queueing networks -- General optimization of convex functions of time averages -- Non-convex stochastic optimization -- Worst case delay -- Alternative fairness metrics -- Exercises --
6. Approximate scheduling -- Time-invariant interference networks -- Multiplicative factor approximations --
7. Optimization of renewal systems -- The renewal system model -- Drift-plus-penalty for renewal systems -- Minimizing the drift-plus-penalty ratio -- Task processing example -- Utility optimization for renewal systems -- Dynamic programming examples -- Exercises --
8. Conclusions -- Bibliography -- Author's biography.
Abstract freely available; full-text restricted to subscribers or individual document purchasers.
Compendex
INSPEC
Google scholar
Google book search
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.
Also available in print.
Title from PDF t.p. (viewed on October 13, 2010).
There are no comments for this item.