Analyzing discrete-time \(\text{D}\)-\(\text{BMAP}/G/1/N\) queue with single and multiple vacations (Q879308)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5151741
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Analyzing discrete-time \(\text{D}\)-\(\text{BMAP}/G/1/N\) queue with single and multiple vacations |
scientific article; zbMATH DE number 5151741 |
Statements
Analyzing discrete-time \(\text{D}\)-\(\text{BMAP}/G/1/N\) queue with single and multiple vacations (English)
0 references
11 May 2007
0 references
discrete-time batch Markovian arrival process
0 references
finite-buffer
0 references
queueing
0 references
single vacation
0 references
multiple vacations
0 references
0 references
0 references
0.8948309421539307
0 references
0.881536602973938
0 references
0.873349666595459
0 references
0.8724900484085083
0 references
