Computation of a Redundant Ring in a Hierarchical Communication System
| Autor: | Akhmadi, M. |
|---|---|
| Zdroj: | Computational Mathematics and Modeling; April 2003, Vol. 14 Issue: 2 p183-215, 33p |
| Abstrakt: | A hierarchical communication network, i.e., a multicommodity-flow star network, is considered. An exact bound is derived for the necessary and sufficient ring redundancy that guarantees attainment of the liveness upper bound. |
| Databáze: | Supplemental Index |
| Externí odkaz: |
|
Full text from SpringerLink