Skip to main content
SpringerLink
Log in

Computation of a Redundant Ring in a Hierarchical Communication System

  • Published:
Computational Mathematics and Modeling Aims and scope Submit manuscript

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

REFERENCES

  1. A. V. Karzanov, “Combinatorial methods for solving multiflow cut-point problems,” in: Combinatorial Methods in Flow Problems [in Russian], No. 3, VNIISI, Moscow (1979).

    Google Scholar 

  2. D. Philips and A. Garcia-Diaz, Network Analysis Methods [Russian translation], Mir, Moscow (1984).

    Google Scholar 

  3. Yu. E. Malashenko and N. M. Novikova, Uncertainty Models in Multiuser Networks [in Russian], Editorial URSS, Moscow (1999).

    Google Scholar 

  4. 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).

Download references

Authors
  1. M. B. Akhmadi
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Akhmadi, M.B. Computation of a Redundant Ring in a Hierarchical Communication System. Computational Mathematics and Modeling 14, 183–215 (2003). https://doi.org/10.1023/A:1022963708621

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1022963708621

Keywords

Search

Navigation