Computer networks and systems: queueing theory and performance evaluation
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
New York ; Berlin ; Heidelberg ; Barcelona ; Hong Kong ; London
Springer
2000
|
| Ausgabe: | 3. ed. |
| Schlagworte: | |
| Online-Zugang: | Inhaltsverzeichnis |
| Beschreibung: | Literaturverz. S. 365 - 402 |
| Beschreibung: | XIII, 409 S. graph. Darst. : 25 cm |
| ISBN: | 3540950370 |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV013326798 | ||
| 003 | DE-604 | ||
| 005 | 20020507 | ||
| 007 | t | ||
| 008 | 000829s2000 gw d||| |||| 00||| eng d | ||
| 016 | 7 | |a 959581359 |2 DE-101 | |
| 020 | |a 3540950370 |9 3-540-95037-0 | ||
| 035 | |a (OCoLC)247043930 | ||
| 035 | |a (DE-599)BVBBV013326798 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 044 | |a gw |c DE | ||
| 049 | |a DE-91 |a DE-11 | ||
| 050 | 0 | |a TK5105.5 | |
| 082 | 0 | |a 004.6 |2 21 | |
| 084 | |a SK 970 |0 (DE-625)143276: |2 rvk | ||
| 084 | |a ST 200 |0 (DE-625)143611: |2 rvk | ||
| 084 | |a MAT 608f |2 stub | ||
| 084 | |a DAT 250f |2 stub | ||
| 100 | 1 | |a Robertazzi, Thomas G. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Computer networks and systems |b queueing theory and performance evaluation |c Thomas G. Robertazzi |
| 250 | |a 3. ed. | ||
| 264 | 1 | |a New York ; Berlin ; Heidelberg ; Barcelona ; Hong Kong ; London |b Springer |c 2000 | |
| 300 | |a XIII, 409 S. |b graph. Darst. : 25 cm | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 500 | |a Literaturverz. S. 365 - 402 | ||
| 650 | 4 | |a Computer networks |x Evaluation | |
| 650 | 4 | |a Network performance (Telecommunication) | |
| 650 | 4 | |a Queuing theory | |
| 650 | 0 | 7 | |a Leistungsbewertung |0 (DE-588)4167271-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Wartesystem |0 (DE-588)4251734-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Warteschlangentheorie |0 (DE-588)4255044-0 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Rechnernetz |0 (DE-588)4070085-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Verteiltes System |0 (DE-588)4238872-7 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Rechnernetz |0 (DE-588)4070085-9 |D s |
| 689 | 0 | 1 | |a Leistungsbewertung |0 (DE-588)4167271-9 |D s |
| 689 | 0 | 2 | |a Warteschlangentheorie |0 (DE-588)4255044-0 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a Verteiltes System |0 (DE-588)4238872-7 |D s |
| 689 | 1 | 1 | |a Warteschlangentheorie |0 (DE-588)4255044-0 |D s |
| 689 | 1 | |8 1\p |5 DE-604 | |
| 689 | 2 | 0 | |a Wartesystem |0 (DE-588)4251734-5 |D s |
| 689 | 2 | 1 | |a Rechnernetz |0 (DE-588)4070085-9 |D s |
| 689 | 2 | |8 2\p |5 DE-604 | |
| 856 | 4 | 2 | |m HEBIS Datenaustausch |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=009088394&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 883 | 1 | |8 2\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-009088394 | |
Datensatz im Suchindex
| _version_ | 1806142867009175552 |
|---|---|
| adam_text |
Thomas G Robertazzi
Computer Networks
and Systems
Queueing Theory and
Performance Evaluation
Third Edition
With 116 Figures
Springer
Contents
Preface • vii
Chapter 1: The Queueing Paradigm
1 1 Introduction 1
1 2 Queueing Theory 1
1 3 Queueing Models 2
1 4 Case Study I: Performance Model of a Distributed File Service
By W G Nichols and J S Emer 6
1 5 Case Study II: Single-bus Multiprocessor Modeling
By B L Bodnar and A C Liu 9
1 6 Case Study III: TeraNet, A Lightwave Network 11
1 7 Case Study IV: Performance Model of a Shared Medium
Packet Switch
By R Guerin 13
Chapter 2: Single Queueing Systems
2 1 Introduction 19
2 2 The M/M/l Queueing System 19
221 The Poisson Process 20
222 Foundations of the Poisson Process 22
223 Poisson Distribution Mean and Variance 25
224 The Inter-Arrival Times 27
225 The Markov Property 28
226 Exponential Service Times 29
227 Foundation of the M/M/l Queueing System 30
228 Flows and Balancing 32
229 The M/M/l Queueing System in Detail 37
2 3 Little'sLaw 43
2 4 Reversibility and Burke's Theorem 47
241 Introduction 47
242 Reversibility 48
243 Burke's Theorem 51
2 5 The State Dependent M/M/l Queueing System 53
251 The General Solution 53
252 Performance Measures 55
2 6 The M/M/1 /N Queueing System: The Finite Buffer Case 56
2 7 The M/M/oo Queueing System: Infinite Number of Servers 59
x Contents
2 8 The M/M/m Queueing System: m Parallel Servers with a Queue 61
2 9 The M/M/m/m Queue: A Loss System 64
2 10 Central Server CPU Model 65
2 11 Transient Solution of the M/M/l/oo Queueing System 68
2 11 1 The Technique 68
2 11 2 The Solution 69
2 11 3 Speeding Up the Computation 72
2 12 The M/G/l Queueing System 74
2 12 1 Introduction 74
2 12 2 Mean Number in the Queueing System 74
2 12 3 Why We Use Departure Instants 83
2 12 4 Probability Distribution of the Number in the
Queueing System 85
2 13 Priority Systems for Multiclass Traffic 89
To Look Further 91
Problems 92
Chapter 3: Networks of Queues
3 1 Introduction 101
3 2 The Product Form Solution' 102
321 Introduction 102
322 Open Networks 102
3221 The Global Balance 102
3222 The Traffic Equations 103
3223 The Product Form Solution 104
323 Local Balance 108
324 Closed Queueing Networks 108
325 TheBCMPGeneralization I l l
3 3 Algebraic Topological Interpretation of the
Product Form Solution 112
331 Introduction 112
332A First Look at Building Blocks 112
333 Building Block Circulatory Structure 118
334 The Consistency Condition 130
3 4 Recursive Solution of Nonproduct Form Networks 132
341 Introduction 132
342 Recursive Examples 135
343 Numerical Implementation of the Equations 141
3 5 Queueing Networks with Negative Customers 141
351 Introduction 141
352 Product Form Solutions 142
353 The Chao/Pinedo Model 147
3531 Introduction 147
3532 The Model
ByX ChaoandM Pinedo 148
Contents xi
To Look Further 155
Problems 156
Chapter 4: Numerical Solution of Models
4 1 Introduction 163
4 2 Closed Queueing Networks: Convolution Algorithm 164
421 Lost in the State Space 164
422 Convolution Algorithm: Single Customer Class 166
423 Performance Measures from Normalization Constants 170
4 3 Mean Value Analysis 197
431 State (Load) Independent Servers 197
432A Closer Look at the Arrival Theorem 202
433 State (Load) Independent Servers (Random Routing) 203
4 4 PANACEA: Approach for Large Markovian
Queueing Networks 206
441 Introduction 206
442 The Product Form Solution 207
443 Conversion to Integral Representation 208
444 Performance Measures 211
445 Normal Usage 212
446 Some Transformations 212
447 Asymptotic Expansions 214
448 The Pseudonetworks 216
449 Error Analysis 218
4 5 Norton's Equivalent for Queueing Networks 219
451 Introduction 219
452 Equivalence 220
4 6 Simulation of Communication Networks
By J F Kurose and H T Mouftah 223
461 Introduction 223
462 The Statistical Nature of a Simulation 224
463 Sensitivity Analysis of Simulation Results 226
464 Speeding up a Simulation 228
To Look Further 230
Problems 232
Chapter 5: Stochastic Petri Nets
5 1 Introduction 237
5 2 Bus-oriented Multiprocessor Model 238
5 3 Toroidal MPN Lattices 243
5 4 The Dining Philosophers Problem 249
55A Station-oriented CSMA/CD Protocol Model 251
5 6 The Alternating Bit Protocol 253
xii Contents
5 7 SPN's without Product Form Solutions 256
571 Introduction 256
572 Nonsafe Resource Sharing Models 257
573 Synchronization Models 263
5 8 Conclusion 268
To Look Further 269
Problems 270
Chapter 6: Discrete Time Queueing Systems
6 1 Introduction 275
6 2 Discrete Time Queueing Systems 276
6 3 Discrete Time Arrival Processes 280
631 The Bernoulli Process 280
632 The Geometric Distribution 282
633 The Binomial Distribution 284
634 Poisson Approximation to Binomial Distribution 288
6 4 The Geom/Geom/m/N Queueing System 290
6 5 The Geom/Geom/1/N and Geom/Geom/1 Queueing Systems 294
6 6 Case Study I: Queueing on a Space Division Packet Switch 297
661 Introduction 297
662 Output Queueing 300
663 Input Queueing 303
6 7 Case Study II: Queueing on a Single-buffered Banyan Network 308
671 Introduction 308
672 The Model Assumptions 309
673 The Model and Solution 310
6 8 Case Study III: DQDB Erasure Station Location 312
681 Introduction 312
682 Optimal Location of Erasure Nodes
By M W Garrett and S -Q Li 315
To Look Further 319
Problems 320
Chapter 7: Network Traffic Modeling
7 1 Introduction 333
7 2 Continuous Time Models 333
721 Poisson Process (PP or M) 333
722 Generally Modulated Poisson Process (GMPP) 334
723 Markov Modulated Poisson Process (MMPP) 334
724 Switched Poisson Process (SPP) 336
725 Interrupted Poisson Process (IPP) 336
726 Markovian Arrival Process (MAP) 337
727 Autoregressive Moving Average Model (ARMA) 337
728 Fluid Flow Approximation Model (FFA) 337
729 Self-Similarity Source Model (SSS) 338
7 2 10 Renewal Process (RP, GI) 338
Contents xiii
7 2 11 Semi-Markov Processes (SMP) 338
7 3 Discrete Time Models 338
731 Deterministic Process (DP) 339
732 Bernoulli Process (BP) 339
733 Generally Modulated Deterministic Process (GMDP) 339
734 Markov Modulated Deterministic Process (MMDP) 339
735 Switched Deterministic Process (SDP) 340
736 Interrupted Deterministic Process (LDP) 340
737 Discrete Time Markovian Arrival Process (DMAP) 341
738 Discrete Renewal Process (DRP) 341
7 4 Solution Methods 341
741 Simulation 342
742 Linear Equation Solution 342
743 Probability Generating Function 342
744 Fluid Flow Approximation 342
745 Transient Effect Models 343
7 5 Burstiness 343
751 Ratio of Peak Rate to Mean Rate 343
752 Coefficient of Variation of Traffic Load 344
753 Index of Dispersion 344
754 Spectral Characteristics 346
755 Some Other Techniques 347
756 Queueing Performance under Burstiness 347
7 6 Self-Similar Traffic 348
761 Some Basics 348
762 Self-Similarity 350
763 The Hurst Effect 352
764 Roots of Self-Similarity 353
765 Detecting Self-Similarity 353
766 Network Performance 354
To Look Further 355
Appendix: Probability Theory Review
A I Probability 357
A 2 Densities and Distribution Functions 358
A 3 Joint Densities and Distributions 360
A 4 Expectations , 361
A 5 Convolution 362
A 6 Combinatorics 363
A 7 Some Useful Summations 363
A 8 Useful Moment-generating Function Identities 363
References 365
About the Author 403
Index 405 |
| any_adam_object | 1 |
| author | Robertazzi, Thomas G. |
| author_facet | Robertazzi, Thomas G. |
| author_role | aut |
| author_sort | Robertazzi, Thomas G. |
| author_variant | t g r tg tgr |
| building | Verbundindex |
| bvnumber | BV013326798 |
| 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 970 ST 200 |
| classification_tum | MAT 608f DAT 250f |
| ctrlnum | (OCoLC)247043930 (DE-599)BVBBV013326798 |
| 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 |
| edition | 3. ed. |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nam a2200000 c 4500</leader><controlfield tag="001">BV013326798</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20020507</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">000829s2000 gw d||| |||| 00||| eng d</controlfield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">959581359</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">3540950370</subfield><subfield code="9">3-540-95037-0</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)247043930</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV013326798</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="044" ind1=" " ind2=" "><subfield code="a">gw</subfield><subfield code="c">DE</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91</subfield><subfield code="a">DE-11</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><subfield code="2">21</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SK 970</subfield><subfield code="0">(DE-625)143276:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 200</subfield><subfield code="0">(DE-625)143611:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">MAT 608f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 250f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Robertazzi, Thomas G.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Computer networks and systems</subfield><subfield code="b">queueing theory and performance evaluation</subfield><subfield code="c">Thomas G. Robertazzi</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">3. ed.</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">New York ; Berlin ; Heidelberg ; Barcelona ; Hong Kong ; London</subfield><subfield code="b">Springer</subfield><subfield code="c">2000</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XIII, 409 S.</subfield><subfield code="b">graph. Darst. : 25 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">Literaturverz. S. 365 - 402</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer networks</subfield><subfield code="x">Evaluation</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Network performance (Telecommunication)</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">Leistungsbewertung</subfield><subfield code="0">(DE-588)4167271-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Wartesystem</subfield><subfield code="0">(DE-588)4251734-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Warteschlangentheorie</subfield><subfield code="0">(DE-588)4255044-0</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">Verteiltes System</subfield><subfield code="0">(DE-588)4238872-7</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">Leistungsbewertung</subfield><subfield code="0">(DE-588)4167271-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><subfield code="a">Warteschlangentheorie</subfield><subfield code="0">(DE-588)4255044-0</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">Verteiltes System</subfield><subfield code="0">(DE-588)4238872-7</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="1"><subfield code="a">Warteschlangentheorie</subfield><subfield code="0">(DE-588)4255044-0</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="2" ind2="0"><subfield code="a">Wartesystem</subfield><subfield code="0">(DE-588)4251734-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2="1"><subfield code="a">Rechnernetz</subfield><subfield code="0">(DE-588)4070085-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2=" "><subfield code="8">2\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">HEBIS 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=009088394&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">2\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-009088394</subfield></datafield></record></collection> |
| id | DE-604.BV013326798 |
| illustrated | Illustrated |
| indexdate | 2024-08-01T00:27:43Z |
| institution | BVB |
| isbn | 3540950370 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-009088394 |
| oclc_num | 247043930 |
| open_access_boolean | |
| owner | DE-91 DE-BY-TUM DE-11 |
| owner_facet | DE-91 DE-BY-TUM DE-11 |
| physical | XIII, 409 S. graph. Darst. : 25 cm |
| publishDate | 2000 |
| publishDateSearch | 2000 |
| publishDateSort | 2000 |
| publisher | Springer |
| record_format | marc |
| spelling | Robertazzi, Thomas G. Verfasser aut Computer networks and systems queueing theory and performance evaluation Thomas G. Robertazzi 3. ed. New York ; Berlin ; Heidelberg ; Barcelona ; Hong Kong ; London Springer 2000 XIII, 409 S. graph. Darst. : 25 cm txt rdacontent n rdamedia nc rdacarrier Literaturverz. S. 365 - 402 Computer networks Evaluation Network performance (Telecommunication) Queuing theory Leistungsbewertung (DE-588)4167271-9 gnd rswk-swf Wartesystem (DE-588)4251734-5 gnd rswk-swf Warteschlangentheorie (DE-588)4255044-0 gnd rswk-swf Rechnernetz (DE-588)4070085-9 gnd rswk-swf Verteiltes System (DE-588)4238872-7 gnd rswk-swf Rechnernetz (DE-588)4070085-9 s Leistungsbewertung (DE-588)4167271-9 s Warteschlangentheorie (DE-588)4255044-0 s DE-604 Verteiltes System (DE-588)4238872-7 s 1\p DE-604 Wartesystem (DE-588)4251734-5 s 2\p DE-604 HEBIS Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=009088394&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 2\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
| spellingShingle | Robertazzi, Thomas G. Computer networks and systems queueing theory and performance evaluation Computer networks Evaluation Network performance (Telecommunication) Queuing theory Leistungsbewertung (DE-588)4167271-9 gnd Wartesystem (DE-588)4251734-5 gnd Warteschlangentheorie (DE-588)4255044-0 gnd Rechnernetz (DE-588)4070085-9 gnd Verteiltes System (DE-588)4238872-7 gnd |
| subject_GND | (DE-588)4167271-9 (DE-588)4251734-5 (DE-588)4255044-0 (DE-588)4070085-9 (DE-588)4238872-7 |
| title | Computer networks and systems queueing theory and performance evaluation |
| title_auth | Computer networks and systems queueing theory and performance evaluation |
| title_exact_search | Computer networks and systems queueing theory and performance evaluation |
| title_full | Computer networks and systems queueing theory and performance evaluation Thomas G. Robertazzi |
| title_fullStr | Computer networks and systems queueing theory and performance evaluation Thomas G. Robertazzi |
| title_full_unstemmed | Computer networks and systems queueing theory and performance evaluation Thomas G. Robertazzi |
| title_short | Computer networks and systems |
| title_sort | computer networks and systems queueing theory and performance evaluation |
| title_sub | queueing theory and performance evaluation |
| topic | Computer networks Evaluation Network performance (Telecommunication) Queuing theory Leistungsbewertung (DE-588)4167271-9 gnd Wartesystem (DE-588)4251734-5 gnd Warteschlangentheorie (DE-588)4255044-0 gnd Rechnernetz (DE-588)4070085-9 gnd Verteiltes System (DE-588)4238872-7 gnd |
| topic_facet | Computer networks Evaluation Network performance (Telecommunication) Queuing theory Leistungsbewertung Wartesystem Warteschlangentheorie Rechnernetz Verteiltes System |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=009088394&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| work_keys_str_mv | AT robertazzithomasg computernetworksandsystemsqueueingtheoryandperformanceevaluation |