A simple and complete computational analysis of MAP/R/1 queue using roots (Q370902)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A simple and complete computational analysis of MAP/R/1 queue using roots |
scientific article; zbMATH DE number 6209859
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A simple and complete computational analysis of MAP/R/1 queue using roots |
scientific article; zbMATH DE number 6209859 |
Statements
A simple and complete computational analysis of MAP/R/1 queue using roots (English)
0 references
20 September 2013
0 references
queueing
0 references
Markovian arrival process (MAP)
0 references
queueing-time
0 references
roots
0 references
system-length
0 references
rational Laplace-Stieltjes transform
0 references
matrix-exponential (ME)
0 references
phase-type (PH)
0 references
0 references
0.878561794757843
0 references
0.8548475503921509
0 references
0.8257945775985718
0 references
0.821355938911438
0 references
0.8167331218719482
0 references
