Increasing internet capacity using local search

Computational Optimization and Applications

Volumn 29, Issue 1, 2004, Pages 13-48

  Fortz, Bernard ^a   Thorup, Mikkel ^b  

^a UNIVERSITÉ CATHOLIQUE DE LOUVAIN   (Belgium)

^b AT AND T LABS RESEARCH   (United States)

Author keywords

Local search; Shortest path routing; Traffic engineering

Indexed keywords

INTERNET SERVICE PROVIDERS (ISP); LOCAL SEARCH; SHORTEST PATH ROUTING; TRAFFIC ENGINEERING;

APPROXIMATION THEORY; CONGESTION CONTROL (COMMUNICATION); HEURISTIC METHODS; MATRIX ALGEBRA; NUMERICAL ANALYSIS; PROBLEM SOLVING; QUALITY OF SERVICE; TELECOMMUNICATION LINKS; TELECOMMUNICATION TRAFFIC;

INTERNET;

EID: 4444278382     PISSN: 09266003     EISSN: None     Source Type: Journal    
DOI: 10.1023/B:COAP.0000039487.35027.02     Document Type: Article

References (40)

1. E.H.L. Aarts and J.K. Lenstra, Local Search in Combinatorial Optimization. Discrete Mathematics and Optimization Wiley-Interscience: Chichester, England, 1997.
2. D. Applegate and M. Thorup, "Load optimal mpls routing with n + m labels," in Proc. 22nd IEEE Conf. on Computer Communications (INFOCOM), (to appear), 2003.
3. R. Battiti and G. Tecchiolli, "The reactive tabu search," ORSA Journal on Computing, vol. 6, no. 2, pp. 126-140, 1994.
4. W. Ben-Ameur and E. Gourdin, "Internet routing and related topology issues," Technical report, France Telecom R&D, 2001.
5. W. Ben-Ameur, N. Michel, E. Gourdin, and B. Liau, "Routing strategies for IP networks," Telektronikk, vols. 2/3, pp. 145-158,2001.
6. A. Bley, M. Grötchel, and R. Wessäly, "Design of broadband virtual private networks: Model and heuristics for the B-WiN," in Proc. DEMACS Workshop on Robust Communication Networks and Survivability, AMS-DIMACS Series, vol. 53, 1998, pp. 1-16.
7. L.S. Buriol, M.G.C. Resende, C.C. Ribeiro, and M. Thorup, "A memetic algorithms for OSPF routing," in Proceedings of the 6th INFORMS Telecom, 2002, pp.187-188.
8. K. Calvert, M. Doar, and E.W. Zegura, "Modeling internet topology," IEEE Communications Magazine, vol. 35, no. 6, pp. 160-163, 1997
9. W. Carlton and J. Bames, "A note on hashing functions and tabu search algorithms," European Journal of Operational Research, vol. 95, pp. 237-239, 1996.
10. J.L. Carter and M.N.Wegman, "Universal classes of hash functions," Jounal of Computer and System Sciences, vol. 18, pp. 143-154, 1979.
11. Cisco, "Configuring OSPF," 1997, Documentation at http://www.cisco.com/[4]univercd/cc/td/doc/product/software/ios113ed/113ed_cr/ np1_c/1cospf.htm.
12. S. Cook, "The complexity of theorem proving procedures," in Proc. 3rd ACM Symp. on Theory of Computing (STOC), 1971, pp. 151-158.
13. M. Dietzfelbinger, "Universal hashing and k-wise independent random variables via integer arithmetic without primes," in Proc. 13th Symp. on Theoretical Aspects of Computer Science (STAGS), LNCS vol. 1046, Springer, 1996, pp. 569-580.
14. M. Ericsson, M. Resende, and P. Pardalos, "A genetic algorithm for the weight setting problem in OSPF routing," 2001, To appear in J. Combinatorial Optimization in 2002.
15. B. Fortz, J. Rexford, and M. Thorup, "Traffic engineering with traditional IP routing protocols," IEEE Communications Magazine, vol. 40, no. 10, pp. 118-124, 2002.
16. B. Fortz and M. Thorup, "Increasing internet capacity using local search," Technical Report IS-MG 2000/21, Université Libre de Bruxelles, 2000a. http://smg.ulb.ac.be/Preprints/Fortz00_21.html.
17. B. Fortz and M. Thorup, "Internet traffic engineering by optimizing OSPF weights," in Proc. 19th IEEE Conf. on Computer Communications (INFOCOM), 2000b, pp. 519-528.
18. B. Fortz and M. Thorup, "Optimizing OSPF/IS-IS weights in a changing world," IEEE Journal on Selected Areas in Communications, vol. 20, no. 4, pp. 756-767,2002.
19. D. Frigioni, M. loffreda, U. Nanni, and G. Pasqualone, "Experimental analysis of dynamic algorithms for the single-source shortest path problem," ACM Jounal of Experimental Algorithmics, vol. 3, no. 5,1998.
20. F. Glover, "Future paths for integer programming and links to artificial intelligence," Computers & Operations Research, vol. 13, pp. 533-549, 1986.
21. F. Glover, "Tabu search-Part I," ORSA Journal on Computing, vol. 1, no. 3, pp. 190-206, 1989.
22. F. Glover, "Tabu search-Part II," ORSA Journal on Computing, vol. 2, no. 1, pp. 4-32, 1990.
23. F. Glover and M. Laguna, Tabu Search, Kluwer Academic Publishers, 1997.
24. J. Håstad, "Some optimal inapproximability results," Journal of the ACM, vol. 48, no. 4, pp. 798-859, 2001.
25. D.E. Knuth, "The Art of Computer Programming III: Sorting and Searching," Addison-Wesley: Reading, MA, 1973.
26. F. Lin and J. Wang, "Minimax open shortest path first routing algorithms in networks supporing the smds services," in Proc. IEEE International Conference on Communications (ICC), vol. 2,1993, pp. 666-670.
27. D. Mitra and K. Ramakrishnan, "A case study of multiservice, multipriority traffic engineering design for data networks," in Proc. IEEE GLOBECOM, 1999, pp. 1077-1083.
28. J.T. Moy, OSPF: Anatomy of an Internet Routing Protocal, Addison-Wesley, 1999.
29. G. Ramalingam and T. Reps, "An incremental algorithm for a generalization of the shortest-path problem," Jounal of Algorithms, vol. 21, no. 2, pp. 267-305,1996.
30. M. Rodrigues and K. Ramakrishnan, "Optimal routing in data networks," Presentation at International Telecommunications Symposium (ITS), Rio de Genero, Brazil, 1994.
31. B.C. Rosen, A. Viswanathan, and R. Gallon, "Multiprotocol label switching architecture," Network Working Group, Internet Draft (work in progress), 1999. http://search.ietf.org/internet-drafts/draft-ietf-mpls-arch-05.txt.
32. AM. Roughan and M. Thorup, "Avoiding ties in shortest path first routing," Technical report, AT&T Labs-Research, 2002.
33. Sprint, "Sprint IP backbone network and MPLS," 2002, White Paper http://www.sprintbiz.com/resource_library/resources/Sprin tCiscoMPLS.pdf.
34. M. Thorup, "Even strongly universal hashing is pretty fast," in Proc. 11th ACM-SIAM Symp. on Discrete Algorithms (SODA), 2000, pp. 496-497.
35. B.M. Waxman, "Routing of multipoint connections," IEEE Jour. Selected Areas in Communications (Special Issue on Broadband Packet Communications), vol. 6, no. 9, pp. 1617-1622,1988.
36. D.L. Woodruff and E. Zemel, "Hashing vectors for tabu search," Annals of Operations Research, vol. 41, pp. 123-137,1993.
37. X. Xiao, A. Hannan, B. Bailey, and L. Ni, "Traffic engineering with MPLS in the Internet," IEEE Network Magazine, vol. 14, no. 2, pp. 28-33,2000.
38. 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.
39. E.W.E.W. Zegura, K.L. Calvert, and S. Bhattacharjee, "How to model an internetwork," in Proc. 15th IEEE Conf. on Computer Communications (INFOCOM), 1996, pp. 594-602.
40. A.L. Zobrist and F.R. Carlson, Jr., "Detection of combined occurrences," Comm. ACM, vol. 20, no. 1, pp. 31-35, 1977.