Computation of a Redundant Ring in a Hierarchical Communication System
Tóm tắt
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.
Tài liệu tham khảo
A. V. Karzanov, “Combinatorial methods for solving multiflow cut-point problems,” in: Combinatorial Methods in Flow Problems [in Russian], No. 3, VNIISI, Moscow (1979).
D. Philips and A. Garcia-Diaz, Network Analysis Methods [Russian translation], Mir, Moscow (1984).
Yu. E. Malashenko and N. M. Novikova, Uncertainty Models in Multiuser Networks [in Russian], Editorial URSS, Moscow (1999).
M. D. Akhmadi, Yu. E. Malashenko, and N. M. Novikova, “Investigating the liveness of a hierarchical network,” Vestnik MGU, Ser. 15, Vychisl. Matem. Kibern., No. 3 (2001).