Abstract
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 of such 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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
S. Arora, L. Babai, J. Stern, and Z. Sweedyk. The hardness ofa pproximate optima in lattices, codes, and systems ofline ar equations. Journal of Computer and System Sciences, 54:317–331, 1997.
R. D. Carr, S. Doddi, G. Konjevod, and M. Marathe. On the red-blue set cover problem. In Proc. ACM-SIAM Symposium on Discrete Algorithms, pages 345–353, 2000.
I. Chlamtac, A. Ganz, and G. Karmi. Lightpath communications: an approach to high bandwidth optical WANs. IEEE Trans. on Communications, 40 (1992), 1171–1182.
Y. Dodis and S. Khanna. Designing networks with bounded pairwise distance. In Proc. ACM Symposium on Theory of Computing, pages 750–759, 1999.
J. Håstad. Clique is Hard to Approximate within n1-ε. Accepted for publication in Acta Mathematica.
J. Håstad. Some optimal inapproximability results. Manuscript.
U. Feige and J. Kilian. Zero knowledge and the chromatic number. In Proc. IEEE Conference on Computational Complexity (formerly Structure in Complexity Theory), 1996.
S. Khanna, M. Sudan, and L. Trevisan. Constraint satisfaction: The approximability of minimization problems. ECCC tech report TR96-064, available at http://www.eccc.uni-trier.de/eccc-local/Lists/TR-1996.html. Also see: Proc. IEEE Conference on Computational Complexity (formerly Structure in Complexity Theory), pages 282–296, 1997.
S. O. Krumke and H.-C. Wirth. On the minimum label spanning tree problem. Information Processing Letters, 66:81–85, 1998.
K. C. Lee and V. O. K. Li. A wavelength rerouting algorithm in wide-area alloptical networks. IEEE/OSA Journal of Lightwave Technology, 14 (1996), 1218–1229.
G. Mohan and C. Siva Ram Murthy. Efficient algorithms for wavelength rerouting in WDM multi-fiber unidirectional ring networks. Computer Communications, 22 (1999), 232–243.
G. Mohan and C. Siva Ram Murthy. A time optimal wavelength rerouting for dynamic traffic in WDM networks. IEEE/OSA Journal of Lightwave Technology, 17 (1999), 406–417.
R. Motwani and P. Raghavan. Randomized Algorithms. Cambridge University Press, 1995.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Caprara, A., Italiano, G.F., Mohan, G., Panconesi, A., Srinivasan, A. (2000). Wavelength Rerouting in Optical Networks, or the Venetian Routing Problem. In: Jansen, K., Khuller, S. (eds) Approximation Algorithms for Combinatorial Optimization. APPROX 2000. Lecture Notes in Computer Science, vol 1913. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44436-X_9
Download citation
DOI: https://doi.org/10.1007/3-540-44436-X_9
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67996-7
Online ISBN: 978-3-540-44436-7
eBook Packages: Springer Book Archive