Estimating the loss probability under heavy traffic conditions
| dc.citation.epage | 1363 | en_US |
| dc.citation.issue | 5 | en_US |
| dc.citation.spage | 1352 | en_US |
| dc.citation.volume | 64 | en_US |
| dc.citation.woscount | 0 | |
| dc.contributor.author | Wang, Chia-Hung | en_US |
| dc.contributor.author | Luh, Hsing Paul | en_US |
| dc.contributor.department | 管理學院 | zh_TW |
| dc.contributor.department | College of Management | en_US |
| dc.date.accessioned | 2014-12-08T15:24:16Z | |
| dc.date.available | 2014-12-08T15:24:16Z | |
| dc.date.issued | 2012-09-01 | en_US |
| dc.description.abstract | This paper studies a multiple-server queueing model under the assumptions of renewal arrival processes and limited buffer size. An approximation for the loss probability and the asymptotic behavior are studied under the heavy traffic conditions. We present an asymptotic analysis of the loss probability when both the arrival rate and number of servers approach infinity. In illustrative examples, the loss probabilities are estimated with heavy traffic under three common distributions of inter-arrival times: exponential, deterministic and Erlang-r distributions, respectively. (C) 2012 Elsevier Ltd. All rights reserved. | en_US |
| dc.identifier.doi | 10.1016/j.camwa.2012.03.081 | en_US |
| dc.identifier.issn | 0898-1221 | en_US |
| dc.identifier.journal | COMPUTERS & MATHEMATICS WITH APPLICATIONS | en_US |
| dc.identifier.uri | http://dx.doi.org/10.1016/j.camwa.2012.03.081 | en_US |
| dc.identifier.uri | https://ir.lib.nycu.edu.tw/handle/11536/16858 | |
| dc.identifier.wosnumber | WOS:000309081500068 | |
| dc.language.iso | en_US | en_US |
| dc.subject | Asymptotic analysis | en_US |
| dc.subject | Multiple-server queue | en_US |
| dc.subject | Loss probability | en_US |
| dc.subject | Heavy traffic | en_US |
| dc.title | Estimating the loss probability under heavy traffic conditions | en_US |
| dc.type | Article | en_US |