Queueing Theory 1

Book description

The aim of this book is to reflect the current cutting-edge thinking and established practices in the investigation of queueing systems and networks.

This first volume includes ten chapters written by experts well-known in their areas. The book studies the analysis of queues with interdependent arrival and service times, characteristics of fluid queues, modifications of retrial queueing systems and finite-source retrial queues with random breakdowns, repairs and customers’ collisions. Some recent tendencies in the asymptotic analysis include the average and diffusion approximation of Markov queueing systems and networks, the diffusion and Gaussian limits of multi-channel queueing networks with rather general input flow, and the analysis of two-time-scale nonhomogenous Markov chains using the large deviations principle.

The book also analyzes transient behavior of infinite-server queueing models with a mixed arrival process, the strong stability of queueing systems and networks, and applications of fast simulation methods for solving high-dimension combinatorial problems.

Table of contents

  1. Cover
  2. Title Page
  3. Copyright
  4. Preface
  5. 1 Discrete Time Single-server Queues with Interdependent Interarrival and Service Times
    1. 1.1. Introduction
    2. 1.2. The Geo/Geo/1 case
    3. 1.3. The PH/PH/1 case
    4. 1.4. The model with multiple interarrival time distributions
    5. 1.5. Interdependent interarrival and service times
    6. 1.6. Conclusion
    7. 1.7. Acknowledgements
    8. 1.8. References
  6. 2 Busy Period, Congestion Analysis and Loss Probability in Fluid Queues
    1. 2.1. Introduction
    2. 2.2. Modeling a link under congestion and buffer fluctuations
    3. 2.3. Fluid queue with finite buffer
    4. 2.4. Conclusion
    5. 2.5. References
  7. 3 Diffusion Approximation of Queueing Systems and Networks
    1. 3.1. Introduction
    2. 3.2. Markov queueing processes
    3. 3.3. Average and diffusion approximation
    4. 3.4. Markov queueing systems
    5. 3.5. Markov queueing networks
    6. 3.6. Semi–Markov queueing systems
    7. 3.7. Acknowledgements
    8. 3.8. References
  8. 4 First-come First-served Retrial Queueing System by Laszlo Lakatos and its Modifications
    1. 4.1. Introduction
    2. 4.2. A contribution by Laszlo Lakatos and his disciples
    3. 4.3. A contribution by E.V. Koba
    4. 4.4. An Erlangian and hyper-Erlangian approximation for a Laszlo Lakatos-type queueing system
    5. 4.5. Two models with a combined queueing discipline
    6. 4.6. References
  9. 5 Parameter Mixing in Infinite-server Queues
    1. 5.1. Introduction
    2. 5.2. The MΛ/Coxn/∞ queue
    3. 5.3. Mixing in Markov-modulated infinite-server queues
    4. 5.4. Discussion and future work
    5. 5.5. References
  10. 6 Application of Fast Simulation Methods of Queueing Theory for Solving Some High-dimension Combinatorial Problems
    1. 6.1. Introduction
    2. 6.2. Upper and lower bounds for the number of some k-dimensional subspaces of a given weight over a finite field
    3. 6.3. Evaluation of the number of “good” permutations by fast simulation on the SCIT-4 multiprocessor computer complex
    4. 6.4. References
  11. 7 Diffusion and Gaussian Limits for Multichannel Queueing Networks
    1. 7.1. Introduction
    2. 7.2. Model description and notation
    3. 7.3. Local approach to prove limit theorems
    4. 7.4. Limit theorems for networks with controlled input flow
    5. 7.5. Gaussian approximation of networks with input flow of general structure
    6. 7.6. Limit processes for network with time-dependent input flow
    7. 7.7. Conclusion
    8. 7.8. Acknowledgements
    9. 7.9. References
  12. 8 Recent Results in Finite-source Retrial Queues with Collisions
    1. 8.1. Introduction
    2. 8.2. Model description and notations
    3. 8.3. Systems with a reliable server
    4. 8.4. Systems with an unreliable server
    5. 8.5. Conclusion
    6. 8.6. Acknowledgments
    7. 8.7. References
  13. 9 Strong Stability of Queueing Systems and Networks: a Survey and Perspectives
    1. 9.1. Introduction
    2. 9.2. Preliminary and notations
    3. 9.3. Strong stability of queueing systems
    4. 9.4. Conclusion and further directions
    5. 9.5. References
  14. 10 Time-varying Queues: a Two-time-scale Approach
    1. 10.1. Introduction
    2. 10.2. Time-varying queues
    3. 10.3. Main results
    4. 10.4. Concluding remarks
    5. 10.5. References
  15. List of Authors
  16. Index
  17. End User License Agreement

Product information

  • Title: Queueing Theory 1
  • Author(s): Vladimir Anisimov, Nikolaos Limnios
  • Release date: April 2021
  • Publisher(s): Wiley-ISTE
  • ISBN: 9781789450019