000 03770nam a22005415i 4500
001 978-3-031-79995-2
003 DE-He213
005 20240730164208.0
007 cr nn 008mamaa
008 220601s2010 sz | s |||| 0|eng d
020 _a9783031799952
_9978-3-031-79995-2
024 7 _a10.1007/978-3-031-79995-2
_2doi
050 4 _aQ334-342
050 4 _aTA347.A78
072 7 _aUYQ
_2bicssc
072 7 _aCOM004000
_2bisacsh
072 7 _aUYQ
_2thema
082 0 4 _a006.3
_223
100 1 _aNeely, Michael.
_eauthor.
_4aut
_4http://id.loc.gov/vocabulary/relators/aut
_982791
245 1 0 _aStochastic Network Optimization with Application to Communication and Queueing Systems
_h[electronic resource] /
_cby Michael Neely.
250 _a1st ed. 2010.
264 1 _aCham :
_bSpringer International Publishing :
_bImprint: Springer,
_c2010.
300 _aXII, 199 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aSynthesis Lectures on Learning, Networks, and Algorithms,
_x2690-4314
505 0 _aIntroduction -- Introduction to Queues -- Dynamic Scheduling Example -- Optimizing Time Averages -- Optimizing Functions of Time Averages -- Approximate Scheduling -- Optimization of Renewal Systems -- Conclusions.
520 _aThis 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.
650 0 _aArtificial intelligence.
_93407
650 0 _aCooperating objects (Computer systems).
_96195
650 0 _aProgramming languages (Electronic computers).
_97503
650 0 _aTelecommunication.
_910437
650 1 4 _aArtificial Intelligence.
_93407
650 2 4 _aCyber-Physical Systems.
_932475
650 2 4 _aProgramming Language.
_939403
650 2 4 _aCommunications Engineering, Networks.
_931570
710 2 _aSpringerLink (Online service)
_982797
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783031799945
776 0 8 _iPrinted edition:
_z9783031799969
830 0 _aSynthesis Lectures on Learning, Networks, and Algorithms,
_x2690-4314
_982799
856 4 0 _uhttps://doi.org/10.1007/978-3-031-79995-2
912 _aZDB-2-SXSC
942 _cEBK
999 _c85407
_d85407