Abstract
Setting weights for Open Shortest Path First (OSPF) routing protocol is an NP-hard problem. Optimizing these weights leads to less congestion in the network while utilizing link capacities efficiently. In this paper, Simulated Evolution (SimE), a non-deterministic iterative heuristic, is engineered to solve this problem. A cost function that depends on the utilization and the extra load caused by congested links in the network is used. A goodness measure which is a prerequisite of SimE is designed to solve this problem. The proposed SimE algorithm is compared with Simulated Annealing. Results show that SimE explores search space intelligently due to its goodness function feature and reaches near optimal solutions very quickly.
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
Thomas II, T.M.: OSPF Network Design Solutions. Cisco Press (1998)
Black, U.: IP Routing Protocols. Prentice Hall Series (2000)
Moy, J.T.: OSPF: Anatomy of an Internet Routing Protocol. Addison-Wesley, Reading (1999)
Fortz, B., Thorup, M.: Internet traffic engineering by optimizing OSPF weights. In: IEEE Conference on Computer Communications (INFOCOM), pp. 519–528 (2000)
Sait, S.M., Youssef, H.: Iterative Computer Algorithms and their Application to Engineering. IEEE Computer Society Press, Los Alamitos (1999)
Frigioni, D., Loffreda, M., Nanni, U., Pasqualone, G.: Experimental analysis of dynamic algorithms for the single source shortest paths problem. ACM Journal of Experimental Algorithms (1998)
Ericsson, M.R., Pardalos, P.: A genetic algorithm for the weight setting problem in OSPF routing. In: J. Combinatorial Optimisation Conference (2002)
Rodrigues, M., Ramakrishnan, K.G.: Optimal routing in data networks. In: Presentation at International Telecommunication Symposium (ITS) (1994)
Feldmann, A., Greenberg, A., Lund, C., Reigold, N., Rexford, J., True, F.: Deriving traffic demands for operational ip networks: Methodology and experience. IEEE/ACM Transactions on Networking 9(3) (2001)
Srivastava, S., Agrawal, G., Pioro, M., Medhi, D.: Determining link weight system under various objectives for OSPF networks using a lagrangian relaxation-based approach. IEEE Transactions on Network and Service Management 2(1), 9–18 Third quarter (2005)
Sridharan, A., Guerin, R., Diot, C.: Achieving near-optimal traffic engineering solutions for current OSPF/IS-IS networks. IEEE INFOCOM (2003)
Sqalli, M.H., Sait, S.M., Mohiuddin, M.A.: An enhanced estimator to multi-objective OSPF weight setting problem. In: Proceedings of 10th IEEE/IFIP Network Operations & Management Symposium (NOMS 2006) (April 2006)
Fortz, B., Thorup, M.: Increasing internet capacity using local search. Technical Report IS-MG (2000)
Kling, R.M., Banerjee, P.: ESP: Placement by Simulated Evolution. IEEE Transactions on CAD Vol. 8(3), 245–256 (1989)
Sait, S.M., Youssef, H., Hussain, A.: Fuzzy simulated evolution algorithm for multiobjective optimization of VLSI placement. In: IEEE Congress on Evolutionary Computation, Washington, D.C., U.S.A., pp. 91–97 (July 1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sait, S.M., Sqalli, M.H., Mohiuddin, M.A. (2006). Engineering Evolutionary Algorithm to Solve Multi-objective OSPF Weight Setting Problem. In: Sattar, A., Kang, Bh. (eds) AI 2006: Advances in Artificial Intelligence. AI 2006. Lecture Notes in Computer Science(), vol 4304. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11941439_103
Download citation
DOI: https://doi.org/10.1007/11941439_103
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-49787-5
Online ISBN: 978-3-540-49788-2
eBook Packages: Computer ScienceComputer Science (R0)