SRLG failure localization in all-optical networks using monitoring cycles and paths

Proceedings - IEEE INFOCOM

Volumn , Issue , 2008, Pages 700-708

  Ahuja, Satyajeet S ^a   Ramasubramanian, Srinivasan ^a   Krunz, Marwan ^a  

^a UNIVERSITY OF ARIZONA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER COMMUNICATIONS; MONITORING CYCLES; MONITORING LOCATIONS;

COMPUTATIONAL GEOMETRY; COMPUTER NETWORKS; FIBER OPTIC NETWORKS; GRAPH THEORY; HEURISTIC PROGRAMMING; INTEGER PROGRAMMING; LINEAR PROGRAMMING; LOCATION; OPTICAL COMMUNICATION; OPTICAL DATA PROCESSING; OPTICAL MATERIALS; THEOREM PROVING; TRAJECTORIES;

CONDITION MONITORING;

EID: 51349159765     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFOCOM.2007.45     Document Type: Conference Paper

References (14)

1. R. K. Ahuja, T. L. Magnanti, and J. B. Orlin. Network flows: Theory, Algorithm, and Applications. Prentice Hall Inc., 1993.
2. C. Assi, Y. Ye, A. Shami, S. Dixit, and M. Ali. A hybrid distributed fault-management protocol for combating single-fiber failures in mesh-based DWDM optical networks. Proceedings of the IEEE Globecom Conference, 3:2676-2680, Nov. 2002.
3. R. Bhandari. Survivable Networks: Algorithms for Diverse Routing. Kluwer Academic Publishers, 1999.
4. T. H. Cormen, C. E. Leiserson, and R. L. Rivest. Introduction to Algorithms. Prentice Hall Inc., 1998.
5. CPLEX. http://www.cplex.com.
6. Z. Galil and G. F. Italiano. Maintaining the 3-edge-connected components of a graph on-line. SIAM Journal on Computing, 22(1): 11-28, 1993.
7. M. Goyal, K. Ramakrishnan, and W. Feng. Achieving faster failure detection in OSPF networks. Proceedings of the IEEE ICC Conference, 1:296-300, May 2003.
8. Y. Hamazumi, M. Koga, K. Kawai, H. Ichino, and K. Sato. Optical path fault management in layered networks. Proceedings of the IEEE Globecom Conference, 4:2309-2314, Nov. 1998.
9. N. Harvey, M. Patrascu, Y. Wen, S. Yekhanin, and V. W. S. Chan. Non-adaptive fault diagnosis for All-optical networks via combinatorial group testing on graphs. Proceedings of the IEEE INFOCOM Conference, May 2007.
10. J. Hopcraft and R. E. Tarjan. Dividing a graph into triconnected components. SIAM Journal of Computing. 2(3):135-158, 1973.
11. S. Maclane. A structural characterization of planar combinatorial graphs. DUKE Math Journal, 3(3):460-472, 1937.
12. A. Todimala and B. Ramamurthy. Survivable virtual topology routing under shared risk link groups in WDM networks. First International Conference on Broadband Networks (BROADNETS), pages 130-139, Oct. 2004.
13. B. M. Waxman. Routing of multipoint connections. IEEE Journal on Selected Areas in Communications, 69:1617-1622, Dec. 1988.
14. Y. Wen, V. W. S. Chan, and L. Zheng. Efficient fault diagnosis algorithms for All-optical WDM networks with probabilistic link failures. IEEE/OSA Journal of Lightwave Technology, 23(10):3358-3371, Oct. 2005.