Stochastic Damage Models and Dependence Effects in the Survivability Analysis of Communication Networks
- 1 March 1986
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Journal on Selected Areas in Communications
- Vol. 4 (2) , 234-242
- https://doi.org/10.1109/jsac.1986.1146310
Abstract
Stochastic analyses of the Survivability of communication networks often include a simplifying assumption that failures of, or damages to, various components of the network are statistically independent. This assumption can be quite unrealistic and can lead one to conclusions that are grossly in error. Survivability analyses and syntheses of robust networks should incorporate dependencies introduced by single events that affect large geographical areas. In this paper, we construct a stochastic damage model, analyze it, and apply the results to the survivability analysis of some simple network topologies. We demonstrate how the results can differ significantly from those obtained when independence of damage is assumed. The damage model consists of a Poisson ensemble of events (damage centers) on the plane, of given intensity (level of attack), and a network resource is damaged, and hence dysfunctional, if it lies within a radius ρ (damage radius) of some damage-causing event. Statistical properties of the damage process are obtained (e.g., the covariance function, mean and variance of the damage extent on a line resulting from the Poisson ensemble) and used to evaluate dependence effects. The damage process on a line is shown to be an alternating renewal process corresponding to the busy/idle process of an appropriately definedM/G/inftyqueue, and standardM/G//inftyand Type-II counter results can thus be exploited to obtain some desired quantities.Keywords
This publication has 9 references indexed in Scilit:
- Reliability Modeling and Analysis of Communication Networks with Dependent FailuresIEEE Transactions on Communications, 1986
- On inference in a one-dimensional mosaic and an M/G/∞ queueAdvances in Applied Probability, 1985
- The Complexity of Counting Cuts and of Computing the Probability that a Graph is ConnectedSIAM Journal on Computing, 1983
- Geometric ProbabilityPublished by Society for Industrial & Applied Mathematics (SIAM) ,1978
- Survivability Analysis of Command and Control Communications Networks--Part IIIEEE Transactions on Communications, 1974
- A Theorem about Random FieldsBulletin of the London Mathematical Society, 1973
- Analysis and Design of Reliable Computer NetworksIEEE Transactions on Communications, 1972
- Analysis and Design of Survivable NetworksIEEE Transactions on Communications, 1970
- Reliable circuits using less reliable relaysJournal of the Franklin Institute, 1956