Wavelength assignment in optical networks with fixed fiber capacity

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3142, Issue , 2004, Pages 134-145

  Andrews, Matthew ^a   Zhang, Lisa ^a  

^a LUCENT TECHNOLOGIES   (United States)

Author keywords

Fixed capacity fiber; Inapproximability; Optical networking; Wavelength assignment

Indexed keywords

COMPUTATIONAL LINGUISTICS; FIBERS;

APPROXIMATION RATIOS; CONSTANT-FACTOR APPROXIMATION ALGORITHMS; EXPECTED RUNNING TIME; FIXED CAPACITY FIBER; INAPPROXIMABILITY; OPTICAL NETWORKING; RANDOMIZED ALGORITHMS; WAVELENGTH ASSIGNMENT;

APPROXIMATION ALGORITHMS;

EID: 27644471648     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-27836-8_14     Document Type: Article

References (25)

1. A. Aggarwal, A. Bar-Noy, D. Coppersmith, R. Ramaswami, B. Schieber, and M. Sudan. Efficient routing and scheduling algorithms for optical networks. In Proceedings of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 412 -423, January 1994.
2. M. Andrews and L. Zhang. Wavelength assignment in optical networks with fixed fiber capacity. Bell Labs Technical Memorandum, 2003.
3. D. Banerjee and B. Mukherjee. A practical approach for routing and wavelength assignment in large wavelength-routed optical networks. IEEE Journal on Selected Areas in Communications, 14(5):903-908, 1996.
4. I. Caragiannis, A. Ferreira, C. Kaklamanis, S. Perennes, and H. Rivano. Fractional path coloring with applications to WDM networks. In Proceedings of the 28th International Collogium on Automata, Languages, and Programming (ICALP'01), pages 732-743, 2001.
5. C. Chekuri. Personal communication. 2003.
6. C. Chekuri, M. Mydlarz, and F. B. Shepherd. Multicommodity demand flow in a tree. In ICALP, 2003.
7. T. Erlebach, K. Jansen, C. Kaklamanis, M. Mihail, and P. Persiano. Optimal wavelength routing in directed fiber trees. Theoretical Computer Science, 221(1-2):119-137, 1999.
8. T. Erlebach, A. Pagourtzis, K. Potika, and S. Stefanakos. Resource allocation problems in multifiber WDM tree networks. In Proceedings of the 29th International Workshop on Graph Theoretic Concepts in Computer Science, pages 218-229, 2003.
9. U. Feige and J. Kilian. Zero knowledge and the chromatic number. In IEEE Conference on Computational Complexity, pages 278-287, 1996.
10. S. Fortune, W. Sweldens, and L. Zhang. Line system design for DWDM networks. In Proceedings of the 11th International Telecommunications Network Strategy and Planning Symposium (Networks), Vienna, Austria, 2004.
11. Alan Gnauck. Digital transmission. Post-OFC2004 Reviews, 2004.
12. R. M. Karp, F. T. Leighton, R. L. Rivest, C. D. Thompson, U. V. Vazirani, and V. V. Vazirani. Global wire routing in two-dimensional arrays. Algorithmica, 2:113 -129, 1987.
13. R. Klasing. Methods and problems of wavelength-routing in all-optical networks. Technical Report CS-RR-348, Department of Computer Science, University of Warwick, 1998.
14. V. Kumar. Approximating circular arc coloring and bandwidth allocation in all-optical ring networks. In Proceedings of the International Workshop on Approximation Algorithms for Combinatorial Optimization (APPROX'98), pages 147-158, 1998.
15. V. Kumar and E. Schwabe. Improved access to optical bandwidth in trees. In Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 437-444, January 1997.
16. M. Mihail, C. Kaklamanis, and S. Rao. Efficient access to optical bandwidth. In Proceedings of the 36th Annual Symposium on Foundations of Computer Science, pages 548-557, 1995.
17. R. Motwani and P. Raghavan. Randomized algorithms. Cambridge University Press, 1995.
18. C. Nomikos, A. Pagourtzis, and S. Zachos. Routing and path multi-coloring. Information Processing Letters, 2001.
19. G. Polya, R. Tarjan, and D. Woods. Notes on Introductory Combinatorics, Progress in Computer Science, No. 4. Birkhauser, Boston, Basel, Stuttgart, 1983.
20. P. Raghavan and C.D. Thompson. Randomized rounding: a technique for provably good algorithms and algorithmic proofs. Combinatorica, 7:365-374, 1991.
21. P. Raghavan and E. Upfal. Efficient routing in all-optical networks. In Proceedings of the 26th Annual ACM Symposium on Theory of Computing, 1994.
22. C. Scheideler. Probabilistic Methods for Coordination Problems. Habilitation thesis, Paderborn University, 2000.
23. B. Shepherd and A. Vetta. Lighting fibers in a dark network. Bell Labs Technical Memorandum, January 2003.
24. G. Wilfong and P. Winkler. Ring routing and wavelength translation. In Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 333 -341, January 1998.
25. P. Winkler and L. Zhang. Wavelength assignment and generalized interval graph coloring. In Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms, January 2003.