Distributed network control for optical networks
IEEE/ACM Transactions on Networking (TON)
Optical networks: a practical perspective
Optical networks: a practical perspective
Graph Algorithms
Handbook of Theoretical Computer Science: Algorithms and Complexity
Handbook of Theoretical Computer Science: Algorithms and Complexity
Design of a Survivable WDM Photonic Network
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Fault Tolerant WDM Rings with Limited Wavelength Conversion
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
An O(v|v| c |E|) algoithm for finding maximum matching in general graphs
SFCS '80 Proceedings of the 21st Annual Symposium on Foundations of Computer Science
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
| Hi-index | 0.00 |
We are motivated by the developments in all-optical networks - a new technology that supports high bandwidth demands. These networks provide a set of lightpaths which can be seen as high-bandwidth pipes on which communication is performed. Since the capacity enabled by this technology substantially exceeds the one provided by conventional networks, its ability to recover from failures within the optical layer is important. In this paper we study the design of a survivable optical layer. We assume that an initial set of lightpaths (designed according to the expected communication pattern) is given, and we are targeted at augmenting this initial set with additional lightpaths such that the result will guarantee survivability. For this purpose, we define and motivate a ring partition survivability condition that the solution must satisfy. Generally speaking, this condition states that lightpaths must be arranged in rings. The cost of the solution found is the number of lightpaths in it. This cost function reflects the switching cost of the entire network. We present some negative results regarding the tractability and approximability of this problem, and an approximation algorithm for it. We analyze the performance of the algorithm for the general case (arbitrary topology) as well as for some special cases.