Models, complexity and algorithms for the design of multifiber WDM networks

10th International Conference on Telecommunications, ICT 2003

Volumn 1, Issue , 2003, Pages 12-18

  Ferreira, A ^a   Perennes S ^a   Richa, A W ^a   Rivano, H ^a   Stier Moses, N ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Algorithm design and analysis; Approximation algorithms; Europe; Optical fiber networks; Optimization methods; Performance analysis; Spine; Wavelength assignment; Wavelength division multiplexing; WDM networks

Indexed keywords

ALGORITHMS; COMBINATORIAL OPTIMIZATION; COMPLEX NETWORKS; COMPUTATIONAL COMPLEXITY; FIBERS; GRAPH THEORY; HEURISTIC METHODS; INTEGER PROGRAMMING; MULTIPLEXING; OPTICAL FIBERS; OPTIMIZATION; WAVELENGTH DIVISION MULTIPLEXING;

ALGORITHM DESIGN AND ANALYSIS; EUROPE; OPTICAL FIBER NETWORKS; OPTIMIZATION METHOD; PERFORMANCE ANALYSIS; SPINE; WAVELENGTH ASSIGNMENT; WDM NETWORKS;

APPROXIMATION ALGORITHMS;

EID: 33846283683     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICTEL.2003.1191150     Document Type: Conference Paper

References (18)

1. R. Ramaswami and K. N. Sivarajan. "Routing and wavelength assignment in all-optical networks," IEEE/ACM Trans. on Networking, vol. 3. no. 5, pp. 489-500, 1995.
2. B. Beauquier, J-C. Bermond, L. Gargano, P. Hell, S. Pérennes, and U. Vaccar, "Graph problems arising from wavelength-routing in all-optical networks," in IEEE WOCS'97, Genova, Switzerland, April 1997.
3. R. Ramaswami and K. N. Sivarajan, Optical Networks: a practical perspective., Morgan-Kaufman, 1998.
4. I. Caragiannis, A. Ferreira, C. Kaklamanis, S. Pérennes, and H. Rivano, "Fractional path coloring with applications to WDM networks," in 28th ICALP'01, Crete, Greece, July 2001, LNCS, pp. 732-743, Springer-Verlag.
5. L. Margara and J. Simon, "Wavelength assignment problem on all-optical networks with k fibres per link," in ICALP'00, 2000, pp. 768-779.
6. G. Li and R. Simha, "On the Wavelength Assignement Problem in Multifiber WDM Star and Ring Networks," IEEE Infocom, vol. 3, pp. 1771-1780, 2000.
7. X. Zhang and C. Qiao, "Wavelength assignment for dynamic traffic in multi-fiber WDM networks," in ICCCN'98, 1998, pp. 479-585.
8. S. Baroni, P. Bayvel, R. J. Gibbens, and S. K. Korothy, "Analysis and design of resilient multifiber wavelength-routed optical transport networks," Journal of Lightwave Technology, vol. 17, no. 5, pp. 743-754, May 1999.
9. E. Hyytiä and J. Virtamo, "Wavelength assignment in multifibre in WDM-networks," Tech. Rep. COST257TD(99)04, Helsinki University of Technology, February 1999.
10. I. Chlamtac, A. Ganz, and G. Karmi, "Lightpath communications: An approach to high bandwidth optical WAN'S," IEEE Trans. on Communications, vol. 40, no. 7, pp. 1171-1182, July 1992.
11. D. S. Hochbaum, Ed., Approximation Algorithms for N P-Hard Problems, PWS Publishing Compagny, 1997.
12. A. Srinivasan, "An extension of the Lovász Local Lemma, and its applications to integer programming," in ACM- SIAM SODA'96, 1996, pp. 6-15.
13. C. Lu, "Deterministic hypergraph coloring and its applications," in Proceedings of the 2nd International Workshop on Randomization and Approximation Techniques in Computer Science. October 1998, LNCS 1518, pp. 35-46, Springer.
14. T. Leighton, C. Lu, S. Rao, and A. Srinivasan, "New algorithmic aspects of the Local Lemma with applications to routing and partitioning," SIAM Journal on Computing, vol. 31, no. 2, pp. 626-641, 2001.
15. A. Mehrotra and M. A. Trick, "A column generation approach for graph coloring," INFORMS Journal on Computing, vol. 8, no. 4, pp. 344-354, 1996.
16. F. Margot, "Pruning by isomorphism in Branch-and-Cut," in IPC0'01, June 2001, LNCS 2081, pp. 304-317, Springer.
17. RNRT Project PORTO: MASCOTTE Project, Alcatel Corp. Research Centre and France Telecom R&D, "Design and Optimization of Optical Transport Networks,", February 2000, in French.
18. D. Coudert and H. Rivano, "Lightpath assignment for multifibers WDM optical networks with wavelength translators," in IEEE Globecom'02, Taipei, Taiwan, November 2002, To appear.