LEADER 05899nam 2200661 450 001 9910830619403321 005 20240219162514.0 010 $a1-282-35007-2 010 $a9786612350078 010 $a0-470-99467-3 010 $a0-470-99466-5 024 7 $a10.1002/9780470994672 035 $a(CKB)1000000000687346 035 $a(EBL)470214 035 $a(SSID)ssj0000307540 035 $a(PQKBManifestationID)11247330 035 $a(PQKBTitleCode)TC0000307540 035 $a(PQKBWorkID)10244218 035 $a(PQKB)10850700 035 $a(MiAaPQ)EBC470214 035 $a(CaBNVSL)mat08040273 035 $a(IDAMS)0b00006485f0e969 035 $a(IEEE)8040273 035 $a(OCoLC)232611426 035 $a(PPN)250562979 035 $a(EXLCZ)991000000000687346 100 $a20171024d2008 uy 101 0 $aeng 135 $aur|n|---||||| 181 $ctxt 182 $cc 183 $acr 200 10$aQueueing modelling fundamentals with applications in communication networks /$fNg Chee-Hock and Soong Boon-Hee 205 $a2nd ed. 210 1$aChichester, England ;$cWiley,$dc2008. 210 2$a[Piscataqay, New Jersey] :$cIEEE Xplore,$d[2008] 215 $a1 online resource (293 p.) 300 $aDescription based upon print version of record. 311 $a0-470-51957-6 320 $aIncludes bibliographical references (p. [259]-263) and index. 327 $aList of Tables -- List of Illustrations -- Preface -- 1. Preliminaries -- 1.1. Probability Theory -- 1.2. z-Transforms - Generating Functions -- 1.3. Laplace Transforms -- 1.4. Matrix Operations -- Problems -- 2. Introduction to Queueing Systems -- 2.1. Nomenclature of a Queueing System -- 2.2. Random Variables and their Relationships -- 2.3. Kendall Notation -- 2.4 Little's Theorem -- 2.5 Resource Utilization and Traffic Intensity -- 2.6 Flow Conservation Law -- 2.7 Poisson Process -- 2.8 Properties of Poisson Process -- Problems -- 3. Discrete and Continuous Markov Processes -- 3.1. Stochastic Processes -- 3.2. Discrete-time Markov Chains -- 3.3. Continuous-time Markov Chains -- 3.4. Birth-Death Processes -- Problems -- 4. Single-Queue Markovian Systems -- 4.1. Classical M/M/1 Queue -- 4.2. PASTA - Poisson Arrivals See Time Averages -- 4.3. M/M/1/S Queueing Systems -- 4.5. Multi-server Systems - M/M/m -- 4.6. Erlang's Loss Queueing Systems - M/M/m/m Systems -- 4.7. Engset's Loss Systems -- 4.8. Considerations for Applications of Queueing Models -- Problems -- 5. Semi-Markovian Queueing Systems -- 5.1. The M/G/1 Queueing System -- 5.2 The Residual Service Time Approach -- 5.3 M/G/1 Non-preemptive Priority Queueing -- 5.4 Priority Queueing Systems -- 5.5 The G/M/1 Queueing System -- 6. Open Queueing Networks -- 6.1. Markovian Queries in Tandem -- 6.2. Applications of Tandem Queues in Data Networks -- 6.3. Jackson Queueing Networks -- Problems -- 7. Closed Queueing Networks -- 7.1. Jackson Closed Queueing Networks -- 7.2. Steady-state Probability Distribution -- 7.3. Convolution Algorithm -- 7.4. Performance Measures -- 7.5. Mean Value Analysis -- 7.6. Application of Closed Queueing Networks -- Problems -- 8. Markov-Modulated Arrival Process -- 8.1. Markov-modulated Poisson Process (MMPP) -- 8.2. Markov-modulated Bernoulli Process -- 8.3. Markov-modulated Fluid Flow -- 8.4. Network Calculus -- 9. Flow and Congestion Control -- 9.1. Introduction -- 9.2. Quality of Service. 327 $a9.3. Analysis of Sliding Window Flow Control Mechanisms -- 9.4. Rate Based Adaptive Congestion Control -- References -- Index. 330 $aQueueing analysis is a vital tool used in the evaluation of system performance. Applications of queueing analysis cover a wide spectrum from bank automated teller machines to transportation and communications and data networks. Fully revised, this second edition of a popular book contains the significant addition of a new chapter on Flow & Congestion control and a section on Network Calculus amongst other new material. An introductory text, Queueing Modelling Fundamentals focuses on queueing modelling techniques and applications of data networks, examining the underlying principles of isolated queueing systems. This book introduces the complex queueing theory in simple language/proofs to enable the reader to quickly pick up an overview to queueing theory without utilizing the diverse necessary mathematical tools. It incorporates a rich set of worked examples on its applications to communication networks. Features Include: . Fully revised and updated edition with significant new chapter on Flow and Congestion Control as-well as a new section on Network Calculus . A comprehensive text which highlights both the theoretical models and their applications through a rich set of worked examples, examples of applications to data networks and performance curves . Provides an insight into the underlying queueing principles and features step-by-step derivation of queueing results . Written by experienced Professors in the field Queueing Modelling Fundamentals is an introductory text for undergraduate or entry-level post-graduate students who are taking courses on network performance analysis as well as those practicing network administrators as well as operations. The detailed step-by-step derivation of queueing results also makes it an excellent text for professional engineers. 606 $aQueuing theory 606 $aTelecommunication$xTraffic 615 0$aQueuing theory. 615 0$aTelecommunication$xTraffic. 676 $a519.8/2 676 $a519.82 700 $aNg$b Chee Hock$0629754 701 $aSoong$b Boon-Hee$0739581 801 0$bCaBNVSL 801 1$bCaBNVSL 801 2$bCaBNVSL 906 $aBOOK 912 $a9910830619403321 996 $aQueueing modelling fundamentals with applications in communication networks$91465091 997 $aUNINA