Borrow it
Coverart for item
The Resource Stochastic network optimization with application to communication and queueing systems, Michael J. Neely, (electronic book)

Stochastic network optimization with application to communication and queueing systems, Michael J. Neely, (electronic book)

Creator
Summary
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
Language
eng
Work
Publication
Extent
1 electronic text (xii, 199 p. : ill.)
Contents
  • 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 --
Isbn
9781608454556
Instance
Label
Stochastic network optimization with application to communication and queueing systems
Title
Stochastic network optimization with application to communication and queueing systems
Statement of responsibility
Michael J. Neely
Creator
Subject
Language
eng
Summary
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
Cataloging source
CaBNvSL
http://library.link/vocab/creatorName
Neely, Michael J
Illustrations
illustrations
Index
no index present
Literary form
non fiction
Nature of contents
  • dictionaries
  • abstracts summaries
  • bibliography
Series statement
  • Synthesis digital library of engineering and computer science.
  • Synthesis lectures on communication networks
Series volume
7.
http://library.link/vocab/subjectName
  • Dynamic programming
  • Queuing networks (Data transmission)
  • Stochastic systems
  • Lyapunov functions
Target audience
  • adult
  • specialized
Label
Stochastic network optimization with application to communication and queueing systems, Michael J. Neely, (electronic book)
Instantiates
Publication
Bibliography note
Includes bibliographical references (p. 181-198)
Carrier category
online resource
Carrier category code
  • cr
Carrier MARC source
rdacarrier
Color
multicolored
Content category
text
Content type code
  • txt
Content type MARC source
rdacontent
Contents
  • 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 --
Dimensions
unknown
Extent
1 electronic text (xii, 199 p. : ill.)
File format
multiple file formats
Form of item
electronic
Isbn
9781608454556
Issn
1935-4193
Media category
computer
Media MARC source
rdamedia
Media type code
  • c
Other physical details
digital file.
Reformatting quality
access
Specific material designation
remote
System details
System requirements: Adobe Acrobat Reader
Label
Stochastic network optimization with application to communication and queueing systems, Michael J. Neely, (electronic book)
Publication
Bibliography note
Includes bibliographical references (p. 181-198)
Carrier category
online resource
Carrier category code
  • cr
Carrier MARC source
rdacarrier
Color
multicolored
Content category
text
Content type code
  • txt
Content type MARC source
rdacontent
Contents
  • 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 --
Dimensions
unknown
Extent
1 electronic text (xii, 199 p. : ill.)
File format
multiple file formats
Form of item
electronic
Isbn
9781608454556
Issn
1935-4193
Media category
computer
Media MARC source
rdamedia
Media type code
  • c
Other physical details
digital file.
Reformatting quality
access
Specific material designation
remote
System details
System requirements: Adobe Acrobat Reader

Subject

Member of

Library Locations

Library Links

Structured data from the Bibframe namespace is licensed under the Creative Commons Attribution 4.0 International License by University of Liverpool. Additional terms may apply to data associated with third party namespaces.
Processing Feedback ...