Abstract
Now we consider finite buffer queues. The methods used for analyzing them are different from those used for infinite buffer systems.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Alfa AS (2003) An alternative approach for analyzing finite buffer queues in discrete time. Performance Evaluation 53:75–92
Alfa AS, Zhao YQ (2000) Overload analysis of the PH/PH/1/K queue and the queue of the M/G/1 type with very large K. Asia-Pacific J Oper Res 17:123–135
Hunter JJ (1983) Mathematical Techniques of Applied Probability - Volume 2, Discrete Time Model: Techniques and Applications. Academic Press, New York
Liu Q, Alfa AS, Xue J (2010) Analysis of the discrete-time GI/G/1/K using remaining time approach. J Appl Math and Informatics 28(1-2):153–162
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer Science+Business Media New York
About this chapter
Cite this chapter
Alfa, A.S. (2016). Basic Single Node Queueing Models with Finite Buffers. In: Applied Discrete-Time Queues. Springer, New York, NY. https://doi.org/10.1007/978-1-4939-3420-1_6
Download citation
DOI: https://doi.org/10.1007/978-1-4939-3420-1_6
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4939-3418-8
Online ISBN: 978-1-4939-3420-1
eBook Packages: EngineeringEngineering (R0)