Minimum Cost Topology Optimisation of the Cost 239 European Optical Network

  • M. C. Sinclair


A genetic algorithm is presented for the minimum-cost topology optimisation of the COST 239 European Optical Network (EON). The algorithm makes use of real traffic data where possible, and produces a network amongst twenty given nodes with two-shortest-node-disjoint routing between node pairs. Both routes are fully resourced, guaranteeing the network will survive a single component failure. The results are compared with the earlier ‘hand-crafted’ EON topology.


Genetic Algorithm Node Pair Hill Climber Network Cost Reliability Constraint 
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.
    Sinclair, M.C. & O’Mahony, M.J.: Proc. 36th RACE Concertation Meeting, Brussels 89 (1993)Google Scholar
  2. 2.
    O’Mahony, M., Sinclair, M.C. & Mikac, B.: Information, Telecommunications, Automata Journal 12 33 (1993)Google Scholar
  3. 3.
    Sinclair, M.C.: Proc. 8th UK Teletraffic Symposium, Beeston 8 /1 (1991)Google Scholar
  4. 4.
    Sinclair, M.C.: Proc. IEE Colloquium on Resilience in Optical Networks, London 3 /1 (1992)Google Scholar
  5. 5.
    Sinclair, M.C.: Electronics Letters 301468 (1994)CrossRefGoogle Scholar
  6. 6.
    Goldberg, D.E.: Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley 1989.MATHGoogle Scholar
  7. 7.
    Grefenstette, J.J.:A User’s Guide to GENESIS Version 5. 0 (1990)Google Scholar
  8. 8.
    Ishio, H.: NTT Review 4 62 (1992)Google Scholar

Copyright information

© Springer-Verlag/Wien 1995

Authors and Affiliations

  • M. C. Sinclair
    • 1
  1. 1.Dept. of Electronic Systems EngineeringUniversity of EssexColchesterUK

Personalised recommendations