Low-Cost Design Approach to WDM Mesh Networks

  • Cristiana Gomes
  • Geraldo Robson Mateus
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3420)


This article presents a mathematical model and an efficient heuristic that results in a low-cost network design to satisfy a set of static point-to-point demands. It considers the problem of routing working traffic and assigning wavelengths in an all-optical network. This problem is known as the Routing and Wavelength Assignment (RWA) problem.

The model and heuristic give a physical network configuration selecting a lowest cost set of components of the network (subnetworks and switches) with sufficient capacities to attend all demands.

The solutions obtained are compared to existing results found in the literature using the same instances.

We treated the project of a network without wavelength conversion because it introduces a delay (Optical-Electrical-Optical mappings) and this should be avoided in our environment, a core of a backbone.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Kennington, J., Olinick, E.: Wavelength routing and assignment in a survivable WDM mesh network. Operations Research 51, 67–79 (2003)MATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    Ozdaglar, A., Bertsekas, D.: Routing and wavelength assignment in optical networks. IEEE/ACM Transactions on Networking 11 (2003)Google Scholar
  3. 3.
    Rouskas, G., Perros, H.: A tutorial on optical networks. ACM Advanced lectures on networking (2002)Google Scholar
  4. 4.
    ITU-T: Architecture of Optical Transport Network (2001)Google Scholar
  5. 5.
    Ramamurthy, R., Mukherjee, B.: Fixed-alternate routing and wavelength conversion in wavelength-routed optical networks. IEEE/ACM Transactions on Networking 10 (2002)Google Scholar
  6. 6.
    Zang, H., et al.: Path-protection and wavelength assignment in WDM mesh networks under duct-layer constraints. IEEE/ACM Transactions on Networking 11 (2003)Google Scholar
  7. 7.
    Chlamtac, I., Ganz, A., Karmi, G.: Lightpath communications: An approach to high-bandwidth optical wans. IEEE Transactions Communications 40, 1171–1182 (1992)CrossRefGoogle Scholar
  8. 8.
    Li, G., Simha, R.: Routing and wavelength assignment by partition coloring. In: MIC 2003: The Fifth Metaheuristics International Conference, Kyoto, Japan (2003)Google Scholar
  9. 9.
    Karasan, E., Ayanoglu, E.: Effects of wavelength routing and selection algorithms on wavelength conversion gain in WDM optical networks. IEEE/ACM Transactions on Networking 6 (1998)Google Scholar
  10. 10.
    Brelaz, D.: New methods to color the vertices of a graph. Communications of the ACM 22, 251–256 (1979)MATHCrossRefMathSciNetGoogle Scholar
  11. 11.
    Caenegem, V., et al.: Dimensioning of survivable WDM networks. IEEE Journal on Selected Areas in Communications 16, 1146–1157 (1998)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Cristiana Gomes
    • 1
  • Geraldo Robson Mateus
    • 1
  1. 1.Computer Science DepartmentFederal University of Minas GeraisBelo HorizonteBrazil

Personalised recommendations