Improved method for survivable network design based on pre-cross-connected trails

Journal of Optical Networking

Volumn 6, Issue 2, 2007, Pages 200-216

  Grue, Aden ^a   Grover, Wayne D ^a  

^a TRLABS   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; FIBER OPTIC NETWORKS; HEURISTIC METHODS; INTEGER PROGRAMMING; LINEAR PROGRAMMING; OPTICAL COMMUNICATION;

HEURISTIC ALGORITHM; NON-LOOPING; PRE-CROSS-CONNECTED TRAILS" (PXT);

OPTICAL DESIGN;

EID: 33847250895     PISSN: None     EISSN: 15365379     Source Type: Journal    
DOI: 10.1364/JON.6.000200     Document Type: Article

References (11)

1. T. Y. Chow, F. Chudak, and A. M. French, "Fast optical layer mesh protection using pre-cross-connected trails," IEEE/ACM Trans. Netw. 12, 539-547 (2004).
2. A. Grue and W. D. Grover, "Characterization of pre-cross-connected trails for optical mesh network protection," J. Opt. Netw. 5, 493-508 (2006).
3. A. Kodian and W. D. Grover, "Failure-independent path-protecting p-cycles: efficient and simple fully preconnected optical-path protection," J. Lightwave Technol. 23, 3241-3259 (2005).
4. A. Kodian, W. D. Grover, and J. Doucette, "A disjoint route sets approach to design of failure-independent path-protecting p-cycle networks," in Proceedings of the 5th International Workshop on Design of Reliable Communication Networks (DRCN 2005), 16-19 October 2005, pp. 231-238.
5. The point is that although any solution from the above model will be 100% single-failure restorable, the susceptibility to dual failures, which is what determines availability in a survivable network, depends directly on how many protection relationships to working demands any one protection structure is allowed to bear (see, for example, [6]).
6. D. A. Schupke, W. D. Grover, and M. Clouqueur, "Strategies for enhanced dual failure restorability with static or reconfigurable p-cycle networks," Proc. IEEE International Conference on Communications (ICC) 2004, 20-24 June 2004, pp. 1628-1633.
7. R. Bhandari, Survivable Networks: Algorithms for Diverse Routing (Kluwer Academic, 1999).
8. W. Grover, Mesh-Based Survivable Networks: Options and Strategies for Optical, MPLS, SONET and ATM Networking (Prentice-Hall, 2003).
9. Despite these considerations, this so-called "trap" situation did not actually arise in any of the experimental trials that follow. It is, however, an important consideration in general to ensure solution feasibility. Without it the ILP model may fail in the "trap" situation, reporting infeasibility, as some demands would not be protectable by any PXT.
10. It was pointed out in review that, as PXT stands for "pre-cross- connected trail," and the proper graph theoretical term for a simple trail is a "path," that our so-called "tamed" PXTs could instead be referred to as "pre-cross-connected paths," or PXPs. We agree with this general idea, but in the interest of avoiding the proliferation of terminology in the literature of this field, we will continue to refer to them simply as tamed PXTs. This recognizes the lineage of the present work by presenting it only as a refinement of the more general PXT concept, not an entirely new scheme, as a switch to the new term "PXP" might imply.
11. Use of the term optimal in this context refers only to a complete CPLEX termination for the partially populated problem tableau. Because the full problem was not solved, the results do not represent a truly optimal PXT design.