Survivable IP network design with OSPF routing

Networks

Volumn 49, Issue 1, 2007, Pages 51-64

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

^a FEDERAL UNIVERSITY OF RIO GRANDE DO SUL   (Brazil)

^b AT AND T LABS RESEARCH   (United States)

Author keywords

Evolutionary algorithm; Internet; Network design; OSPF routing; Survivability

Indexed keywords

NETWORK DESIGN; NETWORK OPERATOR; NETWORK TOPOLOGY; OPEN SHORTEST PATH FIRST (OSPF); SURVIVABILITY;

COMPUTER NETWORKS; EVOLUTIONARY ALGORITHMS; INTERNET PROTOCOLS; ROUTERS; ROUTING PROTOCOLS; TELECOMMUNICATION TRAFFIC; TOPOLOGY;

MOTION PLANNING;

EID: 33947581852     PISSN: 00283045     EISSN: 10970037     Source Type: Journal    
DOI: 10.1002/net.20141     Document Type: Conference Paper

References (12)

1. J.C. Bean, Genetic algorithms and random keys for sequencing and optimization, ORSA J Comp 6 (1994), 154-160.
2. A. Bley, "A Lagrangian approach for integrated network design and routing in IP Networks," Proceedings of International Network Optimization Conference (INOC 2003), 2003, pp. 107-113.
3. A. Bley, M. Grötschel, and R. Wessäly, "Design of broadband virtual private networks: Model and heuristics for the B-WiN," Robust communication networks: Interconnection and survivability, volume 53 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, N. Dean, D.F. Hsu, and R. Ravi (Editors), American Mathematical Society, New Providence, RI, 1998, pp. 1-16.
4. P. Broström and K. Holmberg, Multiobjective design of survivable IP networks, Technical Report LiTH-MAT-R 2004-03, Division of Optimization, Linköping Institute of Technology, 2004.
5. L.S. Buriol, M.G.C. Resende, C.C. Ribeiro, and M. Thorup, A hybrid genetic algorithm for the weight setting problem in OSPF/IS-IS routing, Networks 46 (2005), 36-56.
6. L.S. Buriol, M.G.C. Resende, and M. Thorup, Speeding up dynamic shortest path algorithms, Technical Report TD-5RJ8B, AT&T Labs Research, 2003.
7. E. Dijkstra, A note on two problems in connexion with graphs, Numer Math 1 (1959), 269-271.
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. B. Fortz and M. Thorup, Increasing internet capacity using local search, Comput Optimizat Appl 29 (2004), 13-48. (Preliminary short version of this paper published as "Internet Traffic Engineering by Optimizing OSPF weights," Proc. 19th IEEE Conf. on Computer Communications (INFOCOM), 2000, pp. 519-528.
10. D.E. Goldberg, Genetic algorithms in search, optimization, and machine learning, Addison-Wesley, Reading, MA, 1989.
11. J.H. Holland, Adaptation in natural and artificial systems, MIT Press, Cambridge, MA, 1975.
12. K. Holmberg and D. Yuan, Optimization of internet protocol network design and routing, Networks 43 (2004), 39-53.