National University of Lesotho
Institutional
Repository (NULIR)
Library and
Information Services

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

Show simple item record

dc.contributor.author Nikolov, A. V.
dc.date.accessioned 2016-11-28T11:40:24Z
dc.date.available 2016-11-28T11:40:24Z
dc.date.issued 2013
dc.identifier.citation Nikolov, 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.issn 1311-1728
dc.identifier.other Y
dc.identifier.uri http://dx.doi.org/10.12732/ijam.v26i2.9
dc.identifier.uri http://repository.tml.nul.ls/handle/20.500.14155/76
dc.description.abstract The 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.language.iso En
dc.publisher International Journal of Applied Mathematics
dc.rights 2013 Academic Publications
dc.subject Kendal notations
dc.title Finite Capacity Queue with Multiple Poisson Arrivals and Generally Distrubuted Service Times en
dc.type Article


Files in this item

Files Size Format View

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record

Search NULIR


Browse

My Account