Arunita JaekelS. BandyopadhyayY.P. Aneja
Survivable routing of a logical topology ensures that the lightpaths are routed in such a way that a single link failure does not disconnect the network. However, even if the network remains connected after a failure, there is no guarantee that the resulting logical topology will be able to support the required traffic. In this paper, we introduce a new approach that integrates the logical topology design and survivable routing problems. When a topology is generated using our approach, it is guaranteed to have a survivable routing. We further ensure that the topology is able to handle the entire traffic demand, for any single link failure. We have formulated an ILP that optimally designs a survivable logical topology, and also proposed a fast heuristic which can be used for large networks.
Aradhana Narula‐TamEytan ModianoAndrew Brzezinski
Aradhana Narula‐TamEytan ModianoAndrew Brzezinski
Arunabha SenBin HaoBao Hong ShenGuohui Lin
G. Raghu KiranC. Siva Ram Murthy