Multi-criteria p-cycle network design

The major challenge of p-cycle network design resides in finding an optimal set of p-cycles protecting the network for a given working capacity. Existing solutions (exact and heuristic approaches), for solving the problem, find the set of p-cycles protecting the network through two steps: one step for generating candidate p-cycles and a second step for selecting the efficient ones. In this paper, we present a novel heuristic approach, which computes an efficient set of p-cycles protecting the network in one step. Our heuristic approach takes into consideration two different criteria: the redundancy and the number of p-cycles involved in the solution. Simulation study shows that our approach necessitates a lower redundancy and fewer p-cycles to protect the network compared to state-of-the-art approaches.

[1]  Achim Autenrieth,et al.  Optimal configuration of p-cycles in WDM networks , 2002, 2002 IEEE International Conference on Communications. Conference Proceedings. ICC 2002 (Cat. No.02CH37333).

[2]  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).

[3]  Daryoush Habibi,et al.  QRP02-5: Joint Optimization in Capacity Design of Networks with p-Cycle Using the Fundamental Cycle Set , 2006, IEEE Globecom 2006.

[4]  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).

[5]  Herbert S. Wilf,et al.  Algorithms and Complexity , 1994, Lecture Notes in Computer Science.

[6]  Biswanath,et al.  A Heuristic Algorithm for P-Cycles Configuration in WDM Optical Networks , 2003 .

[7]  W.D. Grover,et al.  p-cycle network design: From fewest in number to smallest in size , 2007, 2007 6th International Workshop on Design and Reliable Communication Networks.

[8]  C. G. Gruber.  Resilient networks with non-simple p-cycles , 2003, 10th International Conference on Telecommunications, 2003. ICT 2003..

[9]  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).

[10]  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..

[11]  Jan van Leeuwen,et al.  Handbook of Theoretical Computer Science, Vol. A: Algorithms and Complexity , 1994 .

[12]  Wayne D. Grover,et al.  Advances in optical network design with p-cycles: joint optimization and pre-selection of candidate p-cycles , 2002, IEEE/LEOS Summer Topi All-Optical Networking: Existing and Emerging Architecture and Applications/Dynamic Enablers of Next-Generation Optical Communications Systems/Fast Optical Processing in Optical.

[13]  José-Luis Marzo,et al.  Performance evaluation of minimum interference routing in network scenarios with protection requirements , 2007, Comput. Commun..