A Failure Recovery Method Based on Cycle Structure and Its Verification by OpenFlow

The purpose of this study is to realize a fast failure recovery method with reducing packet loss on a large-scale complicated network. Though conventional failure recovery methods can work fast with a little control messages, they might be limited for a ring topology. Some studies try to apply the ring failure recovery methods to mesh networks by extracting ring structure or cycles from the network. However, it is likely to require a large amount of calculation to find an efficient set of cycles that covers all communication links on a network. This paper proposes a control method for one link failure recovery using fundamental tie-sets that cover all links. The experimental results on an Open Flow network demonstrate that the control method can reduce packet loss and control messages in the recovery process.

[1]  Wayne D. Grover,et al.  Algorithmic approaches for efficient enumeration of candidate p-cycles and capacitated p-cycle network design , 2003, Fourth International Workshop on Design of Reliable Communication Networks, 2003. (DRCN 2003). Proceedings..

[2]  Nick McKeown,et al.  OpenFlow: enabling innovation in campus networks , 2008, CCRV.

[3]  Brigitte Jaumard,et al.  A Survey on the p-Cycle Protection Method , 2009, IEEE Communications Surveys & Tutorials.

[4]  Norihiko Shinomiya,et al.  Autonomous recovery for link failure based on tie-sets in information networks , 2011, 2011 IEEE Symposium on Computers and Communications (ISCC).

[5]  Oliver W. W. Yang,et al.  Finding protection cycles in DWDM networks , 2002, 2002 IEEE International Conference on Communications. Conference Proceedings. ICC 2002 (Cat. No.02CH37333).

[6]  Wayne D. Grover,et al.  Hamiltonian p-cycles for fiber-level protection in semi-homogeneous homogeneous and optical networks , 2004, IEEE Network.

[7]  Hitoshi Watanabe,et al.  A study on the tie-set graph theory and network flow optimization problems , 2004, Int. J. Circuit Theory Appl..

[8]  肖文华,et al.  Ethernet ring protection switching method and nodes , 2015 .

[9]  Wayne D. Grover,et al.  Cycle-oriented distributed preconfiguration: ring-like speed with mesh-like capacity for self-planning network restoration , 1998, ICC '98. 1998 IEEE International Conference on Communications. Conference Record. Affiliated with SUPERCOMM'98 (Cat. No.98CH36220).

[10]  Chang Liu,et al.  Finding good candidate cycles for efficient p-cycle network design , 2004, Proceedings. 13th International Conference on Computer Communications and Networks (IEEE Cat. No.04EX969).

[11]  Norihiko Shinomiya,et al.  A theory of tie‐set graph and its application to information network management , 2001, Int. J. Circuit Theory Appl..

[12]  Wayne D. Grover.  Bridging the Ring-Mesh Dichotomy With P-Cycles , 2000 .