Wavelength rerouting in optical networks, or the Venetian routing problem

Wavelength rerouting has been suggested as a viable and cost-effective method to improve the blocking performance of wavelength-routed Wavelength-Division Multiplexing (WDM) networks. This method leads to the following combinatorial optimization problem, dubbed Venetian Routing. Given a directed multigraph G along with two vertices s and t and a collection of pairwise arc-disjoint paths, we wish to find an st-path which arc-intersects the smallest possible number ofsu ch paths. In this paper we prove the computational hardness oft his problem even in various special cases, and present several approximation algorithms for its solution. In particular we show a non-trivial connection between Venetian Routing and Label Cover.

[1]  Jacques Stern,et al.  The hardness of approximate optima in lattices, codes, and systems of linear equations , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.

[2]  Robert D. Carr,et al.  On the red-blue set cover problem , 2000, SODA '00.

[3]  Johan Håstad,et al.  Some optimal inapproximability results , 1997, STOC '97.

[4]  Rajeev Motwani,et al.  Randomized algorithms , 1996, CSUR.

[5]  Uriel Feige,et al.  Zero knowledge and the chromatic number , 1996, Proceedings of Computational Complexity (Formerly Structure in Complexity Theory).

[6]  Luca Trevisan,et al.  Constraint satisfaction: the approximability of minimization problems , 1997, Proceedings of Computational Complexity. Twelfth Annual IEEE Conference.

[7]  J. Håstad.  Clique is hard to approximate withinn1−ε , 1999 .

[8]  C. Siva Ram Murthy,et al.  Efficient algorithms for wavelength rerouting in WDM multi-fiber unidirectional ring networks , 1999, Comput. Commun..

[9]  K. Lee,et al.  A wavelength rerouting algorithm in wide-area all-optical networks , 1996 .

[10]  Gurusamy Mohan,et al.  A time optimal wavelength rerouting algorithm for dynamic traffic in WDM networks , 1999 .

[11]  Imrich Chlamtac,et al.  Lightpath communications: an approach to high bandwidth optical WAN's , 1992, IEEE Trans. Commun..

[12]  Sanjeev Khanna,et al.  Design networks with bounded pairwise distance , 1999, STOC '99.

[13]  Sven Oliver Krumke,et al.  On the Minimum Label Spanning Tree Problem , 1998, Inf. Process. Lett..