Algorithms for Wavelength Assignment in All-Optical Networks

  • L. Wuttisittikulkij
  • M. J. O’Mahony


This paper describes algorithms for solving the wavelength assignment problem in multi-wavelength transparent all-optical networks. In such networks, each connection is assigned a unique wavelength along the physical route and it is assumed that no wavelength conversion is allowed. The objective is to assign wavelengths to all connections in such a way that the number of wavelengths required, M, is minimised. Two techniques are considered in this paper. The first is based on the use of genetic algorithms (GAs) and the second is a simple heuristic algorithm. It was found that the former can be used to achieve an optimal value of M with a considerable reduction of computational time requirement compared to the extensive search approach. Hence this technique is appropriate in the case where the number of wavelengths available is strictly limited and an optimal value of M is highly desired. The heuristic algorithm does not perform as well as the genetic algorithm; although in some cases it performs exceptionally well. However, its computational time requirement is almost negligible; and results can be obtained swiftly. Therefore, it could be used to obtain a good starting value before an extensive optimisation is carried out. It also assigns wavelengths on a single connection basis which is independent of the previous connections assigned. This makes it particularly attractive in the situation where one or only a small number of new connections are to be established without having to modify the existing connections.


Heuristic Approach Traffic Demand Short Path Length Wavelength Assignment Wavelength Channel 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    G.R. Hill, P.J. Chidgey, F. Kaufhold, et al. A transport network layer based on optical network elements. IEEE Journal of Lightwave Technology, 11(5/6):667–678, May/June 1993.CrossRefGoogle Scholar
  2. [2]
    G. Hill. Wavelength routing approach to optical communication networks. In Proc. INFOCOM’88, pages 354–362, 1988.Google Scholar
  3. [3]
    R. Ramaswami, K.N. Sivarajan. Optimal routing and wavelength assignment in all-optical networks. In Proc. INFOCOM’94, Toronto, Canada, June 1994.Google Scholar
  4. [4]
    I. Chlamtac, A. Ganz, G. Karmi. Lightpath communications: An approach to high bandwidth optical WAN’s. IEEE Transactions on Communications, 40(7):1171–1182, July 1992.CrossRefGoogle Scholar
  5. [5]
    L. Davis. Handbook of Genetic Algorithms. Van Nostrand Reinhold, 1991.Google Scholar
  6. [6]
    D.E. Goldberg. Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley, 1989.Google Scholar
  7. [7]
    J.J. Grefenstette. A User’s Guide to GENESIS Version 5.0, 1990.Google Scholar
  8. [8]
    Y. Hamazumi, N. Nagatsu, S. Okamoto, K-I. Sato. Number of wavelengths required for constructing optical path network considering failure restoration. Trans, on IEICE Japan, J77-B-I, (5):275–284,1994.Google Scholar

Copyright information

© Springer-Verlag London Limited 1996

Authors and Affiliations

  • L. Wuttisittikulkij
    • 1
  • M. J. O’Mahony
    • 1
  1. 1.Centre for Network Research Department of Electronic Systems EngineeringUniversity of EssexColchesterUK

Personalised recommendations