Abstract
This paper proposes a novel traffic engineering framework able to automatically provide near-optimal OSPF routing configurations for QoS constrained scenarios. Within this purpose, this work defines a mathematical model able to measure the QoS compliance in a class-based networking domain. Based on such model, the NP-hard optimization problem of OSPF weight setting is faced resorting to Evolutionary Algorithms. The presented results show that, independently of other QoS aware mechanisms that might be in place, the proposed framework is able to improve the QoS level of a given domain only taking into account the direct influence of the routing component of the network. The devised optimization tool is able to optimize OSPF weight configurations in scenarios either considering a single level of link weights or using multiple levels of weights (one for each class) in multi-topology routing scenarios.
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
Wang, Z.: Internet QoS: Architectures and Mechanisms for Quality of Service. Morgan Kaufmann, San Francisco (2001)
Verma, D.: Supporting Service Level Agreement on IP Networks. McMillan Publishing, New York (1999)
Moy, J.: RFC 2328: OSPF version 2 (April 1998)
Thomas II, T.M.: OSPF Network Design Solutions. Cisco Press, San Jose (1998)
Fortz, B., Thorup, M.: Internet Traffic Engineering by Optimizing OSPF Weights. In: Proceedings of IEEE INFOCOM, pp. 519–528 (2000)
Medina, A., et al.: Traffic matriz estimation: Existing techniques and new directions. Computer Communication Review 32(4), 161–176 (2002)
Davy, A., Botvich, D., Jennings, B.: An efficient process for estimation of network demand for qoS-aware IP network planning. In: Parr, G., Malone, D., Ó Foghlú, M. (eds.) IPOM 2006. LNCS, vol. 4268, pp. 120–131. Springer, Heidelberg (2006)
Psenak, P., et al.: Multi-topology (mt) routing in ospf. Internet draft (November 2006)
Ahuja, R.K., et al.: Network Flows. Prentice-Hall, Englewood Cliffs (1993)
Dijkstra, E.W.: A note on two problems in connexion with graphs. Numerische Mathematik 1, 269–271 (1959)
Moy, J.: OSPF, Anatomy of an Internet Routing Protocol. Addison-Wesley, Reading (1998)
Bolch, G., et al.: Queueing Networks and Markov Chains - Modeling and Performance Evaluation with Computer Science Applications. John Wiley and Sons, Chichester (1998)
Michalewicz, Z.: Genetic Algorithms + Data Structures = Evolution Programs, 3rd edn. Springer, New York (1996)
Medina, A., et al.: BRITE: Universal Topology Generation from a User’s Perspective. Technical Report 2001-003 (January 2001)
Fonseca, C.M., Fleming, P.J.: An overview of evolutionary algorithms in multiobjective optimization. Evolutionary Computation 3(1), 1–16 (1995)
Coello Coello, C.A.: Recent Trends in Evolutionary Multiobjective Optimization, pp. 7–32. Springer, London (2005)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Sousa, P., Rocha, M., Rio, M., Cortez, P. (2007). Class-Based OSPF Traffic Engineering Inspired on Evolutionary Computation. In: Boavida, F., Monteiro, E., Mascolo, S., Koucheryavy, Y. (eds) Wired/Wireless Internet Communications. WWIC 2007. Lecture Notes in Computer Science, vol 4517. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72697-5_12
Download citation
DOI: https://doi.org/10.1007/978-3-540-72697-5_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-72694-4
Online ISBN: 978-3-540-72697-5
eBook Packages: Computer ScienceComputer Science (R0)