We have over 12,000 students, from over 100 countries, within one of the safest campuses in the UK


97% of Lancaster students go into work or further study within six months of graduating

Home > Research > Publications & Outputs > Filtering recursions for calculating likelihood...
View graph of relations

« Back

Filtering recursions for calculating likelihoods for queues based on inter-departure time data.

Research output: Contribution to journalJournal article


<mark>Journal publication date</mark>08/2004
<mark>Journal</mark>Statistics and Computing
Number of pages6
<mark>Original language</mark>English


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.