Analysis and Design of Survivable Networks
- 1 October 1970
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 18 (5) , 501-519
- https://doi.org/10.1109/tcom.1970.1090419
Abstract
The problem of designing networks that can survive an enemy attack or natural disaster has received considerable attention in recent years. Work in this area has focused on the formulation of survivability criteria, the development of analysis methods to rank networks with respect to these criteria, and the generation of networks which are optimal with respect to these criteria. Many partial results for a variety of network models are available. The purpose of this paper is to summarize the most significant of these results, to link various models and approaches, and to indicate areas of study in which additional research seems both desirable and feasible.Keywords
This publication has 19 references indexed in Scilit:
- On the Minimum m Degree Vulnerability CriterionIEEE Transactions on Circuit Theory, 1971
- The Design of Minimum-Cost Survivable NetworksIEEE Transactions on Circuit Theory, 1969
- Flow variation in multiple min-cut calculationsJournal of the Franklin Institute, 1969
- On the Smallest Disconnecting Set in a GraphIEEE Transactions on Circuit Theory, 1968
- Vulnerability of Communication NetworksIEEE Transactions on Communications, 1967
- On Distributed Communications NetworksIEEE Transactions on Communications, 1964
- Monte Carlo MethodsPublished by Springer Nature ,1964
- Multi-Terminal Network FlowsJournal of the Society for Industrial and Applied Mathematics, 1961
- Random GraphsThe Annals of Mathematical Statistics, 1959
- On some problems of random netsBulletin of Mathematical Biology, 1952