Waiting time distribution for the M/M/m queue
| dc.citation.epage | 162 | en_US |
| dc.citation.issue | 3 | en_US |
| dc.citation.spage | 159 | en_US |
| dc.citation.volume | 150 | en_US |
| dc.citation.woscount | 5 | |
| dc.contributor.author | Chan, WC | en_US |
| dc.contributor.author | Lin, YB | en_US |
| dc.contributor.department | 資訊工程學系 | zh_TW |
| dc.contributor.department | Department of Computer Science | en_US |
| dc.date.accessioned | 2014-12-08T15:40:49Z | |
| dc.date.available | 2014-12-08T15:40:49Z | |
| dc.date.issued | 2003-06-01 | en_US |
| dc.description.abstract | A novel method is presented for the calculation of the waiting time distribution function for the M/M/m queue. It is shown that the conditional waiting time obeys an Erlang distribution with rate mmu, where mu is the service rate of a server. An explicit closed form solution is obtained by means of the probability density function of the Erlang distribution. The derivation of the result proved to be very simple. The significance of Khintchine's method and its close relation to the proposed method is pointed out. It is also shown that the waiting time distribution can be obtained from Takacs's waiting time distribution for the G/M/m queue as a special case. This reveals some insight into the significance of Takacs's more general, but rather complex, result. | en_US |
| dc.identifier.doi | 10.1049/ip-com:20030274 | en_US |
| dc.identifier.issn | 1350-2425 | en_US |
| dc.identifier.journal | IEE PROCEEDINGS-COMMUNICATIONS | en_US |
| dc.identifier.uri | http://dx.doi.org/10.1049/ip-com:20030274 | en_US |
| dc.identifier.uri | https://ir.lib.nycu.edu.tw/handle/11536/27833 | |
| dc.identifier.wosnumber | WOS:000184185900004 | |
| dc.language.iso | en_US | en_US |
| dc.title | Waiting time distribution for the M/M/m queue | en_US |
| dc.type | Article | en_US |