Advertisement

Network Layout and Reliability

  • Jeremiah F. Hayes
Part of the Applications of Communications Theory book series (ACTH)

Abstract

In all of our previous work, we considered the performance of networks, the exact topologies of which were known. In this chapter we shall move one step back, so to speak, and consider the layout of networks which, broadly defined, minimize costs under a set of user requirements. Pedagogy is the primary reason for postponing the discussion of this topic until the very last chapter of the book. The material in this chapter is a distinct departure since the underlying mathematical models are different from the previous chapters of the book. Much of our previous discussion is based of queueing theoretic models, whereas the material in this chapter is based on circuit theory, in particular graph theory.† Moreover, as we shall see, some of the techniques used in this chapter rely on results of previous chapters. The postponing of the discussion of layout techniques has had little impact on our development. In many applications, the topology is determined by factors other than line costs. In local area networks, for example, topology may be determined by the performance of an accessing technique.

Keywords

Topological Optimization Minimum Span Tree Central Node Steiner Tree Central Processor 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    H. Frank and I. T. Frisch, Communication, Transmission and Transportation Networks, Addision-Wesley, Reading, Massachusetts (1971).MATHGoogle Scholar
  2. 2.
    S. Even, Graph Algorithms, Computer Science Press, Rockville, Maryland (1979).MATHGoogle Scholar
  3. 3.
    R. Boorstyn and H. Frank, “Large-Scale Network Topological Optimization,” IEEE Transactions on Communications, COM-25(l), 29–47, January (1977).CrossRefGoogle Scholar
  4. 4.
    H. Frank and W. Chou, “Topological Optimization of Computer Networks,” Proceedings of the IEEE, 60, 1385–1397, November (1972).CrossRefGoogle Scholar
  5. 5.
    M. Gerla and L. Kleinrock, “On the Topological Design of Distributed Computer Networks,” IEEE Transactions on Communications, COM-25(l), 48–60, January (1976).MathSciNetGoogle Scholar
  6. 6.
    S. Lin, “Computer Solutions of the Traveling Salesman Problem,” Bell System Technical Journal, 44, 2245–2269 (1965).MathSciNetMATHGoogle Scholar
  7. 7.
    R. E. Gomory, “The Traveling Salesman Problem,” Proceedings of the IBM Scientific Computing Symposium on Combinatorial Problems (1966).Google Scholar
  8. 8.
    E. M. Reingold, J. Nievergelt, and N. Deo, Combinational Algorithms Theory and Practice, Prentice-Hall, Englewood Cliffs, New Jersey (1977).Google Scholar
  9. 9.
    R. C. Prim, “Shortest-Connection Networks and Some Generalizations,” Bell System Technical Journal, 36, 1389–1401 (1957).Google Scholar
  10. 10.
    J. B. Kruskal, “On the Shortest Spanning Subtree of a Graph and the Traveling Salesman Problem,” Proceedings of the American Mathematical Society, 7 (1956).Google Scholar
  11. 11.
    K. M. Chandy and R. A. Russel, “The Design of Multipoint Linkages in a Teleprocessing Tree Network,” IEEE Transactions on Computers, COM-21, 1062–1066, October (1972).CrossRefGoogle Scholar
  12. 12.
    K. M. Chandy and T. Lo, “The Capacitated Minimum Spanning Tree,” Networks, 3(2), 173–182 (1973).MathSciNetMATHCrossRefGoogle Scholar
  13. 13.
    D. Elias and M. J. Ferguson,” Topological Design of Multipoint Teleprocessing Networks,” IEEE Transactions on Communications, COM-22(11), 1753–1762, November (1974).CrossRefGoogle Scholar
  14. 14.
    L. R. Esau and K. C Williams, “A Method for Approximating the Optimal Network,” IBM Systems Journal, 5, 142–147 (1966).CrossRefGoogle Scholar
  15. 15.
    H. Frank and I. T. Frisch, “Analysis and Design of Survivable Networks,” IEEE Transactions on Communication Technology, COM-18(5), 501–520, October (1970).MathSciNetCrossRefGoogle Scholar
  16. 16.
    R. S. Wilkov, “Analysis and Design of Reliable Computer Networks,” IEEE Transactions on Communications, COM-20(3), 660–678, June (1972).CrossRefGoogle Scholar
  17. 17.
    M. O. Ball, “Computing Network Reliability,” Operations Research, 27(4), 823–838, July-August (1979).MATHCrossRefGoogle Scholar
  18. 18.
    E. F. Moore and C. S. Shannon, “Reliable Circuits Using Less Reliable Relays,” Journal of the Franklin Institute, 262, Pt I, 191–208 (1956).MathSciNetCrossRefGoogle Scholar
  19. 19.
    R. Van Slyke and H. Frank, “Network Reliability Analysis, Part I,” Networks, 1, 279–290 (1972).MATHCrossRefGoogle Scholar
  20. 20.
    R. G. Busacker and T. L. Saaty, Finite Graphs and Networks, McGraw-Hill, New York (1965).MATHGoogle Scholar
  21. 21.
    E. Hansler, G. K. McAuliffe, and R. S. Wilkov, “Exact Calculations of Computer Network Reliability,” AFIPS Proceedings, 41 (1972).Google Scholar
  22. 22.
    V. O. K. Li and J. A. Silvester, “Performance Analysis of Networks with Unreliable Components,” to be published IEEE Transactions on Communications.Google Scholar
  23. 23.
    J. Spragins, “Dependent Failures in Data Communication Systems,” IEEE Ttansactions on Communications, COM-25(15), 1494–1499, December (1977).CrossRefGoogle Scholar
  24. 24.
    S. N. Pan and J. Spragins, “Dependent Failure Reliability Models for Tactical Communications Networks,” Proceedings of the International Conference on Communications (1983), pp. 765–771.Google Scholar
  25. 25.
    Y. F. Lam and V. О. K. Li, “A Failure Model and Reliability Evaluation for Networks with Dependent Failures,” to be published IEEE Transactions on Communications.Google Scholar

Copyright information

© Plenum Press, New York 1984

Authors and Affiliations

  • Jeremiah F. Hayes
    • 1
  1. 1.Concordia UniversityMontrealCanada

Personalised recommendations