Please use this identifier to cite or link to this item:
https://hdl.handle.net/2440/623
Citations | ||
Scopus | Web of ScienceĀ® | Altmetric |
---|---|---|
?
|
?
|
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Roughan, M. | - |
dc.contributor.author | Pearce, C. | - |
dc.date.issued | 2002 | - |
dc.identifier.citation | Queueing Systems: Theory and Applications, 2002; 41(3):205-239 | - |
dc.identifier.issn | 0257-0130 | - |
dc.identifier.issn | 1572-9443 | - |
dc.identifier.uri | http://hdl.handle.net/2440/623 | - |
dc.description | The original publication is available at www.springerlink.com | - |
dc.description.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. | - |
dc.description.statementofresponsibility | M. Roughan and C.E.M. Pearce | - |
dc.language.iso | en | - |
dc.publisher | Kluwer Academic Publishers | - |
dc.source.uri | http://www.springerlink.com/content/jdb0ya0jb710dv32/ | - |
dc.title | Martingale methods for analysing single-server queues | - |
dc.type | Journal article | - |
dc.identifier.doi | 10.1023/A:1015851021001 | - |
pubs.publication-status | Published | - |
dc.identifier.orcid | Roughan, M. [0000-0002-7882-7329] | - |
Appears in Collections: | Applied Mathematics publications Aurora harvest 5 |
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.