Skip to main content
SpringerLink
Log in

Une méthode heuristique de dimensionnement de réseaux téléinformatiques

A heuristic method for designing computer network topologies

  • Published:
Annales Des Télécommunications Aims and scope Submit manuscript

Résumé

Depuis l’implantation des premiers réseaux téléinformatiques, une attention soutenue a été portée à leur conception topologique, en raison des considérations financières dont étaient empreints le dimensionnement et l’exploitation de tels réseaux. La multiplicité des configurations topologiques possibles, le caractère discret des options de capacités de liaisons disponibles commercialement, la non- linéarité des fonctions de coût associées sont autant de facteurs, parmi d’autres, qui contribuent à rendre complexe ce problème de conception. Il s’ensuit qu’aucune approche de résolution exacte ne peut garantir une solution optimale en des temps de calcul réalistes, ce qui milite en faveur de méthodes heuristiques capables de fournir au prix d’un effort de calcul non prohibitif de bonnes solutions faisables, non nécessairement optimales. Cet article propose une méthode heuristique pour générer de manière économique des topologies de réseau qui respectent un certain nombre de contraintes de fiabilité et de qualité de service. L’implantation de cet algorithme a été soumise à une série de tests qui en confirment la robustesse et l’efficacité, en regard de la qualité des solutions générées.

Abstract

Since the implementation of the first computer networks, a great attention has been given to their topological design, because of the financial aspects of their dimensioning and operating. The high number of possible topological configurations, the discrete character of the link capacity options available in the marketplace, the non- linearity of the cost functions associated with the network topologies, constitute the main factors which make complex this design problem. As a result, only heuristic methods can lead with a reasonable computing effort, to good feasible solutions, but not necessarily optimal. This paper proposes a heuristic method for generating in an economical manner network topologies which satisfy some reliability and quality of service constraints. The implementation of the method has been submitted to a sequence of tests which confirm its robustness and its efficiency according to the quality of solutions provided.

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

Bibliographie

  1. Axelrod (R.). The evolution of strategies in the iterated prisoner’s dilemma.In:Genetic algorithms and simulated annealing, L. Davis (Ed.), Morgan Kaufmann, Los Altos, Ca (1987).

    Google Scholar 

  2. Boorstyn (R.R.), Frank (H.). Large-scale network topological optimization.IEEE Trans. COM (1977),25, n° 1, pp. 29–47.

    Article  MATH  Google Scholar 

  3. Cavicchio (D. J.). Adaptive search using simulated evolution.Ph.D. Dissertation, University of Michigan, Ann Arbor (1970).

    Google Scholar 

  4. Davis (L.) (dir. publ.). Handbook of genetic algorithms. Van Nostrand Reinhold, New York (1991).

    Google Scholar 

  5. Davis (L.), Coombs (S.). Genetic algorithms and communication link speed design : constraints and operators.Proceedings of the Second International Conference on Genetic Algorithms,Lawrence Erlbaum Associates Publishers, Hillsdale, NJ (1987).

  6. Davis (L.), Coombs (S.). Optimizing network link sizes with genetic algorithms.In : Modelling and simulation Methodology,Knowledge System’s Paradigms, Elsevier Science Publishers (1989).

  7. Dutta (A.), Mitra (S.). Integrating heuristic knowledge and optimization models for communication network design.IEEE Trans. KD (1993),5, n° 6, pp. 999–1017.

    Google Scholar 

  8. Fratta (L.), Gerla (M.), Kleinrock (L.). The flow deviation method. An approach to store and forward communication network design.Networks (1973),3, pp. 97–133.

    Article  MATH  MathSciNet  Google Scholar 

  9. Gavish (B.), Neuman (I.). Routing in a network with unreliable components.IEEE Trans. COM (1992),40, n° 7, pp. 1248–1258.

    Article  Google Scholar 

  10. Gavish (B.). Topological design of computer communication network. The overall design problems.European Journal of Operational Research (1992),58, pp. 149–172.

    Article  MATH  Google Scholar 

  11. Gerla (M.). The design of store-and-forward (S/F) networks for computer communications.Engineering Report UCLA-ENG-7319, University of California, Los Angeles, School of Engineering and Applied Science (1973).

    Google Scholar 

  12. Gerla (M.), Frank (H.), Chou (W.), Eckl (J.). A cut saturation algorithm for topological design of packet switched communication networks.In : Procedings of National Telecommunication Conference (1974).

  13. Gerla (M.), Kleinrock (L.). On the topological design of distributed computer networks.IEEE Trans. COM (1977),25, n° 1, pp. 48–60.

    Article  MathSciNet  Google Scholar 

  14. Goldberg (D. E.). Genetic algorithms in search, optimization, and machine learning. Addison-Wesley, Don Mills (1989).

    MATH  Google Scholar 

  15. Grötschell (M.), Monma (C.L);. Integer polyhedra arising from certain network design problems with connectivity constraints.SIAM J. Disc. Math. (1990),3, n° 4, pp. 502–523.

    Article  Google Scholar 

  16. Holland (J.H.). Adaptation in natural and artificial systems. The University of Michigan Press, Ann Arbor (1975).

    Google Scholar 

  17. Jan (R.-H.), Hwang (F.-J.), Cheng (S.-T.). Topological optimization of a communication network subject to a reliability constraint.IEEE Trans. Reliability (1993),42, n° 1, pp. 63–70.

    Article  MATH  Google Scholar 

  18. Kamimura (K.), Nishino (H.). An efficient method for determining economical configuration of elementary packet-switched networks.IEEE Trans. COM (1991),39, n° 2, pp. 278–288.

    Article  Google Scholar 

  19. Kershenbaum (A.), Kermant (P.), Grover (G.A.). Mentor: an algorithm for mesh network topological optimization and routing.IEEE Trans. COM (1991),39, n° 4, pp. 503–513.

    Article  Google Scholar 

  20. Kershenbaum (A.). Telecommunications network design algorithms. McGraw-Hill, New York (1993).

    Google Scholar 

  21. Kleinrock (L.). Queueing system, v.l Theory, v.2 Computer applications. John Wiley & Sons, Inc., New York (1976).

    Google Scholar 

  22. Neuman (I.). A system for priority routing and capacity assignment in packet switched networks.Annals of Operations Research (1992), 36, pp. 225–246.

    Article  MATH  Google Scholar 

  23. Newport (K. T.), Varshney (P. K.). Design of survivable com- munications networks under performance constraints.IEEE Trans. Reliability (1991),40, n° 4, pp. 433–440.

    Article  MATH  Google Scholar 

  24. Pierre (S.). A learning-by-example method for improving per- formance of network topologies.In:Engineering Applications of Artificial Intelligence (1994),7, n° 3, pp. 279–288.

    Article  Google Scholar 

  25. Pierre (S.). Acquisition de connaissances pour la conception topologique de réseaux téléinformatiques.In : Thirteenth International Conference, Artificial Intelligence, Expert systems, Natural Language, Avignon, France (mai 1993), 2, pp. 177–186.

  26. Pierre (S.). Application of artificial intelligence techniques to computer network topology design.Engineering Applications of Artificial Intelligence (1993),6, n° 5, pp. 465–472.

    Article  Google Scholar 

  27. Pierre (S.), Hoang (H. H.). Sidro : un système intelligent pour le dimensionnement de réseaux d’ordinateurs.Onzièmes Journées Internationales sur les systèmes experts et leurs applications, Avignon, France (mai 1991), 5, pp. 51–62.

  28. Pierre (S.), Hoang (H. H.). An artificial intelligence approach to improving computer communications network topologies.J. Opl Res. Soc. (1990),41, n° 5, pp. 405–418.

    Article  MATH  Google Scholar 

  29. Pierre (S.), Hoang (H. H.), Hausen-Tropper (E.). A knowledge- based system with learning for computer communication network design.Telematics and Informatics (1990),7, n°s 3–4, pp. 455–466.

    Article  Google Scholar 

  30. Rose (C). Low mean internodal distance network topologies and simulated annealing.IEEE Trans. COM (1992),40, n° 8, 1992, pp. 1319–1326.

    Article  Google Scholar 

  31. Saksena (V. R.). Topological analysis of packet networks.IEEE J. SAC (1989),7, n° 8, 1989, pp. 1243–1252.

    Google Scholar 

  32. Schwartz (M.), Stern (T.E.). Routing techniques used in computer communication networks.IEEE Trans. COM (1980),28, n° 4, pp. 539–552.

    Article  Google Scholar 

  33. Smith (S. F.). A learning system based on genetic adaptive algorithms.Ph. D. Dissertation, University of Pittsburg (1980).

  34. Suk-Gwon (C). Fair integration of routing and flow control in communication networks.IEEE Trans. COM (1992),40, n° 4, pp. 821–834.

    Article  MATH  Google Scholar 

  35. Syswerda (G.). Uniform crossover in genetic algorithms.Proceedings of the Third Conference on Genetic Algorithms, Morgan Kaufmann Publisher (1989).

  36. Tomy (M. J.), Hoang (D. B.). Joint optimization of capacity and flow assignment in a packet-switched communications network.IEEE Trans. COM (1987),35, n° 2, pp. 202–209.

    Article  Google Scholar 

  37. Yokohira (T.), Masashi (S.), Takeshi (N.), Hideo (M.). Fault tolerant packet-switched network design and its sensitivity.IEEE Trans. Reliability (1991),40, n° 4, pp. 452–460.

    Article  MATH  Google Scholar 

  38. Shapiro (S. S.), Wilk (M. B.). Analysis of variance test for normality (complete samples).Bimetrika (1965),52, pp. 591–611.

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Centre de recherche LICEF, Télé-université, Université du Québec, Case postale 670, Succ. C, H2L 4L5, Montréal (Qué.), Canada

    Samuel Pierre

  2. Département de mathématiques, Université du Québec Montréal, Case postale 8888, Succ. Centre-Ville, H3C 3P8, Montréal (Qué.), Canada

    Gisèle Legault

Authors
  1. Samuel Pierre
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Gisèle Legault
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Samuel Pierre.

Additional information

Cet article a été révisé alors que le premier auteur était en séjour sabbatique comme professeur invité au Laboratoire de Téléinformatique de l’Ecole Polytechnique Fédérale de Lausanne, Suisse.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Pierre, S., Legault, G. Une méthode heuristique de dimensionnement de réseaux téléinformatiques. Ann. Télécommun. 51, 143–157 (1996). https://doi.org/10.1007/BF02995505

Download citation

  • Received:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02995505

Mots clés

Key words

Search

Navigation