Abstract
Topology design of computer networks is a constrained optimization problem for which exact solution approaches do not scale well. This paper introduces a self-learning, non-greedy optimization technique for network topology design. It generates new solutions based on the merit of the preceding ones. This is achieved by maintaining a solution library for all the variables. Based on certain heuristics, the library is updated after each set of generated solutions. The algorithm has been applied to a MPLS-based IP network design problem. The network consists of a set of Label Edge Routers (LERs) routing the total traffic through a set of Label Switching Routers (LSRs) and interconnecting links. The design task consists of — 1) assignment of user terminals to LERs; 2) placement of LERs; and 3) selection of the actually installed LSRs and their links, while distributing the traffic over the network. Results show that our techniques attain the optimal solution, as given by GNU solver - lp_solve, effectively with minimum computational burden.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Kershenbaum, A.: Telecommunications network design algorithms. McGraw-Hill, Inc., New York (1993)
El-Alfy, E.S.: MPLS network topology design using genetic algorithms. In: Proc. of IEEE Intl. Conf. on Computer Systems and Applications, pp. 1059–1065 (March 2006)
Ghosh, S., Ghosh, P., Basu, K., Das, S.K.: GaMa: An evolutionary algorithmic approach for the design of mesh-based radio access networks. In: Proc. of IEEE Conf. on Local Computer Networks (November 2005)
Elbaum, R., Sidi, M.: Topological design of local-area networks using genetic algorithms. IEEE/ACM Transactions on Networking 4(5) (1996)
Quoitin, B.: Topology generation based on network design heuristics. In: Proc. of CoNEXT, pp. 278–279 (2005)
Youssef, H., Sait, S.M., Khan, S.A.: Topology design of switched enterprise networks using a fuzzy simulated evolution algorithm. Engineering Applications of Artificial Intelligence 15(3), 327–340 (2002)
Runggeratigul, S.: A memetic algorithm for communication network design taking into consideration an existing network. Applied Optimization - Metaheuristics: computer decision-making, 615–626 (2004)
Pioro, M., Myslek, A., Juttner, A., Harmatos, J., Szentesi, A.: Topological design of MPLS networks. In: Proc. of IEEE Globecom, vol. 1, pp. 12–16 (November 2001)
Arabas, J., Kozdrowski, S.: Applying an evolutionary algorithm to telecommunication network design. IEEE Transactions on Evolutionary Computation 5(4), 309–322 (2001)
Harik, G.R., Lobo, F.G., Goldberg, D.E.: The compact genetic algorithm. IEEE Transactions on Evolutionary Computation 3(4), 287–297 (1999)
Muhlenbein, H.: The equation for response to selection and its use for prediction. Evolutionary Computation 5(3), 303–346 (1997)
Goldberg, D.E.: Genetic Algorithms in Search, Optimization and Machine Learning. Add.-Wesley Prof., London (1989)
Burkardt, J.: Halton random sequence generator, http://people.scs.fsu.edu/~burkardt/cpp_src/halton/halton.html
Geem, Z.W., Kim, J.H., Loganathan, G.V.: A new heuristic optimization algorithm: Harmony search. Simulation, the Society for Modeling and Simulation International 76(2), 60–68 (2001)
Yeniay, O.: Penalty function methods for constrained optimization with genetic algorithms. Mathematical and Computational Applications 10(1), 45–56 (2005)
GNU_Public_License: Integer linear programming (ILP) solver ‘lp_solve’, http://lpsolve.sourceforge.net/5.5/
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Das, A., Vemuri, R. (2008). A Self-learning Optimization Technique for Topology Design of Computer Networks. In: Giacobini, M., et al. Applications of Evolutionary Computing. EvoWorkshops 2008. Lecture Notes in Computer Science, vol 4974. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-78761-7_5
Download citation
DOI: https://doi.org/10.1007/978-3-540-78761-7_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-78760-0
Online ISBN: 978-3-540-78761-7
eBook Packages: Computer ScienceComputer Science (R0)