Premium
Fault‐tolerant routings with minimum optical index
Author(s) -
Dinitz Jeffrey H.,
Ling Alan,
Stinson Douglas R.
Publication year - 2006
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.20119
Subject(s) - computer science , fault tolerance , graph , construct (python library) , context (archaeology) , directed graph , property (philosophy) , mathematics , combinatorics , algorithm , theoretical computer science , distributed computing , computer network , paleontology , philosophy , epistemology , biology
We construct sets of routings in the complete directed graph $\vec{K}_n$ that tolerate up to f failures of nodes or links. These routings are optimal with respect to several desirable criteria. In addition, our routings have minimum (or close to minimum) possible optical indices, which means that wavelengths can be assigned to the directed paths in the routings in an efficient manner. This property is useful in the context of optical networks. © 2006 Wiley Periodicals, Inc. NETWORKS, Vol. 48(1), 47–55 2006