• DocumentCode
    1158044
  • Title

    Asymptotic expansions for large closed queueing networks with multiple job classes

  • Author

    Knessl, Charles ; Tier, Charles

  • Author_Institution
    Illinois Univ., Chicago, IL, USA
  • Volume
    41
  • Issue
    4
  • fYear
    1992
  • fDate
    4/1/1992 12:00:00 AM
  • Firstpage
    480
  • Lastpage
    488
  • Abstract
    A closed BCMP queuing network consisting of R job classes (chains), K+1 single-server, fixed-rate nodes, and M j class j jobs (j=1, 2, . . ., R) is considered. Asymptotic expansions are constructed for the partition function under assumptions (1) K≫1, (2) Mj ≫1 for each j, and (3) K/Mj =O(1). Analytic expressions for performance measures such as the mean queue length are also given. The approach employs the ray method and the method of matched asymptotic expansions. Numerical comparisons illustrate the accuracy of the approximations
  • Keywords
    queueing theory; BCMP queuing network; large closed queueing networks; multiple job classes; Boundary conditions; Computer networks; Convolution; Length measurement; Mathematics; Network servers; Partitioning algorithms; Performance analysis; Queueing analysis; Throughput;
  • fLanguage
    English
  • Journal_Title
    Computers, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9340
  • Type

    jour

  • DOI
    10.1109/12.135560
  • Filename
    135560
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1158044