Local-map-based candidate node-encircling pre-configuration cycles construction in survivable mesh networks

This paper studies the protection problem of pre-configuration cycles (p-cycles) in survivable mesh networks. A new algorithm called local-map-based finding p-cycles algorithm (LFCA) is proposed to find the candidate p-cycles. The major difference between the previous algorithms of finding cycles and LFCA is that LFCA can find node-encircling p-cycles and some special link p-cycles which must contain some fixed nodes. The performance of LFCA is evaluated by computer simulations on the real world network topology.