A single-server queue with random accumulation level

Jewgeni H. Dshalalow

International Journal of Stochastic Analysis, 1991, vol. 4, 1-8

Abstract:

The author studies the queueing process in a single-server bulk queueing system. Upon completion of a previous service, the server can take a group of random size from customers that are available. Or, the server can wait until the queue attains a desired level. The author establishes an ergodicity criterion for both the queueing process with continuous time parameter and the imbedded process. Under this criterion, the author obtains explicit formulas for the stationary distributions of both processes by using semi-regenerative techniques.

Date: 1991
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/IJSA/4/850716.pdf (application/pdf)
http://downloads.hindawi.com/journals/IJSA/4/850716.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jnijsa:850716

DOI: 10.1155/S1048953391000163

Access Statistics for this article

More articles in International Journal of Stochastic Analysis from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().