A hybrid genetic algorithm for the weight setting problem in OSPF/IS-IS routing

Networks

Volumn 46, Issue 1, 2005, Pages 36-56

  Buriol, L S ^a   Resende, M G C ^b   Ribeiro, C C ^c   Thorup, M ^b  

^a UNIVERSITY OF CAMPINAS   (Brazil)

^b AT AND T LABS RESEARCH   (United States)

^c PONTIFICAL CATHOLIC UNIVERSITY OF RIO DE JANEIRO   (Brazil)

Author keywords

Genetic algorithm; Internet; metaheuristics; IS IS routing; Local search; Optimized crossover; OSPF routing

Indexed keywords

LOCAL SEARCH; MESSAGE PASSING INTERFACE (MPI); METAHEURISTICS; OPTIMIZED CROSSOVER; OSPF ROUTING;

COMPUTATIONAL METHODS; GATEWAYS (COMPUTER NETWORKS); INTERNET; NETWORK PROTOCOLS; OPTIMIZATION; ROUTERS; SET THEORY; TELECOMMUNICATION TRAFFIC;

GENETIC ALGORITHMS;

EID: 23244433221     PISSN: 00283045     EISSN: None     Source Type: Journal    
DOI: 10.1002/net.20070     Document Type: Article

References (29)

1. R.M. Alex, M.G.C. Resende, and C.C. Ribeiro, Probability distribution of solution time in GRASP: An experimental investigation, J Heuristic, 8 (2002), 343-373.
2. J.C. Bean, Genetic algorithms and random keys for sequencing and optimization, ORSAJ. Comp. 6 (1994), 154-160.
3. A. Bley, M. Grötchel, and R. Wessläy, Design of broad-band virtual private networks: Model and heuristics for the B-WiN, Technical Report SC 98-13, Konrad-Zuse-Zentrum fur Informationstecknik Berlin, 1998.
4. (To appear in Proc. DIMACS Workshop on Robust Communication Network and Survivability, AMS-DIMACS Series).
5. L.S. Buriol, M.G.C. Resende, and M. Thorup, Speeding up dynamic shortest path algorithms, Technical report, AT&T Labs Research, Florham Park, NJ, 2003.
6. K. Calvert, M. Doar, and E.W. Zegura, Modeling internet topology, IEEE Commun Magazine, Indianapolis, IN, 35 (1997), 160-163.
7. Cisco, Configuring OSPF, Cisco Press, Indianapolis, IN, 1997.
8. M. Ericsson, M.G.C. Resende, and P.M. Pardalos, A genetic algorithm for the weight setting problem in OSPF routing, J Combin Optimizat 6 (2002), 299-333.
9. 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 Trans Networking 9 (2001), 265-279.
10. B. Fortz, J. Rexford, and M. Thorup, Traffic engineering with traditional IP routing protocols, IEEE Commun Magazine October (2002), 118-124.
11. B. Fortz and M. Thorup, Increasing internet capacity using local search, Comput Optimizat Applicat 29 (2004), 13-48
12. [preliminary short version of this paper published as "Internet Traffic Engineering by Optimizing OSPF weights," in Proc. 19th IEEE Conf. on Computer Communications (INFOCOM 2000)].
13. D. Frigioni, M. Ioffreda, U. Nanni, and G. Pasqualone, Experimental analysis of dynamic algorithms for the single source shortest path problem, ACM J Exp Alg 3 (1998) article 5.
14. D. Frigioni, A. Marchetti-Spaccamela, and U. Nanni, "Fully dynamic output-bounded single source shortest-paths problem," Proc. ACM-SIAM Symp. Discrete Algorithms, 1996, pp. 212-221.
15. Internet Engineering Task Force, Ospf version 2, Technical Report RFC 1583, Network Working Group, 1994.
16. F. Lin and J. Wang, "Minimax open shortest path first routing algorithms in networks supporting the smds services," Proc. IEEE International Conference on Communications (ICC), 1993, vol. 2, pp. 666-670.
17. M. Matsumoto and T. Nishimura, Mersenne Twister: A 623-dimensionally equidistributed uniform pseudorandom number generator, ACM Trans Modeling Comput Simulat 8 (1998), 3-30.
18. J.T. Moy, OSPF, Anatomy of an Internet Routing Protocol, Addison-Wesley, Reading. MA, 1998.
19. M. Pióro, Á. Szentesi, J. Harmatos, A. Jüttner, P. Gajowniczek, and S. Kozdrowski, On open shortest path first related network optimisation problems, Performance Evaluat 48 (2002), 201-223.
20. K.G. Ramakrishnan and M.A. Rodrigues, Optimal routing in shortest-path data networks, Bell Labs Tech 6 (2001), 117-138.
21. G. Ramalingam and T. Reps, An incremental algorithm for a generalization of the shortest-path problem. J Algorithms 21 (1996), 267-305.
22. M.G.C. Resende and C.C. Ribeiro, "Greedy randomized adaptive search procedures," Handbook of metaheuristics, F. Grover and G. Kochen Gerger (Editors), Kluwer Academic Publishers, Dordrecht, 2003, pp. 219-249.
23. N. Spring, R. Mahajan, D. Wetherall, and T. Anderson, Measuring ISP topologies with Rocketfuel, IEEE/ACM Trans Networking 12 (2004), 2-16.
24. A. Sridharan, R. Guérin, and C. Diot, Achieving near-optimal traffic engineering solutions for current OSPF/IS-IS networks, Sprint ATL Technical Report TR02-ATL-022037, Sprint Labs, 2002.
25. L. Subramanian, S. Agarwal, J. Rexford, and R.H. Katz, "Characterizing the Internet hierarchy from multiple vantage points," Proc. 21st IEEE Conf. on Computer Communications (INFOCOM 2002), 2002, vol. 2, pp. 618-627.
26. T.M. Thomas II, OSPF network design solutions, Cisco Press, Indianapolis, IN, 1998.
27. B.M. Waxman, Routing of multipoint connections, IEEE J Selected Areas Commun (Special Issue on Broadband Packet Communication) 6 (1998), 1617-1622.
28. E.W. Zegura, GT-ITM: Georgia Tech internetwork topology models (software), 1996. http://www.cc.gatech.edu/fac/Ellen.Zegura/gt-itm/gt-itm.tar. gz.
29. E.W. Zegura, K.L. Calvert, and S. Bhattacharjee, "How to model an internetwork," Proc. 15th IEEE Conf. on Computer Communications (INFOCOM), 1996, pp. 594-602.