Premium
Optical index of fault tolerant routings in WDM networks
Author(s) -
Bessy Stéphane,
Lepelletier Clément
Publication year - 2010
Publication title -
networks
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.977
H-Index - 64
eISSN - 1097-0037
pISSN - 0028-3045
DOI - 10.1002/net.20351
Subject(s) - bipartite graph , fault tolerance , computer science , wavelength division multiplexing , index (typography) , graph theory , arc (geometry) , network planning and design , graph , computer network , theoretical computer science , discrete mathematics , mathematics , combinatorics , distributed computing , physics , wavelength , geometry , optoelectronics , world wide web
Maňuch and Stacho (Theoret Inform Appl 37 (2003), 255–270) introduced the problem of designing f ‐tolerant routings in optical networks, i.e. routings which still satisfy the given requests even if f failures occur in the network. In this article, we provide f ‐tolerant routings in complete and complete balanced bipartite optical networks, optimal according to two parameters: the arc‐forwarding index and the optical index. These constructions use tools from design theory and graph theory and improve previous results of Dinitz et al. (Networks 48 (2006), 47–54) for the complete network, and Gupta et al. (J Combin Design 14 (2006), 25–40) for the complete balanced bipartite network. © 2009 Wiley Periodicals, Inc. NETWORKS, 2010