Network Layout and Reliability
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.
KeywordsTopological Optimization Minimum Span Tree Central Node Steiner Tree Central Processor
Unable to display preview. Download preview PDF.
- 7.R. E. Gomory, “The Traveling Salesman Problem,” Proceedings of the IBM Scientific Computing Symposium on Combinatorial Problems (1966).Google Scholar
- 8.E. M. Reingold, J. Nievergelt, and N. Deo, Combinational Algorithms Theory and Practice, Prentice-Hall, Englewood Cliffs, New Jersey (1977).Google Scholar
- 9.R. C. Prim, “Shortest-Connection Networks and Some Generalizations,” Bell System Technical Journal, 36, 1389–1401 (1957).Google Scholar
- 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
- 21.E. Hansler, G. K. McAuliffe, and R. S. Wilkov, “Exact Calculations of Computer Network Reliability,” AFIPS Proceedings, 41 (1972).Google Scholar
- 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
- 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.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