《複雜網路控制技術》是2009年4月高等教育出版社出版的圖書，作者是邁恩。本書著眼於複雜網路系統中的共性問題，綜合了作者多年來在該方向深入、系統的研究成果，給出了建立網路模型所需要的工具和哲學思想，詳細具體地把握了其動力學本質，同時簡明地揭示了有效控制的解決方案及其分析。
基本介紹
- 書名：複雜網路控制技術
- 作者：邁恩
- 出版社：高等教育出版社
- 出版時間：2009年4月
- 定價：66 元
- 開本：16 開
- ISBN：9787040254815
內容簡介,作者簡介,圖書目錄,
內容簡介
《複雜網路控制技術》內容分為三個部分：第一部分為建模與控制，第二部分為負荷調度，第三部分為穩定性及性能分析。
作者簡介
Sean Meyn，伊利諾斯大學電子與計算機工程系教授，IEEE Fellow。擔任系統與控制、套用機率等領域多個期刊的編委。與他人合著的圖書Markov Chains and Stochastic Stability獲1994年ORSA/TIMS最佳著作獎。在MIT4 UTRC等世界各地多個大學擔任客座教授。他的研究興趣包括隨機過程、最最佳化、複雜網路以及資訊理論等。
圖書目錄
List of Illustrations
Preface
Dedication
1 Introduction
1.1 Networks in practice
1.2 Mathematical models
1.3 What do you need to know to read this book?
1.4 Notes
Part I: Modeling and Control
2 Examples
2.1 Modeling the single server queue
2.2 Klimov model
2.3 Capacity and queueing in communication systems
2.4 Multiple-access communication
2.5 Processor sharing model
2.6 Inventory model
2.7 Power transmission network
2.8 Optimization in a simple re-entrant line
2.9 Contention for resources and instability
2.10 Routing model
2.11 Braess' paradox
2.12 Notes
3 The Single Server Queue
3.1 Representations
3.2 Approximations
3.3 Stability
3.4 Invariance equations
3.5 Big queues
3.6 Model selection
3.7 Notes
Exercises
4 Scheduling
4.1 Controlled random-walk model
4.2 Fluid model
4.3 Control techniques for the fluid model
4.4 Comparing fluid and stochastic models
4.5 Structure of optimal policies
4.6 Safety-stocks
4.7 Discrete review
4.8 MaxWeight and MinDrift
4.9 Perturbed value function
4.10 Notes
Exercises
Part II: Workload
5 Workload and Scheduling
5.1 Single server queue
5.2 Workload for the CRW scheduling model
5.3 Relaxations for the fluid model
5.4 Stochastic workload models
5.5 Pathwise optimality and workload
5.6 Hedging in networks
5.7 Notes
Exercises
6 Routing and Resource Pooling
6.1 Workload in general models
6.2 Resource pooling
6.3 Routing and workload
6.4 MaxWeight for routing and scheduling
6.5 Simultaneous resource possession
6.6 Workload relaxations
6.7 Relaxations and policy synthesis for stochastic models
6.8 Notes
Exercises
7 Demand
7.1 Network models
7.2 Transients
7.3 Workload relaxations
7.4 Hedging in a simple inventory model
7.5 Hedging in networks
7.6 Summary of steady-state control techniques
7.7 Notes
Exercises
Part III: Stability and Performance
8 Foster-Lyapunov Techniques
8.1 Lyapunov functions
8.2 Lyapunov functions for networks
8.3 Discrete review
8.4 MaxWeight
8.5 MaxWeight and the average-cost optimality equation
8.6 Linear programs for performance bounds
8.7 Brownian workload model
8.8 Notes
Exercises
9 Optimization
9.1 Reachability and decomposibility
9.2 Linear programming formulations
9.3 Multiobjective optimization
9.4 Optimality equations
9.5 Algorithms
9.6 Optimization in networks
9.7 One-dimensional inventory model
9.8 Hedging and workload
9.9 Notes
Exercises
10 ODE Methods
10.1 Examples
10.2 Mathematical preliminaries
10.3 Fluid limit model
10.4 Fluid-scale stability
10.5 Safety stocks and trajectory tracking
10.6 Fluid-scale asymptotic optimality
10.7 Brownian workload model
10.8 Notes
Exercises
11 Simulation and Learning
11.1 Deciding when to stop
11.2 Asymptotic theory for Markov models
11.3 The single-server queue
11.4 Control variates and shadow functions
11.5 Estimating a value function
11.6 Notes
Exercises
Appendix Markov Models
Bibliography
Index
……
