Stochastic Network Optimization with Application to Communication and Queueing Systems

Stochastic Network Optimization with Application to Communication and Queueing Systems

Michael Neely
ISBN: 9781608454556 | PDF ISBN: 9781608454563
Copyright © 2010 | 211 Pages | Publication Date: 01/01/2010

BEFORE YOU ORDER: You may have Academic or Corporate access to this title. Click here to find out: 10.2200/S00271ED1V01Y201006CNT007

Ordering Options: Paperback $45.00   E-book $36.00   Paperback & E-book Combo $56.25


Why pay full price? Members receive 15% off all orders.
Learn More Here

Read Our Digital Content License Agreement (pop-up)

Purchasing Options:



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. Topics in the text include the following:

* Queue stability theory
* Backpressure, max-weight, and virtual queue methods
* Primal-dual methods for non-convex stochastic utility maximization
* Universal scheduling theory for arbitrary sample paths
* Approximate and randomized scheduling theory
* Optimization of renewal systems and Markov decision systems

Detailed examples and numerous problem set questions are provided to reinforce the main concepts.

Table of Contents

Introduction
Introduction to Queues
Dynamic Scheduling Example
Optimizing Time Averages
Optimizing Functions of Time Averages
Approximate Scheduling
Optimization of Renewal Systems
Conclusions

About the Author(s)

Michael Neely, University of Southern California
Michael J. Neely received B.S. degrees in both Electrical Engineering and Mathematics from the University of Maryland, College Park, in 1997. He then received a 3 year Department of Defense NDSEG Fellowship for graduate study at the Massachusetts Institute of Technology, where he completed the M.S. degree in 1999 and the Ph.D. in 2003, both in Electrical Engineering. He joined the faculty of Electrical Engineering at the University of Southern California in 2004, where he is currently an Associate Professor. His research interests are in the areas of stochastic network optimization and queueing theory, with applications to wireless networks, mobile ad-hoc networks, and switching systems. Michael received the NSF Career award in 2008 and the Viterbi School of Engineering Junior Research Award in 2009. He is a member of Tau Beta Pi and Phi Beta Kappa.

Reviews
Browse by Subject
Case Studies in Engineering
ACM Books
IOP Concise Physics
SEM Books
0 items
LATEST NEWS

Newsletter
Note: Registered customers go to: Your Account to subscribe.

E-Mail Address:

Your Name: