• DocumentCode
    977127
  • Title

    Approximate throughput analysis of cyclic queueing networks with finite buffers

  • Author

    Onvural, Raif O. ; Perros, H.G.

  • Author_Institution
    Dept. of Comput. Sci., North Carolina State Univ., Raleigh, NC, USA
  • Volume
    15
  • Issue
    6
  • fYear
    1989
  • fDate
    6/1/1989 12:00:00 AM
  • Firstpage
    800
  • Lastpage
    808
  • Abstract
    An approximation method for obtaining the throughput of cyclic queueing networks with blocking as a function of the number of customers in it is presented. The approximation method was developed for two different blocking mechanisms. It was also extended to the case of the central server model with blocking. Validation tests show that the algorithm is fairly accurate
  • Keywords
    computer networks; performance evaluation; queueing theory; approximate throughput analysis; approximation method; blocking mechanisms; central server model; customers; cyclic queueing networks; finite buffers; validation tests; Approximation methods; Bismuth; Computer networks; Computer science; Network servers; Queueing analysis; Signal processing; System recovery; Testing; Throughput;
  • fLanguage
    English
  • Journal_Title
    Software Engineering, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0098-5589
  • Type

    jour

  • DOI
    10.1109/32.24733
  • Filename
    24733
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=977127