Abstract
With the growth of the Internet, Internet Service Providers (ISPs) try to meet the increasing traffic demand with new technology and improved utilization of existing resources. Routing of data packets can affect network utilization. Packets are sent along network paths from source to destination following a protocol. Open Shortest Path First (OSPF) is the most commonly used intra-domain Internet routing protocol (IRP). Traffic flow is routed along shortest paths, splitting flow at nodes with several outgoing links on a shortest path to the destination IP address. Link weights are assigned by the network operator. A path length is the sum of the weights of the links in the path. The OSPF weight setting (OSPFWS) problem seeks a set of weights that optimizes network performance. We study the problem of optimizing OSPF weights, given a set of projected demands, with the objective of minimizing network congestion. The weight assignment problem is NP-hard. We present a genetic algorithm (GA) to solve the OSPFWS problem. We compare our results with the best known and commonly used heuristics for OSPF weight setting, as well as with a lower bound of the optimal multi-commodity flow routing, which is a linear programming relaxation of the OSPFWS problem. Computational experiments are made on the AT&T Worldnet backbone with projected demands, and on twelve instances of synthetic networks.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
R.K. Ahuja, T.L. Magnanti, and J.B. Orlin, Network Flows, Prentice Hall: Englewood Cliffs, NJ, 1993.
D.O. Awduche, J. Malcolm, J. Agogbua, M. O'Dell, and J. McManus, “Requirements for traffic engineering over MPLS,” Network Working Group, Technical Report RFC 2702, 1999. Available at http://search.ietf.org/rfc/rfc2702.txt.
J.C. Bean, “Genetic algorithms and random keys for sequencing and optimization,” ORSA J. on Computing, vol. 6, pp. 154–160, 1994.
U. Black, “IP Routing Protocols, RIP, OSPF, BGP, PNNI & Cisco Routing Protocols, Prentice Hall: Englewood Cliffs, NJ, 2000.
A. Bley, M. Grötchel, and R. Wessläy, “Design of broadband virtual private networks: Model and heuristics for the B-WiN,” in Robust Communication Networks: Interconnection and Survivability, N. Dean, D.F. Hsu, and R. Rav (Eds.), DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 53, pp. 1–16, American Mathematical Society, New Providence, 2000.
K. Calvert, M. Doar, and E.W. Zegura, “Modeling internet topology,” IEEE Communications Magazine, vol. 35, pp. 160–163, 1997.
Cisco, Configuring OSPF, Cisco Press, 1997.
K.G. Coffman and A.M. Odlyzko, “Internet growth: Is there a “Moore's Law” for data traffic?” in Handbook of Massive Data Sets, J. Abello, P.M. Pardalos, and M.G.C. Resende (Ed.). Kluwer Academic Publishers: Norwell, MA, 2001, pp. 47–93.
E. Dijkstra, “A note on two problems in connection of graphs,” Numerical Mathematics, vol. 1, pp. 269–271, 1959.
A. Feldmann, A. Greenberg, C. Lund, N. Reingold, and J. Rexford, “NetScope:Traffic engineering for IP networks,” IEEE Network Magazine, vol. 14, pp. 11–19, 2000.
A. Feldmann, A. Greenberg, C. Lund, N. Reingold, J. Rexford, and F. True, “Deriving traffic demands for operational IP networks: Methodology and experience,” IEEE/ACM Transactions on Networking, vol. 9, pp. 265–279, 2001.
B. Fortz and M. Thorup, “Increasing internet capacity using local search,” Technical report, AT&T Labs Research, 2000. A preliminary short version of this paper published as “Internet Traffic Engineering by Optimizing OSPF weights,” in Proc. IEEE INFOCOM 2000sThe Conference on Computer Communications.
D.E. Goldberg, Genetic Algorithms in Search, Optimization, and Machine Learning, Addison-Wesley: Reading, MA, 1989.
J.H. Holland, Adaptation in Natural and Artificial Systems, MIT Press: Cambridge, MA, 1975.
R.B. Hollstein, “Artificial genetic adaptation in computer control systems,” Ph.D. thesis, University of Michigan, 1971.
Internet Engineering Task Force, “Ospf version 2,” Network Working Group, Technical Report RFC 1583, 1994.
N.K. Karmarkar, “A new polynomial-time algorithm for linear programming,” Combinatorica, vol. 4, pp. 373–395, 1984.
L.G. Khachiyan, “A polynomial time algorithm for linear programming,” Dokl. Akad. Nauk SSSR, vol. 244, pp. 1093–1096, 1979.
J.R. Koza, F.H. Bennett III, D. Andre, and M.A. Keane, Genetic Programming III, Darwinian Invention and Problem Solving, Morgan Kaufmann: San Mateo, CA, 1999.
F. Lin and J. Wang, “Mini max open shortest path first routing algorithms in networks supporting the smds services,” in Proc. IEEE International Conference on Communications (ICC), 1993, vol. 2, pp. 666–670.
P. Moscato, “Memetic algorithms,” in Handbook of Applied Optimization, P.M. Pardalos and M.G.C. Resende (Eds.), Oxford University Press: Oxford, UK, 2001.
J.T. Moy, “OSPF protocol analysis,” Network Working Group, Technical Report RFC 1245, 1991.
J.T. Moy, OSPF, Anatomy of an Internet Routing Protocol, Addison-Wesley: Reading, MA, 1998.
M. Rodrigues and K.G. Ramakrishnan, “Optimal routing in data networks,” presented at International Telecommunication Symposium (ITS), 1994.
W. Stallings, High-Speed Networks TCP/IP and ATM Design Principles, Prentice Hall: Englewood Cliffs, NJ, 1998.
T.M. Thomas II, OSPF Network Design Solutions, Cisco Press, 1998.
B.M. Waxman, “Routing of multipoint connections,” IEEE J. Selected Areas in Communications (Special Issue on Broadband Packet Communication), vol. 6, pp. 1617–1622, 1998.
E.W. Zegura, “GT-ITM: Georgia Tech internet work topology models (software),” 1996. Available at http://www.cc.gatech.edu/fac/Ellen.Zegura/gt-itm/gt-itm.tar.gz.
E.W. Zegura, K.L. Calvert, and S. Bhattacharjee, “How to model an internetwork,” in Proc. 15th IEEE Conf. on Computer Communications (INFOCOM), 1996, pp. 594–602.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Ericsson, M., Resende, M. & Pardalos, P. A Genetic Algorithm for the Weight Setting Problem in OSPF Routing. Journal of Combinatorial Optimization 6, 299–333 (2002). https://doi.org/10.1023/A:1014852026591
Issue Date:
DOI: https://doi.org/10.1023/A:1014852026591