Hostname: page-component-6766d58669-r8qmj Total loading time: 0 Render date: 2026-05-20T15:48:09.645Z Has data issue: false hasContentIssue false

Matchmaking and Testing for Exponentiality in the M/G/∞ Queue

Published online by Cambridge University Press:  14 July 2016

Rudolf Grübel*
Affiliation:
Leibniz Universität Hannover
Hendrik Wegener*
Affiliation:
Leibniz Universität Hannover
*
Postal address: Institut für Mathematische Stochastik, Leibniz Universität Hannover, Postfach 6009, D-30060 Hannover, Germany.
Postal address: Institut für Mathematische Stochastik, Leibniz Universität Hannover, Postfach 6009, D-30060 Hannover, Germany.
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

Customers arrive sequentially at times x 1 < x 2 < · · · < x n and stay for independent random times Z 1, …, Z n > 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 x i + Z i 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.

Information

Type
Research Article
Copyright
Copyright © Applied Probability Trust 2011