Optimal Backup Capacity Improvements in Optical Mesh Networks

In this paper, we discuss the performance of those pp-cycles produced by BFS. Then we compare it to DFS (depth first search) using different choice criteria on the ´next node´ which is the node following the current node in the search process. The optimal solution for the minimum backup (spare) capacity is usually obtained by finding a subset of the candidates set. MCG is a good algorithm to search with certain property in the dual graph domain to produce a subset of cycles. During the searching process, the order of choosing neighbor nodes is important. Several options are available for the selection of neighbor nodes. Here, we shall consider three criteria for choosing the next node using either BFS or DFS: label value, shared links, links cost.