An efficient stable recursion to compute multiservice blocking probabilities (Q4779299)
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: An efficient stable recursion to compute multiservice blocking probabilities |
scientific article; zbMATH DE number 1835078
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An efficient stable recursion to compute multiservice blocking probabilities |
scientific article; zbMATH DE number 1835078 |
Statements
An efficient stable recursion to compute multiservice blocking probabilities (English)
0 references
24 June 2003
0 references
quality of service
0 references
0.849223792552948
0 references
0.8488337993621826
0 references
0.8476260304450989
0 references
0.7862576842308044
0 references
0.7787960767745972
0 references
