LEADER 05367nam 22006614a 450 001 9910784564803321 005 20200520144314.0 010 $a1-281-05703-7 010 $a9786611057039 010 $a0-08-054181-X 035 $a(CKB)1000000000363810 035 $a(EBL)311392 035 $a(OCoLC)476098278 035 $a(SSID)ssj0000251560 035 $a(PQKBManifestationID)11200729 035 $a(PQKBTitleCode)TC0000251560 035 $a(PQKBWorkID)10171663 035 $a(PQKB)10436804 035 $a(Au-PeEL)EBL311392 035 $a(CaPaEBR)ebr10190104 035 $a(CaONFJC)MIL105703 035 $a(MiAaPQ)EBC311392 035 $a(EXLCZ)991000000000363810 100 $a20020730d2003 uy 0 101 0 $aeng 135 $aur|n|---||||| 181 $ctxt 182 $cc 183 $acr 200 10$aStochastic models in queueing theory$b[electronic resource] /$fJ. Medhi 205 $a2nd ed. 210 $aAmsterdam ;$aBoston $cAcademic Press$dc2003 215 $a1 online resource (501 p.) 225 1 $aMathematics in science and engineering 300 $aDescription based upon print version of record. 311 $a0-12-487462-2 320 $aIncludes bibliographical references and index. 327 $aFront 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 327 $a2.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 327 $a3.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(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 327 $a5.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 327 $a6.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 327 $a8.1 Heavy-Traffic Approximation for Waiting-Time Distribution 330 $aThis 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 410 0$aMathematics in science and engineering 606 $aQueuing theory 606 $aStochastic processes 615 0$aQueuing theory. 615 0$aStochastic processes. 676 $a519.8/2 700 $aMedhi$b J$g(Jyotiprasad)$059460 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910784564803321 996 $aStochastic Models in Queueing Theory$9382759 997 $aUNINA