Queueing Theory 2

Table of contents

1. Cover
2. Title Page
3. Copyright
4. Preface
5. 1 Stability Analysis of Queueing Systems based on Synchronization of the Input and Majorizing Output Flows
   1. 1.1. Introduction
   2. 1.2. Model description
   3. 1.3. Auxiliary service process
   4. 1.4. Instability result for the case ρ ≥ 1
   5. 1.5. Stochastic boundedness for the case ρ &lt; 1 < 1
   6. 1.6. Queueing system with unreliable servers and preemptive resume service discipline
   7. 1.7. Discrete-time queueing system with interruptions and preemptive repeat different service discipline
   8. 1.8. Queueing system with a preemptive priority discipline
   9. 1.9. Queueing system with simultaneous service of a customer by a random number of servers
   10. 1.10. Applications to transport systems analysis
   11. 1.11. Conclusion
   12. 1.12. Acknowledgment
   13. 1.13. References
6. 2 Queueing Models in Services – Analytical and Simulation Approach
   1. 2.1. Introduction
   2. 2.2. Phase-type distributions and the batch Markovian arrival process
   3. 2.3. Generation of MAP processes for numerical purposes
   4. 2.4. Analysis of selected queueing models of BMAP/G/c type
   5. 2.5. Simulated models of BM AP/G/c type queues
   6. 2.6. Analysis of selected queueing models of BMAP/G/c type with a vacation
   7. 2.7. Acknowledgment
   8. 2.8. References
7. 3 Distributions and Random Processes Related to Queueing and Reliability Models
   1. 3.1. Some useful notations, relationships and interpretations
   2. 3.2. Unreliable service model and reliability maintenance
   3. 3.3. Characterizations of exponential and geometric distributions via properties of service times
   4. 3.4 Probability distributions almost having lack of memory property
   5. 3.5. Random processes with a periodic nature
   6. 3.6. Conclusions
   7. 3.7. References
8. 4 The Impact of Information Structure on Strategic Behavior in Queueing Systems
   1. 4.1. Introduction
   2. 4.2. Game-theoretical framework in queueing
   3. 4.3. The unobservable model
   4. 4.4. The observable model
   5. 4.5. Comparison of the unobservable and the observable models
   6. 4.6. Partially observable models
   7. 4.7. Heterogeneously observable models
   8. 4.8. Observable-with-delay models
   9. 4.9. Conclusions and literature review for further study
   10. 4.10. Acknowledgments
   11. 4.11. References
9. 5 Non-extensive Maximum Entropy Formalisms and Inductive Inference of a Stable M/G/1 Queue with Heavy Tails
   1. 5.1 Introduction
   2. 5.2 General systems and inductive ME formalisms
   3. 5.3. NME formalisms and EME consistency axioms
   4. 5.4. A stable M/G/1 queue with long-range interactions
   5. 5.5. Numerical experiments and interpretations
   6. 5.6. Conclusions
   7. 5.7. Acknowledgments
   8. 5.8. Appendix: Rényi’s NME formalisms versus EME consistency axioms
   9. 5.9. References
10. 6 Inventory with Positive Service Time: a Survey
    1. 6.1. Introduction
    2. 6.2. Queueing inventory models
    3. 6.3. Acknowledgment
    4. 6.4. References
11. 7 A Stability Analysis Method of Regenerative Queueing Systems
    1. 7.1. Introduction
    2. 7.2. Preliminaries
    3. 7.3. The single-server system
    4. 7.4. The zero-delayed multiserver system
    5. 7.5. The delayed multiserver system: finiteness of the first regeneration period
    6. 7.6. Instability
    7. 7.7. Related research
    8. 7.8. Acknowledgments
    9. 7.9. References
12. 8 Transient Analysis of Markovian Queueing Systems: a Survey with Focus on Closed-forms and Uniformization
    1. 8.1. Introduction
    2. 8.2. Basics on Markovian queues
    3. 8.3. First examples
    4. 8.4. An uniformization-based path for the M/M/1 with matrix generating functions
    5. 8.5. An uniformization-based path using duality
    6. 8.6. Other transient results
    7. 8.7. Conclusion
    8. 8.8. References
13. List of Authors
14. Index
15. End User License Agreement