Skip to main content
SpringerLink
Log in

On the realization of reliability functions of probabilistic communication networks

  • Published:
Journal of Engineering Mathematics Aims and scope Submit manuscript

Abstract

This paper presents some properties and interrelationships of terminal reliability functions of probabilistic communication networks with distinct element reliabilities. Based on topological techniques a synthesis procedure as well as realizability conditions are given. In addition, a uniqueness theorem is proved.

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. S.Seshu and M.Reed, “Linear Graphs and Electrical Networks,” Addison-Wesley, 1961.

  2. Y. Fu and S. Yau, “A Note on the Reliability of Communication Networks,” J.SIAM, Sept. 1962, vol. 10, pp 469–474.

    Google Scholar 

  3. W. Mayeda, “Application of Linear Graphs to Electrical Networks, Switching Networks and Communication Nets,” Rpt. R-203, Coordinate Science Lab., Univ. of Illinois, Urbana, Ill., 1964.

    Google Scholar 

  4. Y. Fu, “Applications of Topological Methods to Probabilistic Communication Networks, “IEEE Trans. on Communication Technology, vol. COM-13, no. 3, Sept. 1965, pp 301–307.

    Google Scholar 

  5. L.M. Maxwell, “Synthesis of Contact Networks from Prescribed Reliability Functions,”J. of Franklin Institute, vol. 281, no. 3, March 1966.

  6. S.G.Chan and S.P.Chan, “Some Applications of Topology to Probabilistic Communication Networks,”Conf. Record, 9th Midwest Symposium on Circuit Theory, May 1966.

  7. S.P. Chan, “Topological Analysis and Synthesis of Single-Contact Networks,”Final Report, NSF Grant GP-2760, EE Dept., Univ. of Santa Clara, July 1965.

  8. W. Mayeda, “Necessary and Sufficient Conditions for Realizability of Cut-set Matrices,”IRE Trans. on Circuit Theory, vol. CT-7, March 1960, pp 79–81.

    Google Scholar 

  9. S.L. Hakimi, “On the Realization of a Set of Trees,”IRE Trans. on Circuit Theory, vol. CT-8, March 1961, pp 11–17.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Electrical Engineering, U.S. Naval Postgraduate School, USA

    Shu -Gar Chan

  2. Department of Electrical Engineering, Southern Methodist University, USA

    Yumin Fu

  3. Department of Electrical Engineering, University of Santa Clara, Santa Clara, Calif., USA

    S. Park Chan

Authors
  1. Shu -Gar Chan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yumin Fu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. S. Park Chan
    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

Chan, S.G., Fu, Y. & Chan, S.P. On the realization of reliability functions of probabilistic communication networks. J Eng Math 2, 39–51 (1968). https://doi.org/10.1007/BF01534958

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01534958

Keywords

Search

Navigation