Models, Complexity and Algorithms for the Design of Multi-fiber WDM Networks

Telecommunication Systems

Volumn 24, Issue 2-4, 2003, Pages 123-138

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

^a UNIVERSITY OF NICE SOPHIA ANTIPOLIS   (France)

^b ASU ^*  (United States)

^c MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Optical network design; Wavelength division multiplexing

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; GRAPH THEORY; MATHEMATICAL MODELS; OPTICAL FIBERS; OPTIMIZATION; WAVELENGTH DIVISION MULTIPLEXING;

OPTICAL NETWORKS;

WIDE AREA NETWORKS;

EID: 0347720923     PISSN: 10184864     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1026158611840     Document Type: Article

References (25)

1. 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 17(5) (1999) 743-754.
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: 2nd IEEE Workshop on Optics and Computer Science, part of IPPS'97, Genova, Switzerland (IEEE Press, New York, 1997).
3. I. Caragiannis, A. Ferreira, C. Kaklamanis, S. Pérennes and H. Rivano, Fractional path coloring with applications to WDM networks, in: ICALP, eds. F. Orejas, P.G. Spirakis and J. van Leeuwen, Lecture Notes in Computer Science, Vol. 2076 (Springer, New York, 2001) pp. 6-15.
4. I. Chlamtac, A. Ganz and G. Karmi, Lightpath communications: An approach to high bandwidth optical WAN's, IEEE Transactions on Communications 40(7) (1992) 1171-1182.
5. H. Choi, S. Subramaniam and H.-A. Choi, Optimal wavelength assignment algorithms for permutation traffic in multifiber WDM ring networks, Photonic Network Communications 4(1) (2002) 37-46.
6. D. Coudert and H. Rivano, Lightpath assignment for multifibers WDM optical networks with wavelength tranlators, in: Proc. IEEE Global Telecommunications Conf., Taipei, Taiwan, 2002, pp. 6-15.
7. T. Erlebach, K. Jansen, C. Kaklamanis, M. Mihail and P. Persiano, Optimal wavelength routing on directed fiber trees, Theoretical Computer Science 221(1/2) (1999) 119-137.
8. D.S. Hochbaum, Approximation Algorithms for NP-Hard Problems (PWS, Boston, MA, 1997).
9. E. Hyytiä and J. Virtamo, Wavelength assignment in multifibre in WDM-networks, Technical Report COST257TD(99)04, Helsinki University of Technology (1999).
10. V. Kumar, Approximating arc circular colouring and bandwidth allocation in all-optical ring networks, in: First Internat. Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX'98), 1998.
11. J. Kuri, N. Puech, M. Gagnaire and E. Dotaro, Routing and wavelength assignment of scheduled lightpath demands in a WDM optical transport network, in: Proc. of the 1st IEEE Internat. Conf. on Optical Communications and Networks, Singapore, 2002.
12. 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 31(2) (2001) 626-641.
13. G. Li and R. Simha, On the wavelength assignment problem in multifiber WDM star and ring networks, IEEE/ACM Transactions on Networking 9(1) (2001) 60-68.
14. L. Li and A. Somani, A new analytical model for multifiber WDM networks, IEEE Journal on Selected Areas in Communications 18(10) (2000) 2138-2145.
15. C.-J. Lu, Deterministic hypergraph coloring and its applications, in: RANDOM, eds. M. Luby, J.D.P. Rolim and M.J. Serna, Lecture Notes in Computer Science, Vol. 1518 (Springer, New York, 1998) pp. 35-46.
16. L. Margara and J. Simon, Wavelength assignment problem on all-optical networks with k fibres per link, in: ICALP, eds. U. Montanari, J.D.P. Rolim and E. Welzl, Lecture Notes in Computer Science, Vol. 1853 (Springer, New York, 2000) pp. 768-779.
17. L. Margara and J. Simon, Decidable properties of graphs of all-optical networks, in: ICALP, eds. F. Orejas, P.G. Spirakis and J. van Leeuwen, Lecture Notes in Computer Science, Vol. 2076 (Springer, New York, 2001) pp. 768-779.
18. F. Margot, Pruning by isomorphism in branch-and-cut, in: IPCO, eds. K. Aardal and B. Gerards, Lecture Notes in Computer Science, Vol. 2081 (Springer, New York, 2001) pp. 304-317.
19. A. Mehrotra and M.A. Trick, A column generation approach for graph coloring, INFORMS Journal on Computing 8(4) (1996) 344-354.
20. Porto: Planification et Optimisation des Réseaux de Transport Optiques, Document under legal authorization of France Télécom R&D, RNRT project with the CNRS/INRIA/I3S project Mascotte, Alcatel Corporate Research Center and France Télécom R&D (2000).
21. R. Ramaswami and K.N. Sivarajan, Optical Networks: A Practical Perspective (Morgan Kaufman, Los Altos, CA, 1998).
22. N. Robertson and P.D. Seymour, Graph minors XIII. The disjoint paths problem, Journal of Combinatorial Theory Series B 63 (1995) 65-110.
23. M. Saad and Z.-Q. Luo, A Lagrangian decomposition approach for the routing and wavelength assignment in multifiber WDM networks, in: Proc. of IEEE Global Telecommunications Conf., Taipei, Taiwan, 2002.
24. A. Srinivasan, An extension of the Lovász Local Lemma, and its applications to integer programming, in: Proc. of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms, Atlanta, GA, 1996, pp. 6-15.
25. X. Zhang and C. Qiao, Wavelength assignment for dynamic traffic in multi-fiber WDM networks, in: Proc. of the 7th Internat. Conf. on Computer Communications and Networks, Lafayette, LA, 1998, pp. 479-585.