Cantitate/Preț
Produs

Stochastic Network Optimization with Application to Communication and Queueing Systems: Synthesis Lectures on Learning, Networks, and Algorithms

Autor Michael Neely
en Limba Engleză Paperback – 21 sep 2010
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 stochasticutility 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
Citește tot Restrânge

Din seria Synthesis Lectures on Learning, Networks, and Algorithms

Preț: 17358 lei

Preț vechi: 21697 lei
-20% Nou

Puncte Express: 260

Preț estimativ în valută:
3323 3454$ 2755£

Carte tipărită la comandă

Livrare economică 01-07 februarie 25

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783031799945
ISBN-10: 3031799941
Ilustrații: XII, 199 p.
Dimensiuni: 191 x 235 mm
Editura: Springer International Publishing
Colecția Springer
Seria Synthesis Lectures on Learning, Networks, and Algorithms

Locul publicării:Cham, Switzerland

Cuprins

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

Notă biografică

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.