A single-server queue with random accumulation level. (1991)

• Record Type: Journal Article
• Authors: Dshalalow, Jewgeni H.
• Is Part Of: Journal of applied mathematics and stochastic analysis. Volume 4:Number 3(1991)
• Page Start: 203
• Page End: 210
• Publication Date: 1991
• Subjects: random group size -- single-server queue -- queueing process -- imbedded Markov chain -- semi-regenerative process; Mathematical models -- Periodicals; Computer simulation -- Periodicals; Computer science -- Mathematics -- Periodicals; Computer science -- Mathematics; Computer simulation; Mathematical models; Applied Mathematics; Periodicals; Electronic journals; 519.22
• DOI: 10.1155/S1048953391000163
• Languages: English
• ISSNs: 1048-9533

Abstract

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.