A biased random-key genetic algorithm for OSPF and DEFT routing to minimize network congestion

International Transactions in Operational Research

Volumn 18, Issue 3, 2011, Pages 401-423

  Reis, Roger ^a   Ritt, Marcus ^a   Buriol, Luciana S ^a   Resende, Mauricio G C ^b  

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

^b AT AND T LABS RESEARCH   (United States)

Author keywords

Biased random key genetic algorithm; Genetic algorithm; Local search; Metaheuristics; Networking; Networks; Routing; Telecommunication networks

Indexed keywords

COMPUTATIONAL EXPERIMENT; DESTINATION NODES; DYNAMIC FLOWS; DYNAMIC SHORTEST PATH; FLOW SPLITTING; FLOWTHROUGH; FORWARD LINKS; LOCAL SEARCH; META HEURISTICS; NETWORK CONGESTIONS; NETWORKING; OPEN SHORTEST PATH FIRST; ROUTING; WEIGHT SETTING;

GENETIC ALGORITHMS; INTERNET PROTOCOLS; NETWORK ROUTING; NETWORKS (CIRCUITS); TELECOMMUNICATION NETWORKS;

GATEWAYS (COMPUTER NETWORKS);

EID: 84859514434     PISSN: 09696016     EISSN: 14753995     Source Type: Journal    
DOI: 10.1111/j.1475-3995.2010.00771.x     Document Type: Article

References (20)

1. Bean, J.C., 1994. Genetic algorithms and random keys for sequencing and optimization. ORSA Journal on Computing 6, 154-160.
2. Ben-Ameur, W., Gourdin, E., 2003. Internet routing and related topology issues. SIAM Journal on Discrete Mathematics 17, 18-49.
3. Bley, A., 2005. On the approximability of the minimum congestion unsplittable shortest path routing problem. In Jünger, M., Kaibel, V. (eds) Integer Programming and Combinatorial Optimization, Vol. 3509/2005, Lecture Notes in Computer Science. Springer, Berlin, pp. 97-110.
4. Broström, P., Holmberg, K., 2006. Multiobjective design of survivable IP networks. Annals of Operations Research 147, 235-253.
5. Buriol, L.S., Resende, M.G.C., Ribeiro, C., Thorup, M., 2005. A hybrid genetic algorithm for the weight setting problem in OSPF/IS-IS routing. Networks 460, 1, 36-56.
6. Ericsson, M., Resende, M.G.C., Pardalos, P., 2002. A genetic algorithm for the weight setting problem in OSPF routing. Journal of Combinatorial Optimization 6, 299-333.
7. Fortz, B., Thorup, M., 2000. Internet traffic engineering by optimizing OSPF weights. In Proceedings of the 29th IEEE Conference on Computer Communications (INFOCOM 2000), Tel Aviv, Israel, pp. 519-528.
8. Fortz, B., Thorup, M., 2004. Increasing Internet capacity using local search. Computational Optimization and Applications 290, 1, 13-48.
9. Girão-Silva, R., Craveirinha, J., Clímaco, J., 2009. Hierarchical multiobjective routing in Multiprotocol Label Switching networks with two service classes: A heuristic solution. International Transactions in Operational Research 16, 275-305.
10. Goldberg, D.E., 1989. Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley, Reading.
11. Gonçalves, J.F., Resende, M.G.C., 2009. Biased random-key genetic algorithms for combinatorial optimization. Technical Report, AT&T Labs Research, Florham Park, NJ 07932.
12. Holland, J.H., 1975. Adaptation in Natural and Artificial Systems. MIT Press, Cambridge, MA.
13. Holmberg, K., Yuan, D., 2004. Optimization of Internet protocol network design and routing. Networks 43, 39-53.
14. Konak, A., Coit, D.W., Smith, A.E., 2006. Multi-objective optimization using genetic algorithms: A tutorial. Reliability Engineering and System Safety 91, 992-1007.
15. Moscato, P., 2002. Memetic algorithms. In Pardalos, P.M., Resende, M.G.C. (eds) Handbook of Applied Optimization. Oxford University Press, Oxford, pp. 157-167.
16. Ramalingam, G., Reps, T., 1996. An incremental algorithm for a generalization of the shortest-path problem. Journal of Algorithms 21, 267-305.
17. Spears, W.M., DeJong, K.A., 1991. On the virtues of parameterized uniform crossover. In Proceedings of the Fourth International Conference on Genetic Algorithms, pp. 230-236.
18. Wang, N., Ho, K., Pavlou, G., Howarth, M., 2008. An overview of routing optimization for Internet traffic engineering. IEEE Communications Surveys and Tutorials 100, 1, 36-56.
19. Xu, D., Chiang, M., Rexford, J., 2007. DEFT: Distributed exponentially weighted flow splitting. In Proceedings of 26th IEEE Conference on Computer Communications (INFOCOM), Anchorage, AK, May 2007, pp. 71-79.
20. Xu, D., Chiang, M., Rexford, J., 2008. Link-state routing with hop-by-hop forwarding can achieve optimal traffic engineering. In Proceedings of the 27th IEEE Conference on Computer Communications (INFOCOM), Phoenix, AZ, pp. 466-474.