• DocumentCode
    3089196
  • Title

    Network Failure Recovery with Tie-Sets

  • Author

    Kadena, Kiyoto ; Nakayama, Kiyoshi ; Shinomiya, Norihiko

  • Author_Institution
    Grad. Sch. of Eng., Soka Univ., Tokyo, Japan
  • fYear
    2011
  • fDate
    22-25 March 2011
  • Firstpage
    467
  • Lastpage
    472
  • Abstract
    The present research aims to recover network failure in networks with a complicated topology by focusing on tie-sets. A tie-set implies a set of links constituting a loop. The entire network is divided into smaller local units of tie-sets which encompass all network vertices and links. These units realize network management for quick and flexible failure recovery. This paper first introduces the concept of tie-sets, and then proposes a recovery method for single link failures. The latter half of the paper deals with the efficiency of failure recovery in different spanning trees. Since a hypothesis is formed by a numerical evaluation the paper proposes a method of determining a spanning tree for quick link failure recovery.
  • Keywords
    recovery; set theory; telecommunication network management; trees (mathematics); network failure recovery; network management; single link failures; spanning trees; tie-sets; Complexity theory; Focusing; Mesh networks; Multiplexing; Network topology; Protocols; Topology; graph theory; link failure recovery; tie-sets;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Advanced Information Networking and Applications (WAINA), 2011 IEEE Workshops of International Conference on
  • Conference_Location
    Biopolis
  • Print_ISBN
    978-1-61284-829-7
  • Electronic_ISBN
    978-0-7695-4338-3
  • Type

    conf

  • DOI
    10.1109/WAINA.2011.125
  • Filename
    5763545