Bounds on fiber minimization in optical networks with fixed fiber capacity

Proceedings - IEEE INFOCOM

Volumn 1, Issue , 2005, Pages 409-419

  Andrews, Matthew ^a   Zhang, Lisa ^a  

^a LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

FIBER CAPACITY; FIBER MINIMIZATION; OPTICAL NETWORKS; WAVELENGTHS;

ALGORITHMS; APPROXIMATION THEORY; HEURISTIC METHODS; OPTICAL COMMUNICATION; OPTICAL FIBERS; PROBLEM SOLVING; TOPOLOGY;

FIBER OPTIC NETWORKS;

EID: 25844497545     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (31)

1. J. Kleinberg and A. Kumar, "Wavelength conversion in optical networks", in SODA, 1999.
2. X. Jia and D. Du and X. Hu and H. Huang and D. Li, "Placement of wavelength converters for minimal wavelength usage in WDM networks," in IEEE INFOCOM, 2002.
3. L. Chen and E. Modiano, "Efficient Routing and Wavelength Assignment for Reconfigurable WDM Networks with Wavelength Converters," in IEEE INFOCOM, 2003.
4. Alan Gnauck, "Digital transmission," Post-OFC2004 Reviews, 2004.
5. B. Awerbuch and Y. Azar, "Buy-at-bulk network design," in FOCS, 1997.
6. M. Andrews, "Hardness of buy-at-bulk network design," in FOCS, 2004.
7. R. Ramaswami and K. Sivarajan, "Routing and wavelength assignment in all-optical networks" IEEE/ACM Trans. Networking, vol. 3, no. 5, pp. 489-500, 1995.
8. A. Aggarwal, A. Bar-Noy, D. Coppersmith, R. Ramaswami, B. Schieber, and M. Sudan, "Efficient routing and scheduling algorithms for optical networks," in SODA, 1994.
9. 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, vol. 14, no. 5, pp. 903-908, 1996.
10. I. Caragiannis, A. Ferreira, C. Kaklamanis, S. Perennes, and H. Rivano, "Fractional path coloring with applications to WDM networks," in ICALP, 2001.
11. P. Raghavan and E. Upfal, "Efficient routing in all-optical networks," in STOC, 1994.
12. V. Kumar, "Approximating circular arc coloring and bandwidth allocation in all-optical ring networks," in APPROX, 1998.
13. G. Wilfong and P. Winkler, "Ring routing and wavelength translation," in SODA, 1998.
14. M. Mihail, C. Kaklamanis, and S. Rao, "Efficient access to optical bandwidth in trees," in FOCS, 1995.
15. V. Kumar and E. Schwabe, "Improved access to optical bandwidth in trees," in SODA, 1997.
16. T. Erlebach, K. Jansen, C. Kaklamanis, M. Mihail, and P. Persiano, "Optimal wavelength routing in directed fiber trees," Theoretical Computer Science, vol. 221, no. 1-2. pp. 119-137, 1999.
17. R. Klasing, "Methods and problems of wavelength-routing in all-optical networks," Tech. Rep. CS-RR-348, Department of Computer Science, University of Warwick, 1998.
18. P. Winkler and L. Zhang, "Wavelength assignment and generalized interval graph coloring," in SODA, 2003.
19. C. Nomikos, A. Pagourtzis, and S. Zachos, "Routing and path multi-coloring," Information Processing Letters. 2001.
20. C. Chekuri, M. Mydlarz, and F. B. Shepherd, "Multicommodity demand flow in a tree," in ICALP, 2003.
21. 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, 2003, pp. 218-229.
22. B. Shepherd and A. Vetta, "Lighting fibers in a dark network," Bell Labs Technical Memorandum, January 2003.
23. M. Andrews and L. Zhang, "Wavelength assignment in optical networks with fixed fiber capacity," in ICALP, 2004.
24. U. Feige and J. Kilian, "Zero knowledge and the chromatic number," in IEEE Conference on Computational Complexity, 1996.
25. R. Raz. A parallel repetition theorem. SIAM Journal on Computing, 27(3):763-803, 1998.
26. Y. Bartal, "Probabilistic approximation of metric spaces and its algorithmic applications," in FOCS, 1996.
27. Y. Bartal, "On approximating arbitrary metrics by tree metrics," in STOC, 1998.
28. J. Fakcharoenphol, S. Rao, and K. Talwar, "A tight bound on approximating arbitrary metrics by tree metrics," in STOC, 2003.
29. T. Erlebach and S. Stefanakos, "On shortest-path all-optical networks without wavelength conversion requirements," in STACS, 2003.
30. 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), 2004.
31. P. Erdös and H. Sachs, "Reguläre graphen gegebener Taillenweite mit minimaler Knotenzahl," Wiss. Z. Uni. Halle-Wittenburg (Math. Nat.), vol. 12, pp. 251-257, 1963.