Analysis of queueing networks with blocking:
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Boston, Mass. [u.a.]
Kluwer Academic Publ.
2001
|
| Schriftenreihe: | International series in operations research & management science
31 |
| Schlagworte: | |
| Online-Zugang: | Inhaltsverzeichnis |
| Beschreibung: | Literaturangaben |
| Beschreibung: | X, 255 S. graph. Darst. |
| ISBN: | 0792379969 |
Internformat
MARC
| LEADER | 00000nam a2200000zcb4500 | ||
|---|---|---|---|
| 001 | BV022164604 | ||
| 003 | DE-604 | ||
| 005 | 20040302000000.0 | ||
| 007 | t | ||
| 008 | 020114s2001 d||| |||| 00||| eng d | ||
| 020 | |a 0792379969 |9 0-7923-7996-9 | ||
| 035 | |a (OCoLC)45136759 | ||
| 035 | |a (DE-599)BVBBV022164604 | ||
| 040 | |a DE-604 |b ger | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-706 | ||
| 050 | 0 | |a TK5105.5 | |
| 082 | 0 | |a 658.4/034 |2 21 | |
| 084 | |a SK 820 |0 (DE-625)143258: |2 rvk | ||
| 100 | 1 | |a Balsamo, Simonetta |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Analysis of queueing networks with blocking |c Simonetta Balsamo ; Vittoria de Nitto Personé ; Raif Onvural |
| 264 | 1 | |a Boston, Mass. [u.a.] |b Kluwer Academic Publ. |c 2001 | |
| 300 | |a X, 255 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a International series in operations research & management science |v 31 | |
| 500 | |a Literaturangaben | ||
| 650 | 7 | |a Computernetwerken |2 gtt | |
| 650 | 7 | |a Wachttijdproblemen |2 gtt | |
| 650 | 4 | |a Algorithms | |
| 650 | 4 | |a Blocking sets | |
| 650 | 4 | |a Computer networks | |
| 650 | 4 | |a Queuing theory | |
| 650 | 0 | 7 | |a Markov-Prozess |0 (DE-588)4134948-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Rechnernetz |0 (DE-588)4070085-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Warteschlangennetz |0 (DE-588)4225823-6 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Rechnernetz |0 (DE-588)4070085-9 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a Markov-Prozess |0 (DE-588)4134948-9 |D s |
| 689 | 1 | |5 DE-604 | |
| 689 | 2 | 0 | |a Warteschlangennetz |0 (DE-588)4225823-6 |D s |
| 689 | 2 | |5 DE-604 | |
| 700 | 1 | |a DeNitto Personé, Vittoria |e Verfasser |4 aut | |
| 700 | 1 | |a Onvural, Raif O. |e Verfasser |4 aut | |
| 830 | 0 | |a International series in operations research & management science |v 31 |w (DE-604)BV011630976 | |
| 856 | 4 | 2 | |m HBZ Datenaustausch |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=015379286&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-015379286 | ||
Datensatz im Suchindex
| _version_ | 1804136139562418176 |
|---|---|
| adam_text | CONTENTS
Preface ix
PART I QUEUEING NETWORK MODELS WITH
BLOCKING AND APPLICATIONS
1. Introduction 3
1.1 Commonly used probability distributions 4
1.2 Analysis of a single queue 6
1.3 Queueing networks 8
1.3.1 Product form solutions and BCMP theorem 9
1.3.2 Numerical solutions 12
1.3.3 Simulation 12
1.3.4 Approximate solutions 13
1.3.5 Performance metrics 13
1.4 Queueing networks with finite capacity queues 15
1.5 Bibliographical notes and references 16
1.5.1 Books on queueing theory and queueing systems 16
1.5.2 Surveys, tutorials and books on queueing networks with 17
blocking
1.5.3 Publications on queueing networks 17
2. Queueing networks with blocking 25
2.1 Single class networks 25
2.2 Blocking mechanisms 28
2.3 Blocking and state dependent routing 35
2.4 Multiclass queueing networks with finite capacity queues 35
2.5 Performance indices 37
2.6 Bibliographical notes 43
References 45
3. Application examples of queueing networks with 5i
blocking
References 59
PART II ANALYSIS OF QUEUEING NETWORKS
WITH BLOCKING
4. Exact analysis of Markovian networks 63
4.1 The Markov process as the network model 63
4.1.1 Repetitive Service Blocking Random Destination 65
4.1.2 Repetitive Service Blocking Fixed Destination 67
vi Contents
4.1.3 Blocking After Service 68
4.1.4 Blocking Before Service Server Occupied 73
4.1.5 Blocking Before Service Server Not Occupied 77
4.1.6 Blocking Before Service Overall 78
4.1.7 A simple example 80
4.1.8 Stop and Recirculate Blocking 83
4.1.9 Heterogeneous networks 86
4.2 Queue length distribution and average performance indices 89
4.3 Arrival time distribution 95
4.4 Cycle time distribution 97
4.5 Bibliographical notes 99
References 101
5. Exact analysis of special networks 103
5.1 Product form networks 103
5.1.1 Product form solution of the joint queue length 104
distribution
5.2 Algorithms for product form networks 110
5.2.1 Convolution algorithm 111
5.2.2 Performance indices 120
5.3 Symmetrical networks 123
5.3.1 Solution reduction technique 125
5.3.2 Performance indices 129
5.4 Arrival theorem 134
5.5 Bibliographical notes 136
References 138
6. Approximate and bound analysis 143
6.1 Introduction 143
6.2 Approximate analysis of closed networks 145
6.2.1 Approximate methods for cyclic networks 147
6.2.2 Approximate methods for arbitrary topology networks 154
6.3 Approximate analysis of open networks 158
6.3.1 Approximate methods for tandem networks 158
6.3.2 Approximate methods for acyclic and arbitrary 163
topology networks
6.4 Bound analysis 168
6.5 Bibliographical notes 170
References 172
PART III PROPERTIES OF NETWORKS WITH
BLOCKING
7. Equivalence, insensitivity and monotonicity 179
properties
7.1 Equivalence properties: state distribution and average performance 180
Contents vii
indices
7.1.1 Special equivalences 181
7.1.2 Equivalences between networks with and without 183
blocking
7.1.3 Equivalences between different blocking types 184
7.2 Equivalence properties: passage time distribution 195
7.3 Equivalence properties: fork/join networks 196
7.4 Insensitivity 201
7.5 Monotonicity 202
7.5.1 Performance comparison of blocking symmetrical 203
networks
7.6 Bibliographical notes 211
References 213
8. Buffer allocation in queueing networks with finite 217
capacities
8.1 Buffer allocation problem 218
8.2 An approximation algorithm for open networks with blocking 220
8.3 Dynamic programming approach 222
8.3.1 Forward problem 222
8.3.2 Backward problem 224
8.3.3 Algorithm 225
8.4 An extension 225
8.4.1 Forward problem 227
8.4.2 Backward problem 227
8.4.3 Algorithm 228
8.5 Validation 229
8.6 Bibliographical notes 232
References 233
References 235
Table of Symbols 249
Index 251
|
| adam_txt |
CONTENTS
Preface ix
PART I QUEUEING NETWORK MODELS WITH
BLOCKING AND APPLICATIONS
1. Introduction 3
1.1 Commonly used probability distributions 4
1.2 Analysis of a single queue 6
1.3 Queueing networks 8
1.3.1 Product form solutions and BCMP theorem 9
1.3.2 Numerical solutions 12
1.3.3 Simulation 12
1.3.4 Approximate solutions 13
1.3.5 Performance metrics 13
1.4 Queueing networks with finite capacity queues 15
1.5 Bibliographical notes and references 16
1.5.1 Books on queueing theory and queueing systems 16
1.5.2 Surveys, tutorials and books on queueing networks with 17
blocking
1.5.3 Publications on queueing networks 17
2. Queueing networks with blocking 25
2.1 Single class networks 25
2.2 Blocking mechanisms 28
2.3 Blocking and state dependent routing 35
2.4 Multiclass queueing networks with finite capacity queues 35
2.5 Performance indices 37
2.6 Bibliographical notes 43
References 45
3. Application examples of queueing networks with 5i
blocking
References 59
PART II ANALYSIS OF QUEUEING NETWORKS
WITH BLOCKING
4. Exact analysis of Markovian networks 63
4.1 The Markov process as the network model 63
4.1.1 Repetitive Service Blocking Random Destination 65
4.1.2 Repetitive Service Blocking Fixed Destination 67
vi Contents
4.1.3 Blocking After Service 68
4.1.4 Blocking Before Service Server Occupied 73
4.1.5 Blocking Before Service Server Not Occupied 77
4.1.6 Blocking Before Service Overall 78
4.1.7 A simple example 80
4.1.8 Stop and Recirculate Blocking 83
4.1.9 Heterogeneous networks 86
4.2 Queue length distribution and average performance indices 89
4.3 Arrival time distribution 95
4.4 Cycle time distribution 97
4.5 Bibliographical notes 99
References 101
5. Exact analysis of special networks 103
5.1 Product form networks 103
5.1.1 Product form solution of the joint queue length 104
distribution
5.2 Algorithms for product form networks 110
5.2.1 Convolution algorithm 111
5.2.2 Performance indices 120
5.3 Symmetrical networks 123
5.3.1 Solution reduction technique 125
5.3.2 Performance indices 129
5.4 Arrival theorem 134
5.5 Bibliographical notes 136
References 138
6. Approximate and bound analysis 143
6.1 Introduction 143
6.2 Approximate analysis of closed networks 145
6.2.1 Approximate methods for cyclic networks 147
6.2.2 Approximate methods for arbitrary topology networks 154
6.3 Approximate analysis of open networks 158
6.3.1 Approximate methods for tandem networks 158
6.3.2 Approximate methods for acyclic and arbitrary 163
topology networks
6.4 Bound analysis 168
6.5 Bibliographical notes 170
References 172
PART III PROPERTIES OF NETWORKS WITH
BLOCKING
7. Equivalence, insensitivity and monotonicity 179
properties
7.1 Equivalence properties: state distribution and average performance 180
Contents vii
indices
7.1.1 Special equivalences 181
7.1.2 Equivalences between networks with and without 183
blocking
7.1.3 Equivalences between different blocking types 184
7.2 Equivalence properties: passage time distribution 195
7.3 Equivalence properties: fork/join networks 196
7.4 Insensitivity 201
7.5 Monotonicity 202
7.5.1 Performance comparison of blocking symmetrical 203
networks
7.6 Bibliographical notes 211
References 213
8. Buffer allocation in queueing networks with finite 217
capacities
8.1 Buffer allocation problem 218
8.2 An approximation algorithm for open networks with blocking 220
8.3 Dynamic programming approach 222
8.3.1 Forward problem 222
8.3.2 Backward problem 224
8.3.3 Algorithm 225
8.4 An extension 225
8.4.1 Forward problem 227
8.4.2 Backward problem 227
8.4.3 Algorithm 228
8.5 Validation 229
8.6 Bibliographical notes 232
References 233
References 235
Table of Symbols 249
Index 251 |
| any_adam_object | 1 |
| any_adam_object_boolean | 1 |
| author | Balsamo, Simonetta DeNitto Personé, Vittoria Onvural, Raif O. |
| author_facet | Balsamo, Simonetta DeNitto Personé, Vittoria Onvural, Raif O. |
| author_role | aut aut aut |
| author_sort | Balsamo, Simonetta |
| author_variant | s b sb p v d pv pvd r o o ro roo |
| building | Verbundindex |
| bvnumber | BV022164604 |
| 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 820 |
| ctrlnum | (OCoLC)45136759 (DE-599)BVBBV022164604 |
| dewey-full | 658.4/034 |
| dewey-hundreds | 600 - Technology (Applied sciences) |
| dewey-ones | 658 - General management |
| dewey-raw | 658.4/034 |
| dewey-search | 658.4/034 |
| dewey-sort | 3658.4 234 |
| dewey-tens | 650 - Management and auxiliary services |
| discipline | Mathematik Wirtschaftswissenschaften |
| discipline_str_mv | Mathematik Wirtschaftswissenschaften |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02079nam a2200541zcb4500</leader><controlfield tag="001">BV022164604</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20040302000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">020114s2001 d||| |||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0792379969</subfield><subfield code="9">0-7923-7996-9</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)45136759</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV022164604</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-706</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">TK5105.5</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">658.4/034</subfield><subfield code="2">21</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SK 820</subfield><subfield code="0">(DE-625)143258:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Balsamo, Simonetta</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Analysis of queueing networks with blocking</subfield><subfield code="c">Simonetta Balsamo ; Vittoria de Nitto Personé ; Raif Onvural</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Boston, Mass. [u.a.]</subfield><subfield code="b">Kluwer Academic Publ.</subfield><subfield code="c">2001</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">X, 255 S.</subfield><subfield code="b">graph. Darst.</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="490" ind1="1" ind2=" "><subfield code="a">International series in operations research & management science</subfield><subfield code="v">31</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Literaturangaben</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Computernetwerken</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Wachttijdproblemen</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithms</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Blocking sets</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer networks</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Queuing theory</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Markov-Prozess</subfield><subfield code="0">(DE-588)4134948-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</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">Warteschlangennetz</subfield><subfield code="0">(DE-588)4225823-6</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=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">Markov-Prozess</subfield><subfield code="0">(DE-588)4134948-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="2" ind2="0"><subfield code="a">Warteschlangennetz</subfield><subfield code="0">(DE-588)4225823-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">DeNitto Personé, Vittoria</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Onvural, Raif O.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">International series in operations research & management science</subfield><subfield code="v">31</subfield><subfield code="w">(DE-604)BV011630976</subfield><subfield code="9"></subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">HBZ Datenaustausch</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=015379286&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-015379286</subfield></datafield></record></collection> |
| id | DE-604.BV022164604 |
| illustrated | Illustrated |
| index_date | 2024-07-02T16:19:20Z |
| indexdate | 2024-07-09T20:51:39Z |
| institution | BVB |
| isbn | 0792379969 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-015379286 |
| oclc_num | 45136759 |
| open_access_boolean | |
| owner | DE-706 |
| owner_facet | DE-706 |
| physical | X, 255 S. graph. Darst. |
| publishDate | 2001 |
| publishDateSearch | 2001 |
| publishDateSort | 2001 |
| publisher | Kluwer Academic Publ. |
| record_format | marc |
| series | International series in operations research & management science |
| series2 | International series in operations research & management science |
| spelling | Balsamo, Simonetta Verfasser aut Analysis of queueing networks with blocking Simonetta Balsamo ; Vittoria de Nitto Personé ; Raif Onvural Boston, Mass. [u.a.] Kluwer Academic Publ. 2001 X, 255 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier International series in operations research & management science 31 Literaturangaben Computernetwerken gtt Wachttijdproblemen gtt Algorithms Blocking sets Computer networks Queuing theory Markov-Prozess (DE-588)4134948-9 gnd rswk-swf Rechnernetz (DE-588)4070085-9 gnd rswk-swf Warteschlangennetz (DE-588)4225823-6 gnd rswk-swf Rechnernetz (DE-588)4070085-9 s DE-604 Markov-Prozess (DE-588)4134948-9 s Warteschlangennetz (DE-588)4225823-6 s DeNitto Personé, Vittoria Verfasser aut Onvural, Raif O. Verfasser aut International series in operations research & management science 31 (DE-604)BV011630976 HBZ Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=015379286&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Balsamo, Simonetta DeNitto Personé, Vittoria Onvural, Raif O. Analysis of queueing networks with blocking International series in operations research & management science Computernetwerken gtt Wachttijdproblemen gtt Algorithms Blocking sets Computer networks Queuing theory Markov-Prozess (DE-588)4134948-9 gnd Rechnernetz (DE-588)4070085-9 gnd Warteschlangennetz (DE-588)4225823-6 gnd |
| subject_GND | (DE-588)4134948-9 (DE-588)4070085-9 (DE-588)4225823-6 |
| title | Analysis of queueing networks with blocking |
| title_auth | Analysis of queueing networks with blocking |
| title_exact_search | Analysis of queueing networks with blocking |
| title_exact_search_txtP | Analysis of queueing networks with blocking |
| title_full | Analysis of queueing networks with blocking Simonetta Balsamo ; Vittoria de Nitto Personé ; Raif Onvural |
| title_fullStr | Analysis of queueing networks with blocking Simonetta Balsamo ; Vittoria de Nitto Personé ; Raif Onvural |
| title_full_unstemmed | Analysis of queueing networks with blocking Simonetta Balsamo ; Vittoria de Nitto Personé ; Raif Onvural |
| title_short | Analysis of queueing networks with blocking |
| title_sort | analysis of queueing networks with blocking |
| topic | Computernetwerken gtt Wachttijdproblemen gtt Algorithms Blocking sets Computer networks Queuing theory Markov-Prozess (DE-588)4134948-9 gnd Rechnernetz (DE-588)4070085-9 gnd Warteschlangennetz (DE-588)4225823-6 gnd |
| topic_facet | Computernetwerken Wachttijdproblemen Algorithms Blocking sets Computer networks Queuing theory Markov-Prozess Rechnernetz Warteschlangennetz |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=015379286&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| volume_link | (DE-604)BV011630976 |
| work_keys_str_mv | AT balsamosimonetta analysisofqueueingnetworkswithblocking AT denittopersonevittoria analysisofqueueingnetworkswithblocking AT onvuralraifo analysisofqueueingnetworkswithblocking |