Abstract
The paper concerns the survivability of computer network area. The considered optimization task is the congestion problem in connection-oriented networks. This paper presents a highly configurable evolutionary algorithm together with computer experimentation system supporting its efficiency analysis. The particular emphasis is placed on parameter control and tuning process of evolutionary algorithm. The results of analysis are discussed.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Przewoźniczek, M., Walkowiak, K.: Evolutionary Algorithm for Congestion Problem in Connection-Oriented Networks. In: Gervasi, O., Gavrilova, M.L., Kumar, V., Laganá, A., Lee, H.P., Mun, Y., Taniar, D., Tan, C.J.K. (eds.) ICCSA 2005. LNCS, vol. 3483, pp. 802–811. Springer, Heidelberg (2005)
Kasprzak, A.: Wide Area Networks. OWPW, Wroclaw (1999) (in Polish)
Pioro, M., Deepankar, M.: Routing, Flow, and Capacity Design in Communication and Computer Networks. Morgan Kaufman Publishers, San Francisco (2004)
Fogel, D.B.: Evolutionary Computation: The Fossil Record. IEEE Press, Piscataway (1998)
Walkowiak, K.: Ant Algorithm for Flow Assignment in Connection-oriented Networks. International Journal of Applied Mathematics and Computer Science 15, 205–220 (2005)
Mahmoud, T.M.: A Genetic and Simulated Annealing Based Algorithms for Solving the Flow Assignment Problem. International Journal of Electr. Circuits and Systems 2 (2007)
Walkowiak, K.: Maximizing Residual Capacity in Connection-Oriented Networks. Intern. J. of Applied Mathematics and Computer Science, Article ID 72547 (2006)
Przewozniczek, M., Walkowiak, K.: Quasi-hierarchical Evolution Algorithm for Flow Assignment in Survivable Connection-Oriented Networks. International Journal of Applied Mathematics and Computer Science 16, 101–116 (2006)
Eiben, A.E., Hinterding, R., Michalewicz, Z.: Parameter Control in Evolutionary Algorithms. IEEE Transactions on Evolutionary Computation 3(2), 124–141 (1999)
Ford, L.R., Fulkerson, D.R.: A Suggested Computation for Maximal Multicommodity Network Flows. Management Science, 597–601 (1958)
Michalewicz, Z.: Genetic Algorithms + Data Structure = Evolutionary Programs. PWN, Warsaw (1999) (in Polish)
Ma, Q., Steenkiste, P.: On Path Selection for Traffic with Bandwidth Guarantees. In: Proceedings of the International Conference on Network Protocols, pp. 191–202 (1997)
Koszalka, L., Lisowski, D., Pozniak-Koszalka, I.: Comparison of Allocation Algorithms for Mesh Networks using Multistage Experiment. In: Gavrilova, M.L., Gervasi, O., Kumar, V., Tan, C.J.K., Taniar, D., Laganá, A., Mun, Y., Choo, H. (eds.) ICCSA 2006. LNCS, vol. 3984, pp. 58–67. Springer, Heidelberg (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ohia, D., Koszalka, L., Kasprzak, A. (2009). Evolutionary Algorithm for Solving Congestion Problem in Computer Networks. In: Velásquez, J.D., Ríos, S.A., Howlett, R.J., Jain, L.C. (eds) Knowledge-Based and Intelligent Information and Engineering Systems. KES 2009. Lecture Notes in Computer Science(), vol 5711. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04595-0_14
Download citation
DOI: https://doi.org/10.1007/978-3-642-04595-0_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-04594-3
Online ISBN: 978-3-642-04595-0
eBook Packages: Computer ScienceComputer Science (R0)