A single-server queue with random accumulation level (Q1180682): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 00:52, 30 January 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A single-server queue with random accumulation level |
scientific article |
Statements
A single-server queue with random accumulation level (English)
0 references
27 June 1992
0 references
Summary: 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.
0 references
single-server bulk queueing system
0 references
stationary distributions
0 references
semi- regenerative techniques
0 references