Stochastic Network Optimization with Application to Communication and Queueing Systems (Record no. 85407)

000 -LEADER
fixed length control field 03770nam a22005415i 4500
001 - CONTROL NUMBER
control field 978-3-031-79995-2
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20240730164208.0
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 220601s2010 sz | s |||| 0|eng d
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
ISBN 9783031799952
-- 978-3-031-79995-2
082 04 - CLASSIFICATION NUMBER
Call Number 006.3
100 1# - AUTHOR NAME
Author Neely, Michael.
245 10 - TITLE STATEMENT
Title Stochastic Network Optimization with Application to Communication and Queueing Systems
250 ## - EDITION STATEMENT
Edition statement 1st ed. 2010.
300 ## - PHYSICAL DESCRIPTION
Number of Pages XII, 199 p.
490 1# - SERIES STATEMENT
Series statement Synthesis Lectures on Learning, Networks, and Algorithms,
505 0# - FORMATTED CONTENTS NOTE
Remark 2 Introduction -- Introduction to Queues -- Dynamic Scheduling Example -- Optimizing Time Averages -- Optimizing Functions of Time Averages -- Approximate Scheduling -- Optimization of Renewal Systems -- Conclusions.
520 ## - SUMMARY, ETC.
Summary, etc 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.
856 40 - ELECTRONIC LOCATION AND ACCESS
Uniform Resource Identifier https://doi.org/10.1007/978-3-031-79995-2
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Koha item type eBooks
264 #1 -
-- Cham :
-- Springer International Publishing :
-- Imprint: Springer,
-- 2010.
336 ## -
-- text
-- txt
-- rdacontent
337 ## -
-- computer
-- c
-- rdamedia
338 ## -
-- online resource
-- cr
-- rdacarrier
347 ## -
-- text file
-- PDF
-- rda
650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Artificial intelligence.
650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Cooperating objects (Computer systems).
650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Programming languages (Electronic computers).
650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Telecommunication.
650 14 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Artificial Intelligence.
650 24 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Cyber-Physical Systems.
650 24 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Programming Language.
650 24 - SUBJECT ADDED ENTRY--SUBJECT 1
-- Communications Engineering, Networks.
830 #0 - SERIES ADDED ENTRY--UNIFORM TITLE
-- 2690-4314
912 ## -
-- ZDB-2-SXSC

No items available.