Skip to main content
SpringerLink
Log in

Zuverlässigkeit von Netzen

  • Chapter
Graphen Algorithmen Netze

Part of the book series: Moderne Kommunikationstechnik ((XMK))

  • 110 Accesses

Zusammenfassung

Wir benutzen Graphen zur Modellierung der Struktur eines Kommunikationsnetzes. Ein Ziel ist es selbstverständlich, daß in dem Netz die Stationen möglichst zuverlässig miteinander kommunizieren können. Das Wort “zuverlässig” beziehen wir dabei nur auf die prinzipielle Kommunikationsfähigkeit (also Erreichbarkeit der Stationen) und nicht auf die Unversehrtheit bzw. Rekonstruierbarkeit der Nachrichteninhalte (Stichwort Fehlerkorrektur).

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 49.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 49.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Literatur

  1. Awerbuch, B; Even, S. Reliable broadcast protocols in unreliable networks Networks 16 (1986), 381–396

    Article  Google Scholar 

  2. Ball, M. O.; Provan, J. S. Bounds on the reliability polynomial for shellable independence systems SIAM J. on Alg. and Disc. Methods 3 (1982), 166–181

    Article  MathSciNet  MATH  Google Scholar 

  3. Bauer, D.; Boesch, F.; Suffel, C; Tindell, R. Combinatorial optimization problems in the analysis and design of probabilistic networks Networks 15 (1985), 257–271

    Article  MathSciNet  MATH  Google Scholar 

  4. Boesch, F. T. On unreliability polynomials and graph connectivity in reliable network synthesis Journal of Graph Theory 10 (1986), 339–352

    Article  MathSciNet  MATH  Google Scholar 

  5. Boesch, F. T.; Satyanarayana, A.; Suffel, C. L. Least reliable networks and the reliability domination IEEE Trans. on Comm. 38 (1990), 2004–2009

    Article  MATH  Google Scholar 

  6. Boffey, T. B. Computer network design problems Preprint, University of Liverpool, 1991

    Google Scholar 

  7. Bollobas, B. Random graphs Academic Press, 1985

    MATH  Google Scholar 

  8. Brooks, R. L.; Smith, C. A. B.; Stone, H. G.; Tutte, W. T. The dissection of rectangles into squares Duke Math. Journal 7 (1940), 312–340 Oxford University Press, 1987

    Article  MathSciNet  Google Scholar 

  9. Colbourn, C. J. The combinatorics of network reliability Oxford University Press, 1987

    Google Scholar 

  10. Dörfler, W.; Mühlbacher, J. Graphentheorie für Informatiker de Gruyter, 1973

    Google Scholar 

  11. Feller, W. An introduction to probability theory and its applications Wiley, 1987

    Google Scholar 

  12. Frank, H.; Frisch, I. T. Communication, transmission, and transportation networks Addison-Wesley, 1971

    MATH  Google Scholar 

  13. Gafni, E. M.; Bertsekas, D. P. Distributed algorithms for generating loop-free routes in networks with frequently changing topology IEEE Trans. on Comm. 29 (1981), 11–18

    Article  MathSciNet  Google Scholar 

  14. Garey, M. R.; Johnson, D. S. Computers and intractability W. H. Freeman, 1979

    MATH  Google Scholar 

  15. Gumm, H.-R; Poguntke, W. Boolsche Algebra BI — HTB, 1981

    Google Scholar 

  16. Hu, T. C. Optimum communication spanning trees SIAM J. Comput. 3 (1974), 188–195

    MATH  Google Scholar 

  17. Kel’mans, A. K. Some problems of network reliability analysis Automation and Remote Control 26 (1965), 564–573

    MathSciNet  MATH  Google Scholar 

  18. Kirchhoff, G. Über die Auflösung der Gleichungen, auf welche man bei der Untersuchung der Verteilung galvanischer Ströme geführt wird Ann. Phys. Chem. 72 (1847), 497–508

    Article  Google Scholar 

  19. Lomonosov, M. V.; Poleskii, V. P. Lower bound of network reliability Problems of Information Transmission 8 (1972), 118–123

    Google Scholar 

  20. Manoussakis, J.; Tuza, Z. Optimal routings in communication networks with linearly bounded capacity Rapport de Recherche No. 597, Universite de Paris-Sud, 1990

    Google Scholar 

  21. Minoux, M. Network synethesis and optimum network design problems Networks 19 (1989), 313–360

    Article  MathSciNet  MATH  Google Scholar 

  22. Papoulis, A. Probability, random variables, and stochastic processes McGraw-Hill, 1984

    MATH  Google Scholar 

  23. Piekarski, M. Listing of all possible trees of a linear graph IEEE Trans. Circuit Theory 12 (1965), 124–125

    Google Scholar 

  24. Poguntke, W. Static routing tables with multiple entries: a graph-theoretic study FernUniversität Hagen, 1990.

    Google Scholar 

  25. Poguntke, W. On the design of communication networks using restricted message routing Proceedings of the IEEE Int. Conf. on Communications, Genf 1993, 681–685

    Google Scholar 

  26. Provan, J. S.; Ball, M. O. The complexity of counting cuts and of computing the probability that a graph is connected SIAM J. on Computing 12 (1983), 777–788

    Article  MathSciNet  MATH  Google Scholar 

  27. Schneeweis, W. G. Boolean functions with engineering applications and computer programs Springer, 1989

    Google Scholar 

  28. Schneeweis, W. G. Fehlertolerierende Rechensysteme FernUniversität Hagen, Kurs Nr. 1750

    Google Scholar 

  29. Sperner, E. Ein Satz über Untermengen einer endlichen Menge Mathematische Zeitschrift 27 (1928), 544–548

    Article  MathSciNet  MATH  Google Scholar 

  30. Van Slyke, R. M.; Frank, H. Network reliability analysis: part I Networks 1 (1972), 279–290

    Article  MATH  Google Scholar 

  31. Wegener, I. The complexity of Boolean functions Wiley, 1987

    MATH  Google Scholar 

Download references

Authors
  1. Firoz Kaderali
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Werner Poguntke
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Friedr. Vieweg & Sohn Verlagsgesellschaft mbH, Braunschweig/Wiesbaden

About this chapter

Cite this chapter

Kaderali, F., Poguntke, W. (1995). Zuverlässigkeit von Netzen. In: Graphen Algorithmen Netze. Moderne Kommunikationstechnik. Vieweg+Teubner Verlag. https://doi.org/10.1007/978-3-322-89870-8_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-322-89870-8_9

  • Publisher Name: Vieweg+Teubner Verlag

  • Print ISBN: 978-3-528-06662-8

  • Online ISBN: 978-3-322-89870-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation