Research output: Contribution to Journal/Magazine › Journal article › peer-review
Research output: Contribution to Journal/Magazine › Journal article › peer-review
}
TY - JOUR
T1 - Filtering recursions for calculating likelihoods for queues based on inter-departure time data.
AU - Fearnhead, Paul
PY - 2004/8
Y1 - 2004/8
N2 - We consider inference for queues based on inter-departure time data. Calculating the likelihood for such models is difficult, as the likelihood involves summing up over the (exponentially-large) space of realisations of the arrival process. We demonstrate how a likelihood recursion can be used to calculate this likelihood efficiently for the specific cases of M/G/1 and Er/G/1 queues. We compare the sampling properties of the mles to the sampling properties of estimators, based on indirect inference, which have previously been suggested for this problem.
AB - We consider inference for queues based on inter-departure time data. Calculating the likelihood for such models is difficult, as the likelihood involves summing up over the (exponentially-large) space of realisations of the arrival process. We demonstrate how a likelihood recursion can be used to calculate this likelihood efficiently for the specific cases of M/G/1 and Er/G/1 queues. We compare the sampling properties of the mles to the sampling properties of estimators, based on indirect inference, which have previously been suggested for this problem.
KW - Er/G/1 queues - forward-backward algorithm - indirect inference - likelihood recursions - M/G/1 queues - missing data
U2 - 10.1023/B:STCO.0000035305.92337.80
DO - 10.1023/B:STCO.0000035305.92337.80
M3 - Journal article
VL - 14
SP - 261
EP - 266
JO - Statistics and Computing
JF - Statistics and Computing
SN - 0960-3174
IS - 3
ER -