Skip to main content
SpringerLink
Log in

Genetic algorithms and network ring design

  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

Optimal network ring design is a difficult problem characterised by the requirement tocompare a large number of potential solutions (network designs). The problem of networkring design can be described as consisting of three parts: routing, link capacity assignmentand ring determination. It has traditionally been broken down into a number of subproblems,solved in sequence, and usually by heuristics, thereby leading to locally‐optimal designsolutions. Genetic Algorithms (GAs) have shown themselves to be efficient at searchinglarge problem spaces and have been successfully used in a number of engineering problemareas, including telecommunications network design. We present an approach of a GA tothe network ring design problem in which the GA representation encapsulates all aspects ofthe problem and solves them simultaneously. A novel, hybrid bit and permutation representationis described, along with the fitness function for the design problem. Results ofapplying this representation to a number of test networks are presented and compared withheuristic design methods.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. D.E. Goldberg, Genetic Algorithms in Search, Optimisation and Machine Learning, Addison-Wesley, 1989.

  2. W.D. Grover, B.D. Venables, J. Sandham and Milne, Performance of the self-healing network protocol with random individual link failure time, in: Proceedings of ICC 1991, 1991, pp. 660-666.

  3. H. Sakauchi, Y. Nishimura and S. Hasegawa, A self-healing network with an economical spare-channel assignment, in: Proceedings of IEEE Globecom '90, 1990, pp. 438-443.

  4. T. Wu and C. Lau, A class of self-healing ring architectures for SONET network applications, in: Proceedings of IEEE Globecom '90, 1990, pp. 444-452.

  5. T. Wu, D.J. Kolar and R.H. Cardwell, Survivable network architectures for broadband fiber optic networks: Models and performance comparisons, IEEE Journal of Lightwave Technology 6(1988) 1698-1709.

    Google Scholar 

  6. S. Nathan, Multi-ring topology based network planning, Internal Report, Nortel.

  7. H. Frank, I.T. Frisch and W. Chou, Topological considerations in the design of the ARPA computer network, in: Conf. Rec. and 1970 Spring Joint Computer Conference, AFIPS Press, 1970.

  8. K. Steiglitz, P. Weiner and D.J. Kleitman, The design of minimum cost survivable networks, IEEE Transactions on Circuit Theory (1969)455-460.

  9. H. Frank, I.T. Frisch, W. Chou and R. Van Slyke, Optimal design of centralized computer networks, Networks 1(1971)43-57.

    Google Scholar 

  10. M. Gerla and L. Kleinrock, On the topological design of distributed computer networks, IEEE Transactions on Communications 25(1977)48-60.

    Google Scholar 

  11. M. Gerla, The design of store-and-forward networks for computer communications, Ph.D. Thesis, University of California, 1974.

  12. B. Yaged, Minimum cost routing for static network models, Networks 1(1971)139-172.

    Google Scholar 

  13. M. Minoux, Network synthesis and optimum network design problems: Models, solution methods and applications, Networks 19(1989)313-360.

    Google Scholar 

  14. M. Gendreau, M. Labbe and G. Laporte, Efficient heuristics for the design of ring networks, Telecommunication Systems 4(1995)177-188.

    Google Scholar 

  15. O.J. Wasem, An algorithm for designing rings for survivable fiber networks, IEEE Transactions on Reliability 40(1991)428-439.

    Google Scholar 

  16. O.J. Wasem, Optimal topologies for survivable fiber optic networks using SONET self-healing rings, in: Proceedings of IEEE Globecom '91, 1991, pp. 2032-2038.

  17. J.B. Slevinsky, W.D. Grover and M.H. MacGregor, An algorithm for survivable network design employing multiple self-healing rings, in: Proceedings of IEEE Globecom '93, 1993, pp. 1586-1573.

  18. J. Boot, H.W. Wever and A.M.E. Zwinkels, Planning an SDH network, in: Proceedings of the 6th International Network Planning Symposium, 1994, pp. 143-148.

  19. F. Poppe and P. Demeester, An integrated approach to the capacitated network design problem, in: Proceedings of the 4th International Conference on Telecommunication Systems, 1996, pp. 391-397.

  20. O.J. Wesam, T.H. Wu and R.H. Cardwell, Survivable SONET networks — design methodology, IEEE J. SAC 12(1994)205-212.

    Google Scholar 

  21. L.M. Gardner, M. Haydari, J. Shah, I.H. Sudborough and C. Xia, Techniques for finding ring covers in survivable networks, in: Proceedings of IEEE Globecom '94, 1994, pp. 1862-1866.

  22. E.W. Dijkstra, A note on two problems in connection with graphs, Numerische Mathematik 1(1959) 269.

    Google Scholar 

  23. T.H. Cormen, C.E. Leiserson and R.L. Rivest, Introduction to Algorithms, McGraw-Hill, 1990.

  24. G. Laporte and S. Martello, The selective travelling salesman problem, Discrete Applied Mathematics 26(1990)193-207.

    Google Scholar 

  25. L. Davis, D. Orvosh, A. Cox and Y. Qiu, A genetic algorithm for survivable network design, in: Proceedings of the 5th International Conference on Genetic Algorithms, ed. S. Forrest, Morgan Kaufmann, San Mateo, 1993, pp. 408-415.

    Google Scholar 

  26. L. Davis and S. Coombs, Genetic algorithms and communication link speed design: Theoretical considerations, in: Proceedings of the 2nd International Conference on Genetic Algorithms and their Applications, ed. J.J. Grefenstette, Lawrence Erlbaum, Hillsdale, NJ, 1987, pp. 252-256.

    Google Scholar 

  27. S. Coombs and L. Davis, Genetic algorithms and communication link speed design: Constraints and operators, in: Proceedings of the 2nd International Conference on Genetic Algorithms and their Applications, ed. J.J. Grefenstette, Lawrence Erlbaum, Hillsdale, NJ, 1987, pp. 257-160.

    Google Scholar 

  28. Z. Michalewicz, Genetic Algorithms + Data Structures = Evolution Programs, Springer, 1992.

  29. T. Starkweather, S. McDaniel, K. Mathias, D. Whitley and C. Whitley, A comparison of genetic sequencing operators, in: Proceedings of the 4th International Conference on Genetic Algorithms, eds. R.K. Belew and L.B. Booker, Morgan Kaufmann, San Diego, 1991, pp. 69-76.

    Google Scholar 

  30. J.W. Mann, A. Kapsalis and G.D. Smith, The GAmeter toolkit, in: Applications of Modern Heuristic Methods, ed. V.J. Rayward-Smith, Waller, 1995, chap. 12, pp. 195-209.

  31. J.M. Baldwin, A new factor in evolution, American Naturalist 30(1896)441-451.

    Google Scholar 

  32. D. Whitley, S. Gordon and K. Mathias, Lamarckian evolution, the Baldwin effect and function optimization, in: Parallel Problem Solving from Nature — PPSN III, eds. Y. Davidor, H.P. Schwefel and R. Manner, Springer, Berlin, 1994, pp. 6-15.

    Google Scholar 

  33. R.K. Belew, J. McInerney and N.N. Schraudolph, Evolving networks: Using the genetic algorithm with connectionist learning, in: Proceedings of the 2nd Artificial Life Conference, Addison-Wesley, 1991, pp. 511-547.

  34. D. Orvosh and L. Davis, Shall we repair? genetic algorithms, combinatorial optimisation, and feasibility constraints, in: Proceedings of the 5th International Conference on Genetic Algorithms, ed. S. Forrest, Morgan Kaufmann, San Mateo, 1993, p. 650.

    Google Scholar 

  35. J.R. Koza, Genetic Programming: On the Programming of Computers by Means of Natural Selection, MIT Press, 1992.

Download references

Authors
  1. A.R.P. White
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. J.W. Mann
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. G.D. Smith
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

White, A., Mann, J. & Smith, G. Genetic algorithms and network ring design. Annals of Operations Research 86, 347–371 (1999). https://doi.org/10.1023/A:1018919205346

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1018919205346

Keywords

Search

Navigation