ACM Home Page
Please provide us with feedback. Feedback
Single-link failure detection in all-optical networks using monitoring cycles and paths
Full text PdfPdf (913 KB)
Source IEEE/ACM Transactions on Networking (TON) archive
Volume 17 ,  Issue 4  (August 2009) table of contents
Pages 1080-1093  
Year of Publication: 2009
ISSN:1063-6692
Authors
Satyajeet S. Ahuja  Infinera Corporation, Sunnyvale, CA and Department of Electrical and Computer Engineering, University of Arizona, Tucson, AZ
Srinivasan Ramasubramanian  Department of Electrical and Computer Engineering, University of Arizona, Tucson, AZ
Marwan M. Krunz  Department of Electrical and Computer Engineering, University of Arizona, Tucson, AZ
Publisher
IEEE Press  Piscataway, NJ, USA
Bibliometrics
Downloads (6 Weeks): 37,   Downloads (12 Months): 37,   Citation Count: 0
Additional Information:

abstract   references   index terms  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: 10.1109/TNET.2008.2008000

ABSTRACT

In this paper, we consider the problem of fault localization in all-optical networks. We introduce the concept of monitoring cycles (MCs) and monitoring paths (MPs) for unique identification of single-link failures. MCs and MPs are required to pass through one or more monitoring locations. They are constructed such that any single-link failure results in the failure of a unique combination of MCs and MPs that pass through the monitoring location(s). For a network with only one monitoring location, we prove that three-edge connectivity is a necessary and sufficient condition for constructing MCs that uniquely identify any single-link failure in the network. For this case, we formulate the problem of constructing MCs as an integer linear program (ILP). We also develop heuristic approaches for constructing MCs in the presence of one or more monitoring locations. For an arbitrary network (not necessarily three-edge connected), we describe a fault localization technique that uses both MPs and MCs and that employs multiple monitoring locations. We also provide a linear-time algorithm to compute the minimum number of required monitoring locations. Through extensive simulations, we demonstrate the effectiveness of the proposed monitoring technique.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
 
3
 
4
CPLEX. [Online]. Available: http://www.cplex.com.
 
5
 
6
Y. Hamazumi, M. Koga, K. Kawai, H. Ichino, and K. Sato, "Optical path fault management in layered networks," in Proc. IEEE Globecom, Nov. 1998, vol. 4, pp. 2309-2314.
 
7
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," in Proc. IEEE INFOCOM, May 2007.
 
8
J. Hopcraft and R. E. Tarjan, "Dividing a graph into triconnected components," SIAM J. Comput., vol. 2, no. 3, pp. 135-158, 1973.
 
9
S. Maclane, "A structural characterization of planar combinatorial graphs," DUKE Math J., vol. 3, no. 3, pp. 460-472, 1937.
 
10
 
11
B. M. Waxman, "Routing of multipoint connections," IEEE J. Sel. Areas Commun., vol. 69, pp. 1617-1622, Dec. 1988.
 
12
Y. Wen, V. W. S. Chan, and L. Zheng, "Efficient fault diagnosis algorithms for all-optical WDM networks with probabilistic link failures," J. Lightw. Technol., vol. 23, no. 10, pp. 3358-3371, Oct. 2005.
 
13