Abstract
The repairman model is used in Chap. 4 to approximate the request delay in a reservation procedure. In particular, the sojourn time in the repairman model with the Gated Random Order of Service (GROS) discipline is suggested as an approximation for the request delay, when blocked contention trees are used in a dynamic environment. Section 4.5 gives a heuristic approximation to the variance of the sojourn time under GROS. That approximation would be valid under overload conditions when the number of stations is large.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
(2008). The Repairman Model with Gros. In: Multiaccess, Reservations & Queues. Philips Research Book Series, vol 10. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-69317-8_5
Download citation
DOI: https://doi.org/10.1007/978-3-540-69317-8_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-69316-1
Online ISBN: 978-3-540-69317-8
eBook Packages: Computer ScienceComputer Science (R0)