Advertisement

A Distributed Memetic Algorithm for the Routing and Wavelength Assignment Problem

  • Thomas Fischer
  • Kerstin Bauer
  • Peter Merz
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5199)

Abstract

The Routing and Wavelength Assignment Problem deals with the routing of telecommunication traffic in all-optical networks. Extending existing algorithms, we present a memetic algorithm (MA) for the static RWA by introducing a recombination operator and a scheme for distributing the computation. Compared to previously achieved results for this problem, our MA significantly improves the solution quality. We find provably optimal results for previously unsolved problem instances. The distributed variant using epidemic algorithms allows to find solutions of quality comparable to the MA in less real-time.

Keywords

Recombination Rate Optical Network Memetic Algorithm Wavelength Assignment Iterate Local Search 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Chlamtac, I., Ganz, A., Karmi, G.: Lightnet: Lightpath Based Solutions for Wide Bandwidth WANs. In: INFOCOM 1990, vol. 3, pp. 1014–1021 (1990)Google Scholar
  2. 2.
    Bala, K., Stern, T.E., Bala, K.: Algorithms for Routing in a Linear Lightwave Network. In: IEEE INFOCOM, vol. 1, pp. 1–9 (1991)Google Scholar
  3. 3.
    Chlamtac, I., Ganz, A., Karmi, G.: Lightpath Communications: An Approach to High Bandwidth Optical WANs. IEEE Trans. Comm. 40(7), 1171–1182 (1992)CrossRefGoogle Scholar
  4. 4.
    Banerjee, D., Mukherjee, B.: A Practical Approach for Routing and Wavelength Assignment in Large Wavelength-Routed Optical Networks. IEEE J. Sel. Areas Comm. 14(5), 903–908 (1996)CrossRefGoogle Scholar
  5. 5.
    Manohar, P., Manjunath, D., Shevgaonkar, R.K.: Routing and Wavelength Assignment in Optical Networks From Edge Disjoint Path Algorithms. IEEE Communications Letters 6(5), 211–213 (2002)CrossRefGoogle Scholar
  6. 6.
    Zang, H., Jue, J.P., Mukherjee, B.: A Review of Routing and Wavelength Assignment Approaches for Wavelength-Routed Optical WDM Networks. Optical Networks Magazine 1, 47–60 (2000)Google Scholar
  7. 7.
    Choi, J.S., Golmie, N., Lapeyrere, F., Mouveaux, F., Su, D.: A Functional Classification of Routing and Wavelength Assignment Schemes in DWDM networks: Static Case. In: OPNET 2000, pp. 1109–1115 (2000)Google Scholar
  8. 8.
    Sinclair, M.C.: Minimum cost routing and wavelength allocation using a genetic-algorithm/heuristic hybrid approach. In: Proc. 6th IEE Conf. Telecom. (1998)Google Scholar
  9. 9.
    Skorin-Kapov, N.: Routing and Wavelength Assignment in Optical Networks using Bin Packing Based Algorithms. EJOR 177(2), 1167–1179 (2007)CrossRefzbMATHGoogle Scholar
  10. 10.
    Bauer, K., Fischer, T., Krumke, S.O., Gerhardt, K., Westphal, S., Merz, P.: Improved Construction Heuristics and Iterated Local Search for the Routing and Wavelength Assignment Problem. In: van Hemert, J., Cotta, C. (eds.) EvoCOP 2008. LNCS, vol. 4972, pp. 158–169. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  11. 11.
    Fischer, T., Bauer, K., Merz, P.: A Multilevel Approach for the Routing and Wavelength Assignment Problem. In: Köppen, M., Raidl, G. (eds.) HEUNET 2008. IEEE Comp. Soc. Press, Los Alamitos (2008)Google Scholar
  12. 12.
    Demers, A., Greene, D., Hauser, C., Irish, W., Larson, J., Shenker, S., Sturgis, H., Swinehart, D., Terry, D.: Epidemic Algorithms for Replicated Database Maintenance. In: Schneider, F.B. (ed.) ACM PODC, pp. 1–12. ACM Press, New York (1987)Google Scholar
  13. 13.
    Jelasity, M., Voulgaris, S., Guerraoui, R., Kermarrec, A.M., van Steen, M.: Gossip-based peer sampling. ACM Transactions on Computer Systems 25(3) (2007)Google Scholar
  14. 14.
    Orlowski, S., Pióro, M., Tomaszewski, A., Wessäly, R.: SNDlib 1.0–Survivable Network Design Library. In: Proc. INOC 2007 (2007)Google Scholar
  15. 15.
    Atamtürk, A., Rajan, D.: Partition inequalities for capacitated survivable network design based on directed p-cycles. Discrete Optimization 5(2), 415–433 (2008)CrossRefzbMATHMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Thomas Fischer
    • 1
  • Kerstin Bauer
    • 1
  • Peter Merz
    • 1
  1. 1.Department of Computer ScienceUniversity of KaiserslauternGermany

Personalised recommendations