• DocumentCode
    1167551
  • Title

    Connectivity considerations in the design of survivable networks

  • Author

    Frank, H. ; Chou, W.

  • Volume
    17
  • Issue
    4
  • fYear
    1970
  • fDate
    11/1/1970 12:00:00 AM
  • Firstpage
    486
  • Lastpage
    490
  • Abstract
    The problem of constructing networks that are "survivable" with respect to branch damage is considered. The networks are modeled by linear graphs and a square symmetric "redundancy" matrix R\´=[r\´_ij] is specified. Algorithms are given to construct an undirected graph G with a minimum number of branches such that 1) G contains no parallel branches, and 2) for all i, j there are at least r\´_ij branch disjoint paths between the ith and jth vertices. These algorithms are complicated but may easily be applied to construct graphs with several hundred vertices.
  • Keywords
    Network topology; Survivable networks; Communication networks; Computer networks; Network synthesis; Symmetric matrices;
  • fLanguage
    English
  • Journal_Title
    Circuit Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9324
  • Type

    jour

  • DOI
    10.1109/TCT.1970.1083185
  • Filename
    1083185
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1167551