Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
468553 | Computers & Mathematics with Applications | 2012 | 12 Pages |
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Chia-Hung Wang, Hsing Paul Luh,