Abstract
The purpose of the research reported in this chapter is to meet the increasing and rapidly changing communication demands in a private telecommunication network. The goal is to improve the performance of a telecommunication system just by changes in its software components. The network topology and the tnmk capacities are viewed as fixed parameters, because a change in these components is very expensive. The algorithm of how to use this network is stored in a routing table that consists of alternative paths between the nodes that are supposed to be connected. So the goal of the evolutionary algorithm is to find a routing table that increases the performance of the network by reducing the probability of end-to-end-blocking. The investigated non-hierarchical networks require a fixed alternate routing (FAR) with sequential office control (SOG). The chapter presents a new approach based on evolutionary algorithms to solve this problem.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Bäck, T. (1996) Evolutionary Algorithms in Theory and Practice. Oxford University Press
Fogel, D. B. (1995) Evolutionary Computation: Toward a New Philosophy of Machine Intelligence. IEEE Press, Piscataway, NJ
Michalewicz, Z. (1996) Genetic Algorithms + Data Structures = Evolution Programs. Springer, Berlin
Davis, L., Orvosh, D., Cox, A., Qiu, Y. (1993) A Genetic Algorithm for Survivable Network Design. In S. Forrest, editor, Proceedings of the Fifth International Conference on Genetic Algorithms, 408–415. Morgan Kaufmann, San Mateo, CA
Sinclair, M. C. (1993) The Application of a Genetic Algorithm to Trunk Network Routingtable Optimization. In IEE Proceedings of the Tenth UK Teletraffic Symposium, 2/1-2/6. Martlesham (UK)
Hillermeier, C., Weber, D. (1997) Optimal Routing in Private Networks using Genetic Algorithms. Proceedings of the ISS ’97: World Telecommunication Congress, Toronto, 1, 523–531
Pregla, R. (1984) Grundlagen der Elektrotechnik, Teil I: Felder und Gleichstromnetzwerke. Dr. Alfred Hüthig Verlag, Heidelberg
Ziegenhirt, J. (1998) Optimierung von Routingtabellen in Privaten Netzen mit Evolutionären Algorithmen. Technical Report SYS-3/98, Universität Dortmund
Bai, Z., Hartmann, H. L., He, H., Weber D. (1996) Engineering and Routing for Modular Private ISDNs: Models, New Concepts, Fast Algorithms and Advanced Tools. In Proceedings of Networks ’96
He, H. (1997) Kostenoptimierung privater Telekommunikationsnetze mit digitaler Kanaldurchschaltung. Shaker, Aachen
Born, J. (1978) Evolutionsstrategien zur numerischen Lösung von Adaptationsaufgaben. Dissertation, Humboldt-Universität, Berlin
Girard, A. (1990) Routing and Dimensioning in Circuit-Switched Networks. Addison-Wesley.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Bäck, T., Hillermeier, C., Ziegenhirt, J. (2003). Routing Optimization in Corporate Networks by Evolutionary Algorithms. In: Ghosh, A., Tsutsui, S. (eds) Advances in Evolutionary Computing. Natural Computing Series. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-18965-4_29
Download citation
DOI: https://doi.org/10.1007/978-3-642-18965-4_29
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-62386-8
Online ISBN: 978-3-642-18965-4
eBook Packages: Springer Book Archive