On survivability of communication networks.
Loading...
Authors
Enginler, Seyfettin.
Subjects
probability of survival
min-cut max-flow theorem
enemy attack
min-cut max-flow theorem
enemy attack
Advisors
Chan, Shu-gar
Date of Issue
1971-12
Date
December 1971
Publisher
Monterey, California ; Naval Postgraduate School
Language
en_US
Abstract
The probability of survival of a communication network is defined as the probability that there exist at least one path between any pair of stations within the network. In this thesis, four methods for the calculation of the probability of survival of the network, which is under enemy attack, are presented.
The first two methods deal with random networks whose links have finite and identical probability of survival while the third and fourth methods are based on the min-cut max-flow theorem.
Type
Thesis
Description
Series/Report No
Department
Electrical Engineering
Organization
Naval Postgraduate School (U.S.)
Identifiers
NPS Report Number
Sponsors
Funder
Format
Citation
Distribution Statement
Approved for public release; distribution is unlimited.
Rights
Copyright is reserved by the copyright owner