Optimal configuration for BGP route selection

Proceedings - IEEE INFOCOM

Volumn 2, Issue , 2003, Pages 916-926

  Bressoud, Thomas C ^a,b   Rastogi, Rajeev ^c   Smith, Mark A ^c  

^a DENISON UNIVERSITY   (United States)

^b INTEL RESEARCH   (United States)

^c LUCENT TECHNOLOGIES   (United States)

Author keywords

BGP; Border Router Advertisements; Interdomain routing; Load Balancing

Indexed keywords

BANDWIDTH; HEURISTIC METHODS; ROUTERS; TELECOMMUNICATION TRAFFIC; GATEWAYS (COMPUTER NETWORKS); INTERNET PROTOCOLS; INTERNET SERVICE PROVIDERS; OPTIMIZATION;

ROUTE SELECTION; ANECDOTAL EVIDENCES; AUTONOMOUS SYSTEMS; BANDWIDTH CONSTRAINT; BGP; BORDER GATEWAY PROTOCOL; BORDER ROUTERS; BOTTLENECK LINK; GENERALIZED ASSIGNMENT PROBLEM; HEURISTIC SOLUTIONS; HOT-POTATO ROUTING; INTERDOMAIN ROUTING; LOAD-BALANCING; NET WORK UTILIZATION; OPTIMAL CONFIGURATIONS; OPTIMAL SETS; OPTIMAL UTILIZATION; OPTIMIZATION PROBLEMS; TRAFFIC FLOW; TRANSIT SERVICES;

COMPUTER NETWORKS; PEER TO PEER NETWORKS;

EID: 0042941446     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/infcom.2003.1208929     Document Type: Conference Paper

References (17)

1. G. Huston, ISP Survival Guide Strategies for Running a Competitive ISP. John Wiley and Sons, 1999.
2. Y. Rekhter and T. Li, "A border gateway protocol 4," Internet-Draft (RFC1771), February 1998.
3. J. W. S. III, BGP4: Inter-Domain Routing in the Internet. Addison-Wesley, 1999.
4. B. Halabi, Internet Routing Architectures. Cisco Press, 1997.
5. C. Labovitz, G. R. Malan, and P. Jahanian, "Internet routing instability," in Proceedings of ACM SIGCOMM, 1997.
6. N. Feamster, J. Borkenhagen, and J. Rexford, "Controlling the impact of BGP policy changes on ip traffic," AT&T Labs - Research, Tech. Rep. HA173000-011106-02TM, 2001.
7. B. Fortz and M. Thorup, "Internet traffic engineering by optimizing OSPF weights," in Proceedings of IEEE INFOCOM, 2000, pp. 519-528.
8. L. Gao and J. Rexford, "Stable internet routing without global coordination," in Proceedings of ACM SIGMETRICS, June 2000.
9. R. Govindan and A. Reddy, "An analysis of internet inter-domain topology and route stability," in Proceedings of INFOCOM'97, April 1997.
10. T. G. Griffin, F. B. Shepherd, and G. Wilfong, "Policy disputes in path vector protocols," in Proceedings of the 7th International Conference on Network Protocols (INCP'99), Toronto, Canada, November - December 1999.
11. T. G. Griffin and G. Wilfong, "An analysis of bgp convergence properties," in Proceedings of SIGCOMM'99, Cambridge, Massachusetts, August 1999.
12. _, "A safe path vector protocol," in Proceedings of INFOCOM'00, Tel Aviv, Israel, March 2000.
13. J.-H. Lin and J. S. Vitter, "ε-approximations with minimum packing constraint violation," in Proceedings of the 24th Annual ACM Symposium on the Theory of Computation, Victoria, Canada, May 1992, pp. 771-782.
14. D. B. Shmoys and E. Tardos, "An approximation algorithm for the generalized assignment problem," Mathematical Programming A, vol. 62, pp. 461-474, 1993.
15. J. K. Lenstra, D. B. Shmoys, and B. Tardos, "Approximation algorithms for scheduling unrelated parallel machines," Mathematical Programming A, vol. 46, pp. 259-271, 1990.
16. C. Chekuri and S. Khanna, "A PTAS for the multiple knapsack problem," in In Proceedings of the Twelfth Annual ACM-SIAM Syposium on Discrete Algorithms (SODA), January 2000.
17. R. K. Ahuja, T. L. Magnanti, and J. B. Orlin, Network Flows. Prentice Hall, 1993.