Recursive Algorithms for Computing End-to-End Blocking in a Network with Arbitrary Routing Plan (Q3856597)
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: Recursive Algorithms for Computing End-to-End Blocking in a Network with Arbitrary Routing Plan |
scientific article; zbMATH DE number 3657641
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Recursive Algorithms for Computing End-to-End Blocking in a Network with Arbitrary Routing Plan |
scientific article; zbMATH DE number 3657641 |
Statements
Recursive Algorithms for Computing End-to-End Blocking in a Network with Arbitrary Routing Plan (English)
0 references
1980
0 references
algorithms for computing end-to-end blocking probabilities in a network with alternate routing
0 references
link blocking probabilities
0 references
arbitrary routing plans
0 references
single-loss-route routing plans
0 references
predictive routing plans
0 references
terminal-pair reliability problem
0 references
tandem-node-matrix-generated routing plans
0 references
hierarchical routing plans
0 references
