Full metadata record
DC FieldValueLanguage
dc.contributor.authorWang, Chia-Hungen_US
dc.contributor.authorLuh, Hsing Paulen_US
dc.date.accessioned2014-12-08T15:24:16Z-
dc.date.available2014-12-08T15:24:16Z-
dc.date.issued2012-09-01en_US
dc.identifier.issn0898-1221en_US
dc.identifier.urihttp://dx.doi.org/10.1016/j.camwa.2012.03.081en_US
dc.identifier.urihttp://hdl.handle.net/11536/16858-
dc.description.abstractThis 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.language.isoen_USen_US
dc.subjectAsymptotic analysisen_US
dc.subjectMultiple-server queueen_US
dc.subjectLoss probabilityen_US
dc.subjectHeavy trafficen_US
dc.titleEstimating the loss probability under heavy traffic conditionsen_US
dc.typeArticleen_US
dc.identifier.doi10.1016/j.camwa.2012.03.081en_US
dc.identifier.journalCOMPUTERS & MATHEMATICS WITH APPLICATIONSen_US
dc.citation.volume64en_US
dc.citation.issue5en_US
dc.citation.spage1352en_US
dc.citation.epage1363en_US
dc.contributor.department管理學院zh_TW
dc.contributor.departmentCollege of Managementen_US
dc.identifier.wosnumberWOS:000309081500068-
dc.citation.woscount0-
Appears in Collections:Articles


Files in This Item:

  1. 000309081500068.pdf

If it is a zip file, please download the file and unzip it, then open index.html in a browser to view the full text content.