Please use this identifier to cite or link to this item:
|Scopus||Web of Science®||Altmetric|
|Title:||Martingale methods for analysing single-server queues|
|Citation:||Queueing Systems, 2002; 41(3):205-239|
|Publisher:||Kluwer Academic Publishers|
|M. Roughan and C.E.M. Pearce|
|Abstract:||In this paper we presents a martingale method for analysing queues of M/G/1 type, which have been generalised so that the system passes through a series of phases on which the service behaviour may differ. The analysis uses the process embedded at departures to create a martingale, which makes possible the calculation of the probability generating function of the stationary occupancy distribution. Specific examples are given, for instance, a model of an unreliable queueing system, and an example of a queue-length-threshold overload-control system.|
|Description:||The original publication is available at www.springerlink.com|
|Appears in Collections:||Applied Mathematics publications|
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.