Summary
Queueing models play an important role in resource-allocation problems. In this paper a tree consisting of terminals (sources of requests), queues and synchronous servers is investigated. The generating function and the first moment of the holding time of a request generated by an arbitrary terminal are calculated.
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
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
A. G. KONHEIM and B. MEISTER, Service in a loop system, J. Assoc. Comput. Mach. 19 (1972), 92–108.
B. MEISTER, Ein zeitdiskretes Wartesystem mit unterbrechenden Prioritäten, Proceedings of the GI-Jahrestagung 1975, Lecture Notes in Computer Science, Springer-Verlag, Berlin, 1975.
A. G. KONHEIM and B. MEISTER, Waiting lines and times in a system with polling, J. Assoc. Comput. Mach. 21 (1974), 470–490.
A. G. KONHEIM and B. MEISTER, Waiting lines in multiple loop systems, J. Math. Anal. Appi. 39 (1972), 527–540.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1976 Springer-Verlag Berlin · Heidelberg
About this paper
Cite this paper
Meister, B. (1976). Models in Resource Allocation — Trees of Queues. In: Oettli, W., Ritter, K. (eds) Optimization and Operations Research. Lecture Notes in Economics and Mathematical Systems, vol 117. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-46329-7_19
Download citation
DOI: https://doi.org/10.1007/978-3-642-46329-7_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-07616-2
Online ISBN: 978-3-642-46329-7
eBook Packages: Springer Book Archive