Article contents
Identifiability in GI/G/k queues
Published online by Cambridge University Press: 14 July 2016
Extract
Consider a queueing system in which customers arrive in accordance with a renewal process having an interarrival distribution F, and in which the service times of customers are independent and have distribution G. Moreover, suppose that there are k (k ≦ ∞) servers and that an arriving customer is immediately served if he finds one of the servers free, and if not then he joins the queue.
- Type
- Short Communications
- Information
- Copyright
- Copyright © Applied Probability Trust 1970
References
- 7
- Cited by