𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Blocking probability for a multistage clos connecting network

✍ Scribed by Jean -Luc Lutton; Ernesto Bonomi; Marc Roy Feix

Book ID
105036221
Publisher
Springer
Year
1983
Tongue
English
Weight
464 KB
Volume
31
Category
Article
ISSN
0022-4715

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A problem on blocking probabilities in c
A problem on blocking probabilities in connecting networks
✍ F. R. K. Chung; F. K. Hwang πŸ“‚ Article πŸ“… 1977 πŸ› John Wiley and Sons 🌐 English βš– 286 KB

## Abstract We begin with a three‐stage linear graph in which the first stage has a single node u and the third stage a single node v. The second stage has k independent nodes, each of which is connected by one link to u and to v. In general, we can form a (2n+1)‐stage linear graph recursively by l