Control techniques for complex networks:
"Power grids, flexible manufacturing, cellular communications: interconnectedness has consequences. This book gives the tools and philosophy you need to build network models detailed enough to capture essential dynamics but simple enough to expose the structure of effective control solutions an...
Gespeichert in:
1. Verfasser: | |
---|---|
Format: | Buch |
Sprache: | English |
Veröffentlicht: |
Cambridge [u.a.]
Cambridge Univ. Press
2008
|
Ausgabe: | 1. publ. |
Schlagworte: | |
Online-Zugang: | Inhaltsverzeichnis Beschreibung für Leser Beschreibung für Leser Contributor biographical information Table of contents only Publisher description Inhaltsverzeichnis Klappentext |
Zusammenfassung: | "Power grids, flexible manufacturing, cellular communications: interconnectedness has consequences. This book gives the tools and philosophy you need to build network models detailed enough to capture essential dynamics but simple enough to expose the structure of effective control solutions and to clarify analysis." "Core chapters assume only prior exposure to stochastic processes and linear algebra at the undergraduate level; later chapters are for advanced graduate students and researchers/practitioners. This gradual development bridges classical theory with the state of the art. The workload model that is the basis of traditional analysis of the single queue becomes a foundation for workload relaxations used in the treatment of complex networks. Lyapunov functions and dynamic programming equations lead to the celebrated MaxWeight policy along with many generalizations, other topics include methods for synthesizing hedging and safety stocks, stability theory for networks, and techniques for accelerated simulation."--BOOK JACKET. |
Beschreibung: | Includes bibliographical references (p. 537-558) and index |
Beschreibung: | XVI, 562 S. graph. Darst. 27 cm |
ISBN: | 9780521884419 0521884411 |
Internformat
MARC
LEADER | 00000nam a2200000zc 4500 | ||
---|---|---|---|
001 | BV023290856 | ||
003 | DE-604 | ||
005 | 20091116 | ||
007 | t | ||
008 | 080506s2008 xxkd||| |||| 00||| eng d | ||
010 | |a 2007035250 | ||
020 | |a 9780521884419 |c hardback |9 978-0-521-88441-9 | ||
020 | |a 0521884411 |c hardback |9 0-521-88441-1 | ||
035 | |a (OCoLC)170202900 | ||
035 | |a (DE-599)BVBBV023290856 | ||
040 | |a DE-604 |b ger |e aacr | ||
041 | 0 | |a eng | |
044 | |a xxk |c GB | ||
049 | |a DE-20 |a DE-473 |a DE-739 |a DE-634 |a DE-12 |a DE-11 |a DE-824 |a DE-83 |a DE-M347 | ||
050 | 0 | |a TK5105.5 | |
082 | 0 | |a 004.6 | |
084 | |a SK 880 |0 (DE-625)143266: |2 rvk | ||
084 | |a 93C83 |2 msc | ||
084 | |a 94C99 |2 msc | ||
100 | 1 | |a Meyn, Sean P. |d 1958- |e Verfasser |0 (DE-588)113538537 |4 aut | |
245 | 1 | 0 | |a Control techniques for complex networks |c Sean Meyn |
250 | |a 1. publ. | ||
264 | 1 | |a Cambridge [u.a.] |b Cambridge Univ. Press |c 2008 | |
300 | |a XVI, 562 S. |b graph. Darst. |c 27 cm | ||
336 | |b txt |2 rdacontent | ||
337 | |b n |2 rdamedia | ||
338 | |b nc |2 rdacarrier | ||
500 | |a Includes bibliographical references (p. 537-558) and index | ||
520 | 1 | |a "Power grids, flexible manufacturing, cellular communications: interconnectedness has consequences. This book gives the tools and philosophy you need to build network models detailed enough to capture essential dynamics but simple enough to expose the structure of effective control solutions and to clarify analysis." "Core chapters assume only prior exposure to stochastic processes and linear algebra at the undergraduate level; later chapters are for advanced graduate students and researchers/practitioners. This gradual development bridges classical theory with the state of the art. The workload model that is the basis of traditional analysis of the single queue becomes a foundation for workload relaxations used in the treatment of complex networks. Lyapunov functions and dynamic programming equations lead to the celebrated MaxWeight policy along with many generalizations, other topics include methods for synthesizing hedging and safety stocks, stability theory for networks, and techniques for accelerated simulation."--BOOK JACKET. | |
650 | 4 | |a Computer networks | |
650 | 4 | |a Control theory | |
650 | 0 | 7 | |a Rechnernetz |0 (DE-588)4070085-9 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Kontrolltheorie |0 (DE-588)4032317-1 |2 gnd |9 rswk-swf |
689 | 0 | 0 | |a Rechnernetz |0 (DE-588)4070085-9 |D s |
689 | 0 | 1 | |a Kontrolltheorie |0 (DE-588)4032317-1 |D s |
689 | 0 | |5 DE-604 | |
856 | 4 | |u http://catdir.loc.gov/catdir/enhancements/fy0743/2007035250-t.html |3 Inhaltsverzeichnis | |
856 | 4 | |u http://catdir.loc.gov/catdir/enhancements/fy0803/2007035250-d.html |3 Beschreibung für Leser | |
856 | 4 | |u http://catdir.loc.gov/catdir/enhancements/fy0743/2007035250-b.html |3 Beschreibung für Leser | |
856 | 4 | |u http://www.loc.gov/catdir/enhancements/fy0743/2007035250-b.html |3 Contributor biographical information | |
856 | 4 | |u http://www.loc.gov/catdir/enhancements/fy0743/2007035250-t.html |3 Table of contents only | |
856 | 4 | |u http://www.loc.gov/catdir/enhancements/fy0803/2007035250-d.html |3 Publisher description | |
856 | 4 | 2 | |m Digitalisierung UB Passau |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=016475471&sequence=000003&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
856 | 4 | 2 | |m Digitalisierung UB Passau |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=016475471&sequence=000004&line_number=0002&func_code=DB_RECORDS&service_type=MEDIA |3 Klappentext |
999 | |a oai:aleph.bib-bvb.de:BVB01-016475471 |
Datensatz im Suchindex
_version_ | 1804137614142341120 |
---|---|
adam_text | Contents
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
5
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
page
ix
xiii
xvii
1
2
7
10
21
23
25
25
31
34
34
36
37
37
39
43
46
49
50
52
55
58
62
66
76
80
82
82
vi
Contents
4
Scheduling
87
4.1
Controlled random-walk model
89
4.2
Fluid model
97
4.3
Control techniques for the fluid model
103
4.4
Comparing fluid and stochastic models
115
4.5
Structure of optimal policies
119
4.6
Safety-stocks
122
4.7
Discrete review
128
4.8
MaxWeight and MinDrift
131
4.9
Perturbed value function
134
4.10
Notes
138
Exercises
139
Part II: Workload
143
5
Workload and Scheduling
145
5.1
Single server queue
146
5.2
Workload for the CRW scheduling model
149
5.3
Relaxations for the fluid model
153
5.4
Stochastic workload models
172
5.5
Pathwise optimality and workload
178
5.6
Hedging in networks
183
5.7
Notes
192
Exercises
193
6
Routing and Resource Pooling
195
6.1
Workload in general models
198
6.2
Resource pooling
204
6.3
Routing and workload
209
6.4
MaxWeight for routing and scheduling
215
6.5
Simultaneous resource possession
218
6.6
Workload relaxations
221
6.7
Relaxations and policy synthesis for stochastic models
233
6.8
Notes
240
Exercises
242
7
Demand
246
7.1
Network models
249
7.2
Transients
255
7.3
Workload relaxations
267
7.4
Hedging in a simple inventory model
274
7.5
Hedging in networks
280
7.6
Summary of steady-state control techniques
291
7.7
Notes
292
Exercises
293
Contents
vii
Part III: Stability and Performance
295
8
Foster-Lyapunov Techniques
297
8.1
Lyapunov functions
302
8.2
Lyapunov functions for networks
305
8.3
Discrete review
315
8.4
MaxWeight
319
8.5
MaxWeight and the average-cost optimality equation
325
8.6
Linear programs for performance bounds
328
8.7
Brownian workload model
336
8.8
Notes
342
Exercises
343
9
Optimization
348
9.1
Reachability and decomposibility
352
9.2
Linear programming formulations
354
9.3
Multiobjective optimization
362
9.4
Optimality equations
365
9.5
Algorithms
375
9.6
Optimization in networks
381
9.7
One-dimensional inventory model
385
9.8
Hedging and workload
391
9.9
Notes
402
Exercises
404
10
ODE Methods
407
10.1
Examples
412
10.2
Mathematical preliminaries
416
10.3
Fluid limit model
419
10.4
Fluid-scale stability
423
10.5
Safety stocks and trajectory tracking
431
10.6
Fluid-scale asymptotic optimality
437
10.7
Brownian workload model
443
10.8
Notes
448
Exercises
450
11
Simulation and Learning
452
11.1
Deciding when to stop
458
11.2
Asymptotic theory for Markov models
461
11.3
The single-server queue
465
11.4
Control
variâtes
and shadow functions
470
11.5
Estimating a value function
483
11.6
Notes
498
Exercises
499
viii Contents
Appendix
Markov
Models 505
Bibliography
537
Index 559
і^ЯМ^ИіІІЕІИІШВВ
^вЯіШіТі^
віїШ
ііІІїШі^^
|
adam_txt |
Contents
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
5
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
page
ix
xiii
xvii
1
2
7
10
21
23
25
25
31
34
34
36
37
37
39
43
46
49
50
52
55
58
62
66
76
80
82
82
vi
Contents
4
Scheduling
87
4.1
Controlled random-walk model
89
4.2
Fluid model
97
4.3
Control techniques for the fluid model
103
4.4
Comparing fluid and stochastic models
115
4.5
Structure of optimal policies
119
4.6
Safety-stocks
122
4.7
Discrete review
128
4.8
MaxWeight and MinDrift
131
4.9
Perturbed value function
134
4.10
Notes
138
Exercises
139
Part II: Workload
143
5
Workload and Scheduling
145
5.1
Single server queue
146
5.2
Workload for the CRW scheduling model
149
5.3
Relaxations for the fluid model
153
5.4
Stochastic workload models
172
5.5
Pathwise optimality and workload
178
5.6
Hedging in networks
183
5.7
Notes
192
Exercises
193
6
Routing and Resource Pooling
195
6.1
Workload in general models
198
6.2
Resource pooling
204
6.3
Routing and workload
209
6.4
MaxWeight for routing and scheduling
215
6.5
Simultaneous resource possession
218
6.6
Workload relaxations
221
6.7
Relaxations and policy synthesis for stochastic models
233
6.8
Notes
240
Exercises
242
7
Demand
246
7.1
Network models
249
7.2
Transients
255
7.3
Workload relaxations
267
7.4
Hedging in a simple inventory model
274
7.5
Hedging in networks
280
7.6
Summary of steady-state control techniques
291
7.7
Notes
292
Exercises
293
Contents
vii
Part III: Stability and Performance
295
8
Foster-Lyapunov Techniques
297
8.1
Lyapunov functions
302
8.2
Lyapunov functions for networks
305
8.3
Discrete review
315
8.4
MaxWeight
319
8.5
MaxWeight and the average-cost optimality equation
325
8.6
Linear programs for performance bounds
328
8.7
Brownian workload model
336
8.8
Notes
342
Exercises
343
9
Optimization
348
9.1
Reachability and decomposibility
352
9.2
Linear programming formulations
354
9.3
Multiobjective optimization
362
9.4
Optimality equations
365
9.5
Algorithms
375
9.6
Optimization in networks
381
9.7
One-dimensional inventory model
385
9.8
Hedging and workload
391
9.9
Notes
402
Exercises
404
10
ODE Methods
407
10.1
Examples
412
10.2
Mathematical preliminaries
416
10.3
Fluid limit model
419
10.4
Fluid-scale stability
423
10.5
Safety stocks and trajectory tracking
431
10.6
Fluid-scale asymptotic optimality
437
10.7
Brownian workload model
443
10.8
Notes
448
Exercises
450
11
Simulation and Learning
452
11.1
Deciding when to stop
458
11.2
Asymptotic theory for Markov models
461
11.3
The single-server queue
465
11.4
Control
variâtes
and shadow functions
470
11.5
Estimating a value function
483
11.6
Notes
498
Exercises
499
viii Contents
Appendix
Markov
Models 505
Bibliography
537
Index 559
і^ЯМ^ИіІІЕІИІШВВ
^вЯіШіТі^
віїШ
ііІІїШі^^ |
any_adam_object | 1 |
any_adam_object_boolean | 1 |
author | Meyn, Sean P. 1958- |
author_GND | (DE-588)113538537 |
author_facet | Meyn, Sean P. 1958- |
author_role | aut |
author_sort | Meyn, Sean P. 1958- |
author_variant | s p m sp spm |
building | Verbundindex |
bvnumber | BV023290856 |
callnumber-first | T - Technology |
callnumber-label | TK5105 |
callnumber-raw | TK5105.5 |
callnumber-search | TK5105.5 |
callnumber-sort | TK 45105.5 |
callnumber-subject | TK - Electrical and Nuclear Engineering |
classification_rvk | SK 880 |
ctrlnum | (OCoLC)170202900 (DE-599)BVBBV023290856 |
dewey-full | 004.6 |
dewey-hundreds | 000 - Computer science, information, general works |
dewey-ones | 004 - Computer science |
dewey-raw | 004.6 |
dewey-search | 004.6 |
dewey-sort | 14.6 |
dewey-tens | 000 - Computer science, information, general works |
discipline | Informatik Mathematik |
discipline_str_mv | Informatik Mathematik |
edition | 1. publ. |
format | Book |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03703nam a2200565zc 4500</leader><controlfield tag="001">BV023290856</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20091116 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">080506s2008 xxkd||| |||| 00||| eng d</controlfield><datafield tag="010" ind1=" " ind2=" "><subfield code="a">2007035250</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780521884419</subfield><subfield code="c">hardback</subfield><subfield code="9">978-0-521-88441-9</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0521884411</subfield><subfield code="c">hardback</subfield><subfield code="9">0-521-88441-1</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)170202900</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV023290856</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">aacr</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="044" ind1=" " ind2=" "><subfield code="a">xxk</subfield><subfield code="c">GB</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-20</subfield><subfield code="a">DE-473</subfield><subfield code="a">DE-739</subfield><subfield code="a">DE-634</subfield><subfield code="a">DE-12</subfield><subfield code="a">DE-11</subfield><subfield code="a">DE-824</subfield><subfield code="a">DE-83</subfield><subfield code="a">DE-M347</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">TK5105.5</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">004.6</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SK 880</subfield><subfield code="0">(DE-625)143266:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">93C83</subfield><subfield code="2">msc</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">94C99</subfield><subfield code="2">msc</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Meyn, Sean P.</subfield><subfield code="d">1958-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)113538537</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Control techniques for complex networks</subfield><subfield code="c">Sean Meyn</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">1. publ.</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge [u.a.]</subfield><subfield code="b">Cambridge Univ. Press</subfield><subfield code="c">2008</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XVI, 562 S.</subfield><subfield code="b">graph. Darst.</subfield><subfield code="c">27 cm</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Includes bibliographical references (p. 537-558) and index</subfield></datafield><datafield tag="520" ind1="1" ind2=" "><subfield code="a">"Power grids, flexible manufacturing, cellular communications: interconnectedness has consequences. This book gives the tools and philosophy you need to build network models detailed enough to capture essential dynamics but simple enough to expose the structure of effective control solutions and to clarify analysis." "Core chapters assume only prior exposure to stochastic processes and linear algebra at the undergraduate level; later chapters are for advanced graduate students and researchers/practitioners. This gradual development bridges classical theory with the state of the art. The workload model that is the basis of traditional analysis of the single queue becomes a foundation for workload relaxations used in the treatment of complex networks. Lyapunov functions and dynamic programming equations lead to the celebrated MaxWeight policy along with many generalizations, other topics include methods for synthesizing hedging and safety stocks, stability theory for networks, and techniques for accelerated simulation."--BOOK JACKET.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer networks</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Control theory</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Rechnernetz</subfield><subfield code="0">(DE-588)4070085-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Kontrolltheorie</subfield><subfield code="0">(DE-588)4032317-1</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Rechnernetz</subfield><subfield code="0">(DE-588)4070085-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Kontrolltheorie</subfield><subfield code="0">(DE-588)4032317-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="856" ind1="4" ind2=" "><subfield code="u">http://catdir.loc.gov/catdir/enhancements/fy0743/2007035250-t.html</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="856" ind1="4" ind2=" "><subfield code="u">http://catdir.loc.gov/catdir/enhancements/fy0803/2007035250-d.html</subfield><subfield code="3">Beschreibung für Leser</subfield></datafield><datafield tag="856" ind1="4" ind2=" "><subfield code="u">http://catdir.loc.gov/catdir/enhancements/fy0743/2007035250-b.html</subfield><subfield code="3">Beschreibung für Leser</subfield></datafield><datafield tag="856" ind1="4" ind2=" "><subfield code="u">http://www.loc.gov/catdir/enhancements/fy0743/2007035250-b.html</subfield><subfield code="3">Contributor biographical information</subfield></datafield><datafield tag="856" ind1="4" ind2=" "><subfield code="u">http://www.loc.gov/catdir/enhancements/fy0743/2007035250-t.html</subfield><subfield code="3">Table of contents only</subfield></datafield><datafield tag="856" ind1="4" ind2=" "><subfield code="u">http://www.loc.gov/catdir/enhancements/fy0803/2007035250-d.html</subfield><subfield code="3">Publisher description</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">Digitalisierung UB Passau</subfield><subfield code="q">application/pdf</subfield><subfield code="u">http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=016475471&sequence=000003&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">Digitalisierung UB Passau</subfield><subfield code="q">application/pdf</subfield><subfield code="u">http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=016475471&sequence=000004&line_number=0002&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Klappentext</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-016475471</subfield></datafield></record></collection> |
id | DE-604.BV023290856 |
illustrated | Illustrated |
index_date | 2024-07-02T20:43:09Z |
indexdate | 2024-07-09T21:15:05Z |
institution | BVB |
isbn | 9780521884419 0521884411 |
language | English |
lccn | 2007035250 |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-016475471 |
oclc_num | 170202900 |
open_access_boolean | |
owner | DE-20 DE-473 DE-BY-UBG DE-739 DE-634 DE-12 DE-11 DE-824 DE-83 DE-M347 |
owner_facet | DE-20 DE-473 DE-BY-UBG DE-739 DE-634 DE-12 DE-11 DE-824 DE-83 DE-M347 |
physical | XVI, 562 S. graph. Darst. 27 cm |
publishDate | 2008 |
publishDateSearch | 2008 |
publishDateSort | 2008 |
publisher | Cambridge Univ. Press |
record_format | marc |
spelling | Meyn, Sean P. 1958- Verfasser (DE-588)113538537 aut Control techniques for complex networks Sean Meyn 1. publ. Cambridge [u.a.] Cambridge Univ. Press 2008 XVI, 562 S. graph. Darst. 27 cm txt rdacontent n rdamedia nc rdacarrier Includes bibliographical references (p. 537-558) and index "Power grids, flexible manufacturing, cellular communications: interconnectedness has consequences. This book gives the tools and philosophy you need to build network models detailed enough to capture essential dynamics but simple enough to expose the structure of effective control solutions and to clarify analysis." "Core chapters assume only prior exposure to stochastic processes and linear algebra at the undergraduate level; later chapters are for advanced graduate students and researchers/practitioners. This gradual development bridges classical theory with the state of the art. The workload model that is the basis of traditional analysis of the single queue becomes a foundation for workload relaxations used in the treatment of complex networks. Lyapunov functions and dynamic programming equations lead to the celebrated MaxWeight policy along with many generalizations, other topics include methods for synthesizing hedging and safety stocks, stability theory for networks, and techniques for accelerated simulation."--BOOK JACKET. Computer networks Control theory Rechnernetz (DE-588)4070085-9 gnd rswk-swf Kontrolltheorie (DE-588)4032317-1 gnd rswk-swf Rechnernetz (DE-588)4070085-9 s Kontrolltheorie (DE-588)4032317-1 s DE-604 http://catdir.loc.gov/catdir/enhancements/fy0743/2007035250-t.html Inhaltsverzeichnis http://catdir.loc.gov/catdir/enhancements/fy0803/2007035250-d.html Beschreibung für Leser http://catdir.loc.gov/catdir/enhancements/fy0743/2007035250-b.html Beschreibung für Leser http://www.loc.gov/catdir/enhancements/fy0743/2007035250-b.html Contributor biographical information http://www.loc.gov/catdir/enhancements/fy0743/2007035250-t.html Table of contents only http://www.loc.gov/catdir/enhancements/fy0803/2007035250-d.html Publisher description Digitalisierung UB Passau application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=016475471&sequence=000003&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis Digitalisierung UB Passau application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=016475471&sequence=000004&line_number=0002&func_code=DB_RECORDS&service_type=MEDIA Klappentext |
spellingShingle | Meyn, Sean P. 1958- Control techniques for complex networks Computer networks Control theory Rechnernetz (DE-588)4070085-9 gnd Kontrolltheorie (DE-588)4032317-1 gnd |
subject_GND | (DE-588)4070085-9 (DE-588)4032317-1 |
title | Control techniques for complex networks |
title_auth | Control techniques for complex networks |
title_exact_search | Control techniques for complex networks |
title_exact_search_txtP | Control techniques for complex networks |
title_full | Control techniques for complex networks Sean Meyn |
title_fullStr | Control techniques for complex networks Sean Meyn |
title_full_unstemmed | Control techniques for complex networks Sean Meyn |
title_short | Control techniques for complex networks |
title_sort | control techniques for complex networks |
topic | Computer networks Control theory Rechnernetz (DE-588)4070085-9 gnd Kontrolltheorie (DE-588)4032317-1 gnd |
topic_facet | Computer networks Control theory Rechnernetz Kontrolltheorie |
url | http://catdir.loc.gov/catdir/enhancements/fy0743/2007035250-t.html http://catdir.loc.gov/catdir/enhancements/fy0803/2007035250-d.html http://catdir.loc.gov/catdir/enhancements/fy0743/2007035250-b.html http://www.loc.gov/catdir/enhancements/fy0743/2007035250-b.html http://www.loc.gov/catdir/enhancements/fy0743/2007035250-t.html http://www.loc.gov/catdir/enhancements/fy0803/2007035250-d.html http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=016475471&sequence=000003&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=016475471&sequence=000004&line_number=0002&func_code=DB_RECORDS&service_type=MEDIA |
work_keys_str_mv | AT meynseanp controltechniquesforcomplexnetworks |
Es ist kein Print-Exemplar vorhanden.
Inhaltsverzeichnis