A Genetic Algorithm for the Weight Setting Problem in OSPF Routing

作者: M. Ericsson , M.G.C. Resende , P.M. Pardalos

DOI: 10.1023/A:1014852026591

关键词: Computer networkDistributed computingComputer scienceOpen Shortest Path FirstPrivate Network-to-Network InterfaceShortest path problemK shortest path routingFlooding (computer networking)IP forwardingConstrained Shortest Path FirstIS-IS

摘要: … OSPF weight setting (OSPFWS) problem seeks a set of weights that optimizes network performance. We study the problem of optimizing OSPF … used heuristics for OSPF weight setting, …

参考文章(23)
Thomas M. Thomas, OSPF Network Design Solutions ,(2003)
Andreas Bley, Roland Wessäly, Martin Grötschel, Design of broadband virtual private networks:Model and Heuristics for the B–WiN Robust Communication Networks: Interconnection and Survivability. pp. 1- 16 ,(1998)
Armando Pinto, IP Routing Protocols Journal of Optical Networking. ,vol. 1, pp. 153- 153 ,(2002)
J. Moy, OSPF Protocol Analysis RFC. ,vol. 1245, pp. 1- 12 ,(1991)
A. Feldmann, A. Greenberg, C. Lund, N. Reingold, J. Rexford, NetScope: traffic engineering for IP networks IEEE Network. ,vol. 14, pp. 11- 19 ,(2000) , 10.1109/65.826367
J. McManus, J. Malcolm, J. Agogbua, D. Awduche, M. O'Dell, Requirements for Traffic Engineering Over MPLS RFC. ,vol. 2702, pp. 1- 29 ,(1999)