Summary
We study the queueing system Geometric/G/1/N with state-dependent arrival rates in discrete time. We develop a stable algorithm for computing the stationary waiting time distribution with respect to an entering customer.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
J.P. Claude, D. Seret, Files d’attente et processus discrets in: N. Abu El Ata (ed.), Modelling Techniques and Tools for Performance Analysis, 101–112 North-Holland, Amsterdam-New York-Oxford 1986.
R.A. Marie, J.M. Pellaumail, Steady-State Probabilities for a Queue with a General Service Distribution and State-Dependent Arrivals IEEE Trans. on Software Engineering 9 (1983), 109–113.
M.F. Neuts, Computational Uses of the Method of Phases in the Theory of Queues Comp. and Maths. with Appls. 1 (1975), 151–166.
H.C. Tijms, Stochastic Modeling and Analysis J. Wiley, New York 1986.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1988 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kramer, M. (1988). A Discrete-Time Queue with State-Dependent Arrivals. In: Schellhaas, H., van Beek, P., Isermann, H., Schmidt, R., Zijlstra, M. (eds) DGOR/NSOR. Operations Research Proceedings, vol 1987. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-73778-7_124
Download citation
DOI: https://doi.org/10.1007/978-3-642-73778-7_124
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-19365-4
Online ISBN: 978-3-642-73778-7
eBook Packages: Springer Book Archive