{"text_format":"2","workbook":"xls","n_sheets":1,"sheets":["report2"],"not_rendered":{"charts":0,"images":0,"macros":0,"external_links":1,"defined_names":1,"comments":0,"pivot_tables":0},"unopened":[],"bounds":{"document_bytes":16777216,"sheet_cells":100000,"run_cost":"one","rows_first":2000,"rows_last":500,"rows_between":2000,"halvings":0,"cell_chars":16384,"cell_head_chars":4096},"cells_cut":0,"cells_raw":0,"read":"whole","date_system":"1900","formulas":"cached_only"}

{"sheet":"report2","index":0,"n_rows":24,"n_cols":5,"rows_kept":24,"cut":false,"hidden":false,"merged":[[0,2,0,3],[0,4,0,5],[1,2,1,3],[1,4,1,5],[2,2,2,3],[2,4,2,5],[3,2,3,3],[5,2,5,3],[9,2,9,3],[10,2,10,3],[11,2,11,3],[13,2,13,3],[15,2,15,3],[16,2,16,3],[20,2,20,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNINA9910144522003321"]
[null,null,"Autore",null,"Ng Chee Hock"]
[null,null,"Titolo",null,"Queueing modelling fundamentals with applications in communication networks / / Ng Chee-Hock and Soong Boon-Hee"]
[null,null,"Pubbl/distr/stampa",null,"Chichester, England ; , : Wiley, , c2008"]
[{"$nulls":4},"[Piscataqay, New Jersey] : , : IEEE Xplore, , [2008]"]
[null,null,"ISBN",null,"1-282-35007-2"]
[{"$nulls":4},"9786612350078"]
[{"$nulls":4},"0-470-99467-3"]
[{"$nulls":4},"0-470-99466-5"]
[null,null,"Edizione",null,"[2nd ed.]"]
[null,null,"Descrizione fisica",null,"1 online resource (293 p.)"]
[null,null,"Disciplina",null,"519.8/2"]
[{"$nulls":4},"519.82"]
[null,null,"Soggetti",null,"Queuing theory"]
[{"$nulls":4},"Telecommunication - Traffic"]
[null,null,"Lingua di pubblicazione",null,"Inglese"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]
[null,null,null,"Note generali","Description based upon print version of record."]
[null,null,null,"Nota di bibliografia","Includes bibliographical references (p. [259]-263) and index."]
[null,null,"Nota di contenuto",null,"List 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. "]
[{"$nulls":4},"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."]
[{"$nulls":4},"9.3. Analysis of Sliding Window Flow Control Mechanisms -- 9.4. Rate Based Adaptive Congestion Control -- References -- Index."]
[null,null,null,"Sommario/riassunto","Queueing 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."]