A text and reference on queueing theory, covering everything from the development of standard models to applications. The focus is on real analysis ...Show synopsisA text and reference on queueing theory, covering everything from the development of standard models to applications. The focus is on real analysis of queueing systems applications and problem solving. The second edition has been expanded to include new material on statistical inference in queueing and updated to reflect changes in simulation languages and new results in statistical analysis of simulation output such as regenerative techniques. The book contains a new section on the fundamentals of Markov processes, in addition to new chapters on advanced Markov Models, queueing networks, and bounds and approximations.Hide synopsis
Description:New. Queueing Theory is the study of queues (sometimes called...New. Queueing Theory is the study of queues (sometimes called waiting lines). Most people are familiar with the concept of queues; they exist all around us in daily lives. Queueing Theory can be used to describe these real world queues, or more abstract queues, such as are often found in many branches of computer science, for example in operating system design. Much of queueing theory is very complex. Almost all of it relies heavily on mathematics, especially statistics. The use of a computer helps to avoid needless mathematical computations. Introduction. " Description of the Queueing Problem. " Characteristics of Queueing Processes. " Notation. " Measuring System Performance. " Some General Results. " Simple Data Bookkeeping for Queues. " Poisson Process and the Exponential Distribution. " Markovian Property of the Exponential Distribution. " Stochastic Processes and Markov Chains. Problems. Simple Markovian Queueing Models. " Birth Death Processes. " Single-Server Queues (M/M/1). " Multi-Server Queues (M/M/c). " Choosing the Number of Servers. " Queues with Truncation (M/M/c/K). " Erlang? s Loss Formula (M/M/c/c). " Queues with Unlimited Service (M/M/1). " Finite Source Queues. " State-Dependent Service. " Queues with Impatience. " Transient Behavior. " Busy-Period Analysis. Problems. Advanced Markovian Queueing Models. " Bulk Input (M[X]/M/1). " Bulk Service (M/M[Y ]/1). " Erlangian Models. " Priority Queue Disciplines. " Retrial Queues. Networks, Series, and Cyclic Queues. " Series Queues. " Open Jackson Networks. " Closed Jackson Networks. " Cyclic Queues. " Extensions of Jackson Networks. " Non-Jackson Networks. General Arrival or Service Patterns. " General Service, Single Server (M/G/1). " General Service, Multi-Server (M/G/c/ú, M/G/1). " General Input (G/M/1, G/M/c). More General Models and Theoretical Topics. " G/Ek/1, G[k]/M/1, and G/PHk/1. " General Input, General Service (G/G/1). " Multichannel Queues with Poisson Input and Constant Service (M/D/c). " Semi-Markov and Markov Renewal Processes in Queueing. " Other Queue Disciplines. " Design and Control of Queues. " Statistical Inference in Queueing. Bounds and Approximations. " Bounds. " Approximations. " Network Approximations. Problems. Numerical Techniques and Simulation. " Numerical Techniques. " Numerical Inversion of Transforms. " Discrete-Event Stochastic Simulation. Problems. Bibliography. Appendix 1. Symbols and Abbreviations. Appendix 2. Tables. Appendix 3. Transforms and Generating Functions. Appendix 4. Differential and Difference Equations. Appendix 5. QTSPlus Software. Printed Pages: 528..
Copyright in bibliographic data and cover images is held by Nielsen Book Services Limited, Baker & Taylor, Inc., or by their respective licensors, or by the publishers, or by their respective licensors. For personal use only. All rights reserved. All rights in images of books or other publications are reserved by the original copyright holders.
You're signed up (and we ♥ you). Watch for our Welcome e-mail and your first coupon. Thanks!