Internet routing and related topology issues

SIAM Journal on Discrete Mathematics

Volumn 17, Issue 1, 2003, Pages 18-49

  Ben Ameur, Walid ^a   Gourdin, Eric ^b  

^a INSTITUT NATIONAL DES TÉLÉCOMMUNICATIONS   (France)

^b ORANGE LABS   (France)

Author keywords

Graph topology; Internet network; Shortest path routing

Indexed keywords

COMPUTATION THEORY; CONGESTION CONTROL (COMMUNICATION); CONTROL SYSTEMS; GRAPH THEORY; HEURISTIC METHODS; LINEAR PROGRAMMING; OPTIMIZATION; TELECOMMUNICATION TRAFFIC; TOPOLOGY;

GRAPH TOPOLOGY; INTERNET NETWORK; SHORTEST PATH ROUTING;

INTERNET;

EID: 1442311554     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895480100377428     Document Type: Article

References (40)

1. C. BARNHART, C. HANE, AND P. VANCE, Using branch-and-price to solve origin-destination integer multicommodity flow problems, Oper. Res., 2 (2000), pp. 318-326.
2. W. BEN-AMEUR, Constrained length connectivity and survivable networks, Networks, 36 (2000), pp. 17-33.
3. W. BEN-AMEUR AND E. GOURDIN, Exact Algorithms for Internet Dimensioning, Technical report DE/DAC/OAT/30.99, France Télécom R&D, Issy-les-Moulineaux, France, 1999 (in French).
4. W. BEN-AMEUR, E. GOURDIN, B. LIAU, AND N. MICHEL, Dimensioning of Internet networks, in Proceedings of the Second International Workshop on the Design of Reliable Communication Networks, Munich, 2000, pp. 56-61.
5. W. BEN-AMEUR, E. GOURDIN, B. LIAU, AND N. MICHEL, Routing strategies for IP networks, in Telektronikk Magazine, 2/3 (2001), pp. 145-158.
6. C. BERGE, Graphes et Hypergraphes, Dunod, Paris, 1970.
7. B. BOLLABÁS, Random Graphs, Academic Press, London, 1985.
8. D. BURTON AND PH.L. TOINT, On an instance of the inverse shortest paths problem, Math. Program., 53 (1992), pp. 45-61.
9. K. L. CALVERT, M. B. DOAR, AND E. W. ZEOURA, Modeling Internet topology, IEEE Communications Magazine, 35 (1997), pp. 160-163.
10. ILOG, Inc., Using the CPLEX Linear Optimizer, Incline Village, NV,
11. E. CRAWLEY, R. NAIR, R. RAJAGOPALAN, AND H. SANDICK, A Framework for QoS-Based Routing in the Internet, IETF Request for comments 2386, 1998.
12. R. DIESTEL, Graph Theory, Springer, 1997.
13. Y. DINITZ, N. GARG, AND M. X. GOEMANS, On the single-source unsplittable flow problem, Combinatorica, 19 (1999), pp. 1-25.
14. S. E. DREYFUS, An appraisal of some shortest-path algorithms, ORSA J. Comput., 17 (1969), pp. 395-412.
15. M. FALOUTSOS, P. FALOUTSOS, AND C. FALOUTSOS, On power-law relationships of the internet topology, in Proceedings of SIGCOMM '99, ACM, New York, 1999.
16. A. FARAGO, A. SZENTESI, AND B. SZVIATOVSZKI, Allocation of administrative weights in PNNI, in Proceedings of Networks '98, Italy, 1998, pp. 621-625.
17. B. FORTZ AND M. THORUP, Internet traffic engineering by optimizing OSPF weights, in Proceedings of the Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies, Vol. 2, IEEE Press, Piscataway, NJ, 2000, pp. 519-528.
18. ATM FORUM, Private network-network interface, specification version 1.0, af-pnni-0055.00, 1996.
19. P. GAJOWNICZEK, M. PIÓRO, M. SZENTESI, AND A. HARMATOS, Solving an OSPF routing problem with simulated allocation, in Proceedings of the First Polish-German Teletraffic Symposium, Dresden, 1998.
20. J. GEFFARD, A 0-1 model for singly routed traffic in telecommunications, Annals Telecommunications, 56 (2001), pp. 140-149.
21. M. GONDRAN AND M. MINOUX, Graphes et algorithmes, Eyrolles, Paris, 1995.
22. M. GRÖTSCHEL, L. LOVÁSZ, AND A. SCHRIJVER, The ellipsoid method and its consequences in combinatorial optimization, Combinatorica, 1 (1981), pp. 169-197.
23. C. HEDRICK, Routing Information Protocol, IETF Request for comments 1058, 1988.
24. C. HUITEMA, Le routage dans l'Internet, Eyrolles, 1995.
25. N. KATOH, T. IBARAKI, AND H. MINE, An efficient algorithm for K shortest simple paths, Networks, 12 (1982), pp. 411-427.
26. D. LORENZ AND A. ORDA, QoS routing in networks with uncertain parameters, IEEE/ACM Transactions on Networking, 6 (1998), pp. 768-778.
27. D. LORENZ, A. ORDA, D. RAZ, AND Y. SHAVITT, How good can IP routing be?, Technical report 2001-17, DIMACS, Rutgers University, Piscataway, NJ, 2001.
28. K. MEHLHON, S. NÄHER, M. SEEL, AND C. UHRIG, Efficient Data Types and Algorithms, version 3.7., LEDA Software GmbH, Saarbrücken, Germany.
29. M. MINOUX, Programmation Mathématique-Théorie et Algorithmes, Dunod, Paris, 1983.
30. J. MOY, OSPF Version 2, IETF Request for comments 1583, 1994.
31. G. L. NEMHAUSER AND L. A. WOLSEY, Integer and Combinatorial Optimization, John Wiley, New York, 1988.
32. D. ORAN, OSI IS-IS Intra-Domain Routing Protocol, IETF Request for comments 1142, 1990.
33. K. PARK, S. KANG, AND S. PARK, An integer programming approach to the bandwidth packing problem, Management Science, 42 (1996), pp. 1277-1291.
34. L. PETERSON AND B. DAVIE, Computer Networks, A Systems Approach, Morgan Kaufmann, San Francisco, CA, 2000.
35. A. SCHRIJVER, P. SEYMOUR, AND P. WINKLER, The ring loading problem, SIAM J. Discrete Math., 11 (1998), pp. 1-14.
36. Z. WANG AND J. CROWCROFT, Quality-of-service routing for supporting multimedia applications, IEEE J. Selected Areas Communications, 14 (1996), pp. 1228-1234.
37. Y. WANG, Z. WANG, AND L. ZHANG, Internet traffic engineering without full mesh overlaying, in Proceedings of the Twentieth Annual Joint Conference of the IEEE Computer and Communication Societies, Vol. 1, IEEE Press, Piscataway, NJ, 2001, pp. 565-571.
38. B. M. WAXMAN, Routing of multipoint connections, IEEE J. Selected Areas Communications, 6 (1988), pp. 1617-1622.
39. J. Y. YEN, Finding the K shortest loopless paths in a network, Management Science, 17 (1971), pp. 712-716.
40. J. ZINKY, G. VICHNIAC, AND A. KHANNA, Performance of the revised routing metric in the ARPANET and MILNET, In proceedings of the Military Communications Conference, Vol. 1, IEEE, 1989, pp. 219-224.