Finite Capacity Queue with Multiple Poisson Arrivals and Generally Distrubuted Service Times

dc.contributor.authorNikolov, A. V.
dc.date.accessioned2016-11-28T11:40:24Z
dc.date.available2016-11-28T11:40:24Z
dc.date.issued2013
dc.description.abstractThe present article explores a queuing system with multiple inputs, single server, different service rates, and limited size of the buffer. The system parameters are crucial for the performance of numerous applications. We develop an analytical model of such a system and obtain the following results: steady-state probabilities of the system and system throughput.
dc.identifier.citationNikolov, Finite Capacity Queue with Multiple Poisson Arrivals and Generally Distributed Service Times, Intl. J. of Appl. Maths, No. 2, 2013, pp. 233-240
dc.identifier.issn1311-1728
dc.identifier.otherY
dc.identifier.urihttp://dx.doi.org/10.12732/ijam.v26i2.9
dc.identifier.urihttp://repository.tml.nul.ls/handle/20.500.14155/76
dc.language.isoEn
dc.publisherInternational Journal of Applied Mathematics
dc.rights2013 Academic Publications
dc.subjectKendal notations
dc.titleFinite Capacity Queue with Multiple Poisson Arrivals and Generally Distrubuted Service Timesen
dc.typeArticle
Files