• DocumentCode
    283837
  • Title

    Minimum number of links needed for fault-tolerance in cluster-based network

  • Author

    Ishida, Kenji ; Kikuno, Tohru

  • Author_Institution
    Dept. of Inf. Sci., Hiroshima Prefectural Univ., Japan
  • fYear
    1991
  • fDate
    26-27 Sep 1991
  • Firstpage
    114
  • Lastpage
    119
  • Abstract
    One of the most difficult problems in network management for large computer networks is to manage a huge amount of network information. The way to overcome the difficulty is to introduce hierarchical control for network management. Additionally, it is said that a locality has a very important role for the design of hierarchical computer networks. The paper proposes a new fault-tolerant topology in a cluster-based network with respect to the locality. The following results are obtained: (1) At least 2n-2 links are needed in the cluster with the fault-tolerant topology, where n is the number of border nodes in the cluster. (2) As far as network connectivity is not losing, updating of routing information at each node can be localized within only the cluster containing failed links
  • Keywords
    computer networks; fault tolerant computing; telecommunication network management; telecommunication network routing; border nodes; cluster-based network; failed links; fault-tolerant topology; hierarchical computer networks; hierarchical control; locality; network connectivity; network information; network management; routing information; Clustering algorithms; Communications technology; Computer network management; Computer networks; Data communication; Fault tolerance; Information science; Intelligent networks; Network topology; Routing;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Fault Tolerant Systems, 1991. Proceedings., Pacific Rim International Symposium on
  • Conference_Location
    Kawasaki
  • Print_ISBN
    0-8186-2275-X
  • Type

    conf

  • DOI
    10.1109/{RFTS.1991.212956
  • Filename
    212956