Survivability and Recovery of Degraded Communication Networks
Abstract
When multiple nodes in a network are subject to failure or loss, the question arises as to whether communication across the resulting degraded network is feasible. Percolation theory and random graph theory have been previously used to answer this question. Here we extend random geometric graph theory to the case of networks with some randomness in link formation. In addition, initial steps toward addressing the little studied question as to how to recover from failures that destroy network connectivity are shown here.
Document Details
- Document Type
- Technical Report
- Publication Date
- May 04, 2011
- Accession Number
- ADA570718
Entities
People
- Ira Kohlberg
- Linda Zeger
Organizations
- Massachusetts Institute of Technology