{"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":27,"n_cols":5,"rows_kept":27,"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],[4,2,4,3],[7,2,7,3],[8,2,8,3],[9,2,9,3],[10,2,10,3],[11,2,11,3],[14,2,14,3],[15,2,15,3],[19,2,19,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNINA9910458069003321"]
[null,null,"Autore",null,"Medhi J (Jyotiprasad)"]
[null,null,"Titolo",null,"Stochastic models in queueing theory [[electronic resource] /] / J. Medhi"]
[null,null,"Pubbl/distr/stampa",null,"Amsterdam ; ; Boston, : Academic Press, c2003"]
[null,null,"ISBN",null,"1-281-05703-7"]
[{"$nulls":4},"9786611057039"]
[{"$nulls":4},"0-08-054181-X"]
[null,null,"Edizione",null,"[2nd ed.]"]
[null,null,"Descrizione fisica",null,"1 online resource (501 p.)"]
[null,null,"Collana",null,"Mathematics in science and engineering"]
[null,null,"Disciplina",null,"519.8/2"]
[null,null,"Soggetti",null,"Queuing theory"]
[{"$nulls":4},"Stochastic processes"]
[{"$nulls":4},"Electronic books."]
[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 and index."]
[null,null,"Nota di contenuto",null,"Front Cover; Stochastic Models in Queueing Theory; Copyright Page; Contents; Preface; Chapter 1. Stochastic Processes; 1.1 Introduction; 1.2 Markov Chains; 1.3 Continuous-Time Markov Chains; 1.4 Birth-and-Death Processes; 1.5 Poisson Process; 1.6 Randomization: Derived Markov Chains; 1.7 Renewal Processes; 1.8 Regenerative Processes; 1.9 Markov Renewal Processes and Semi-Markov Processes; Problems; References and Further Reading; Chapter 2. Queueing Systems: General Concepts; 2.1 Introduction; 2.2 Queueing Processes; 2.3 Notation; 2.4 Transient and Steady-State Behavior"]
[{"$nulls":4},"2.5 Limitations of the Steady-State Distribution2.6 Some General Relationships in Queueing Theory; 2.7 Poisson Arrival Process and Its Characteristics; References and Further Reading; Chapter 3. Birth-and-Death Queueing Systems: Exponential Models; 3.1 Introduction; 3.2 The Simple M/M/1 Queue; 3.3 System with Limited Waiting Space: The M/M/1/K Model; 3.4 Birth-and-Death Processes: Exponential Models; 3.5 The M/M/oo Model: Exponential Model with an Infinite Number of Servers; 3.6 The Model M/M/c; 3.7 The M/M/c/c System: Eriang Loss Model; 3.8 Model with Finite Input Source"]
[{"$nulls":4},"3.9 Transient Behavior3.10 Transient-State Distribution of the M/M/c Model; 3.11 Multichannel Queue with Ordered Entry; Problems and Complements; References and Further Reading; Chapter 4. Non-Birth-and-DeathQueueingSystems: Markovian Models; 4.1 Introduction; 4.2 Bulk Queues; 4.3 Queueing Models with Bulk (Batch) Service; 4.4 M/M"]
[{"$nulls":4},"(a,b)/1: Transient-State Distribution; 4.5 Two-Server Model: M/M(a,b)/2; 4.6 The M/M((l,b)/c Model; Problems and Complements; References and Further Reading; Chapter 5. Network of Queues; 5.1 Network of Markovian Queues; 5.2 Channels in Series or Tandem Queues"]
[{"$nulls":4},"5.3 Jackson Network5.4 Closed Markovian Network (Gordon and Newell Network); 5.5 Cyclic Queue; 5.6 BCMP Networks; 5.7 Concluding Remarks; Problems and Complements; References and Further Reading; Chapter 6. Non-Markovian Queueing Systems; 6.1 Introduction; 6.2 Embedded-Markov-Chain Technique for the System with Poisson Input; 6.3 TheM/6/1 Model: Pollaczek-Khinchin Formula; 6.4 Busy Period; 6.5 Queues with Finite Input Source: M/G/l//M System; 6.6 System with Limited Waiting Space. M/G/l/K System; 6.7 The M+/G/l Model with Bulk Arrival; 6.8 The M/G(a,b)/l Model with General Bulk Service"]
[{"$nulls":4},"6.9 The G/M/l Model6.10 Multiserver Model; 6.11 Queues with Markovian Arrival Process; Problems and Complements; References and Further Reading; Chapter 7. Queues with General Arrival Time and Service-Time Distributions; 7.1 The G/G/1 Queue with General Arrival Time and Service-Time Distributions; 7.2 Mean and Variance of Waiting Time tV; 7.3 Queues with Batch Arrivals G(X)/G/1; 7.4 The Output Process of a G /G / 1 System; 7.5 Some Bounds for the G/ G / 1 System; Problems and Complements; References and Further Reading; Chapter 8. Miscellaneous Topics"]
[{"$nulls":4},"8.1 Heavy-Traffic Approximation for Waiting-Time Distribution"]
[null,null,null,"Sommario/riassunto","This is a graduate level textbook that covers the fundamental topics in queuing theory. The book has a broad coverage of methods to calculate important probabilities, and gives attention to proving the general theorems.  It includes many recent topics, such as server-vacation models, diffusion approximations and optimal operating policies, and more about bulk-arrival and bull-service models than other general texts.* Current, clear and comprehensive coverage* A wealth of interesting and relevant examples and exercises to reinforce concepts* Reference lists provided after each c"]