Published in Proceeding of Mathematical Programming in Rio, pp. 40-44, Búzios, Rio de Janeiro, Brazil, 2003.
ABSTRACTInternet protocol (IP) traffic follows rules established by routing protocols, such as Open Shortest Path First (OSPF). Each router computes shortest paths using weights assigned by the network operator, and creates destination tables used to direct each IP packet to the next router on the path to its final destination. Furthermore, the routing protocol is used to establish procedures to be taken in case of a failure in the network. In this extended abstract, we describe a new genetic algorithm for designing a network with minimal total link capacity necessary to route demand without overload in case of any single edge or node failure.
PDF file of paper
file of paper
Mauricio G.C. Resende's Home PageLast modified: 19 December 2003