Abstract
The input process is defined on the Palm space of a stationary point process as for G/G/1/∞ queues. There are s ≧ 1 servers attending customers and the allocation rule is that an arriving customer is assigned the server with the smallest workload. Once assigned, this customer will wait and then be served at unit rate until completion.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1987 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Baccelli, F., Brémaud, P. (1987). The G/G/s/∞ Queue. In: Palm Probabilities and Stationary Queues. Lecture Notes in Statistics, vol 41. Springer, New York, NY. https://doi.org/10.1007/978-1-4615-7561-0_11
Download citation
DOI: https://doi.org/10.1007/978-1-4615-7561-0_11
Publisher Name: Springer, New York, NY
Print ISBN: 978-0-387-96514-7
Online ISBN: 978-1-4615-7561-0
eBook Packages: Springer Book Archive