Article contents
Matchmaking and Testing for Exponentiality in the M/G/∞ Queue
Published online by Cambridge University Press: 14 July 2016
Abstract
Customers arrive sequentially at times x1 < x2 < · · · < xn and stay for independent random times Z1, …, Zn > 0. The Z-variables all have the same distribution Q. We are interested in situations where the data are incomplete in the sense that only the order statistics associated with the departure times xi + Zi are known, or that the only available information is the order in which the customers arrive and depart. In the former case we explore possibilities for the reconstruction of the correct matching of arrival and departure times. In the latter case we propose a test for exponentiality.
MSC classification
- Type
- Research Article
- Information
- Copyright
- Copyright © Applied Probability Trust 2011
References
- 5
- Cited by