English  |  正體中文  |  简体中文  |  Post-Print筆數 : 27 |  Items with full text/Total items : 91280/121421 (75%)
Visitors : 25421193      Online Users : 280
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version
    政大機構典藏 > 理學院 > 應用數學系 > 期刊論文 >  Item 140.119/63787
    Please use this identifier to cite or link to this item: http://nccur.lib.nccu.edu.tw/handle/140.119/63787

    Title: Estimating the Loss Probability under Heavy Traffic Conditions
    Authors: 陸行
    Luh, Hsing Paul
    Wang, Chia-Hung
    Contributors: 應數系
    Keywords: Asymptotic analysis;Multiple-server queue;Loss probability;Heavy traffic
    Date: 2012.06
    Issue Date: 2014-02-11 14:02:48 (UTC+8)
    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.
    Relation: Computers and Mathematics with Applications, 64(5), 1352-1363
    Data Type: article
    DOI 連結: http://dx.doi.org/10.1016/j.camwa.2012.03.081
    DOI: 10.1016/j.camwa.2012.03.081
    Appears in Collections:[應用數學系] 期刊論文

    Files in This Item:

    File Description SizeFormat
    1352-1363.pdf310KbAdobe PDF831View/Open

    All items in 政大典藏 are protected by copyright, with all rights reserved.

    社群 sharing

    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback