Wavelength conversion in all-optical networks with shortest-path routing

Algorithmica (New York)

Volumn 43, Issue 1-2, 2005, Pages 43-61

  Erlebach, Thomas ^a   Stefanakos, Stamatis ^b  

^a UNIVERSITY OF LEICESTER   (United Kingdom)

^b ETH ZURICH   (Switzerland)

Author keywords

Bipartization; Edge coloring; Graph algorithm; L reduction; Sufficient set; Wavelength assignment; Wavelength converter placement

Indexed keywords

ALGORITHMS; ELECTROMAGNETIC WAVE PROPAGATION; GRAPH THEORY; PROBLEM SOLVING; ROUTERS; TELECOMMUNICATION NETWORKS;

BIPARTIZATION; EDGE COLORING; GRAPH ALGORITHM; L-REDUCTION; SUFFICIENT SET; WAVELENGTH ASSIGNMENT; WAVELENGTH CONVERTER PLACEMENT;

OPTICAL COMMUNICATION;

EID: 23944520922     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00453-005-1157-y     Document Type: Article

References (18)

1. V. Auletta, I. Caragiannis, L. Gargano, C. Kaklamanis, and P. Persiano. Sparse and limited wavelength conversion in all-optical tree networks. Theoretical Computer Science, 266(1-2):887-934, 2001.
2. V. Bafna, P. Berman, and T. Fujito. A 2-approximation algorithm for the undirected feedback vertex set problem. SIAM Journal on Discrete Mathematics, 12(3):289-297, 1999.
3. R. Cole, K. Ost, and S. Schirra. Edge-coloring bipartite multigraphs in O (E log D) time. Combinatorica, 21(1):5-12, 2001.
4. R. Diestel. Graph Theoiy, 2nd edition. Springer-Verlag, New York, 2000.
5. T. Erlebach and S. Stefanakos. Wavelength conversion in networks of bounded treewidth. TIK-Report 132, ETH Zurich, April 2002.
6. T. Erlebach and S. Stefanakos. On shortest-path all-optical networks without wavelength conversion requirements. In Proceedings of the 20th International Symposium on Theoretical Aspects of Computer Science (STACS '03), pages 133-144. LNCS 2607. Springer-Verlag, Berlin, 2003.
7. T. Fujito. Approximating node-deletion problems for matroidal properties. Journal of Algorithms, 31:211-227, 1999.
8. M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco, CA, 1979.
9. N. Garg, V. V. Vazirani, and M. Yannakakis. Multiway cuts in directed and node weighted graphs. In Proceedings of the 21st International Colloquium on Automata, Languages, and Programming (ICALP '94), pages 487-498. LNCS 820. Springer-Verlag, Berlin, 1994.
10. N. Garg, V. V. Vazirani, and M. Yannakakis. Approximate max-flow min-(multi)cut theorems and their applications. SIAM Journal on Computing, 25(2):235-251, 1996.
11. P. N. Klein, S. Rao, A. Agrawal, and R. Ravi. An approximate max-flow min-cut relation for unidirected multicommodity flow, with applications. Combinatorica, 15(2):187-202, 1995.
12. J. Kleinberg and A. Kumar. Wavelength conversion in optical networks. Journal of Algorithms, 38(1):25-50, 2001.
13. D. König. Über Graphen und ihre Anwendung auf Determinantentheorie und Mengenlehre. Mathematische Annalen, 77:453-465, 1916.
14. C. Lund and M. Yannakakis. The approximation of maximum subgraph problems. In Proceedings of the 20th International Colloquium on Automata, Languages, and Programming (ICALP '93), pages 40-51. LNCS 700. Springer-Verlag, Berlin, 1993.
15. C. Papadimitriou and M. Yannakakis. Optimization, approximation, and complexity classes. Journal of Computer and System Sciences, 43:425-440, 1991.
16. R. E. Tarjan. Depth-first search and linear graph algorithms. SIAM Journal on Computing, 1:146-160, 1972.
17. G. Wilfong and P. Winkler. Ring routing and wavelength translation. In Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '98), pages 333-341, 1998.
18. H. Zang, J. P. Jue, and B. Mukherjee. A review of routing and wavelength assignment approaches for wavelength-routed optical WDM networks. Optical Networks Magazine, 1(1):47-60, 2000.