Practical approximations for finite-buffer queueing models with batch arrivals (Q1120200): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (5 intermediate revisions by 4 users not shown) | |||
| Property / reviewed by | |||
| Property / reviewed by: Hans Daduna / rank | |||
| Property / reviewed by | |||
| Property / reviewed by: Hans Daduna / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2112739016 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Technical Note—Delays in Single-Server Queues with Batch Input / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3930417 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 14:18, 19 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Practical approximations for finite-buffer queueing models with batch arrivals |
scientific article |
Statements
Practical approximations for finite-buffer queueing models with batch arrivals (English)
0 references
1989
0 references
For the \(G^ X/G/1/N\) queue (with general batch size distribution) two rejection strategies are considered: If a whole batch cannot completely enter the buffer it is either rejected totally or the buffer is filled and the residual batch is lost. Using exact solutions for special cases of the model, approximations for rejection probabilities and waiting time quantities are proposed.
0 references
sojourn times
0 references
batch arrivals
0 references
rejection strategies
0 references
approximations for rejection probabilities
0 references
