Design of survivable communications networks under performance constraints

Abstract

The authors describe a network design algorithm that uses a set of deterministic connectivity measures which result in topologically survivable network designs that also meet processing and performance requirements. The authors briefly describe some applicable graph theoretic concepts and recently developed connectivity measures. They describe systematic procedures for improving the topological survivability of a network, and the overall network design process. A design example is presented. >