Stable internet routing without global coordination

Abstract

The Border Gateway Protocol (BGP) allows an autonomous system (AS) to apply diverse local policies for selecting routes and propagating reachability information to other domains. However, BGP permits ASs to have conflicting policies that can lead to routing instability. This paper proposes a set of guidelines for an AS to follow in setting its routing policies, without requiring coordination with other ASs. Our approach exploits the Internet's hierarchical structure and the commercial relationships between ASs to impose a partial order on the set of routes to each destination. The guidelines conform to conventional traffic-engineering practices of ISPs, and provide each AS with significant flexibility in selecting its local policies. Furthermore, the guidelines ensure route convergence even under changes in the topology and routing policies. Drawing on a formal model of BGP, we prove that following our proposed policy guidelines guarantees route convergence. We also describe how our methodology can be applied to new types of relationships between ASs, how to verify the hierarchical AS relationships, and how to realize our policy guidelines. Our approach has significant practical value since it preserves the ability of each AS to apply complex local policies without divulging its BGP configurations to others.

References

1. 1 C. Huitema, Routing in the lnternet. Englewood Cliffs, NJ: Prentice- Hall, 1999.]]
2. 2 Y. Rekhter and T. Li, "A Border Gateway Protocol 4 (BGP-4)," IETF, Request for Comments 1771, Mar. 1995.]]
3. 3 J.W. Stewart, BGP4: Inter-Domain Routing in the lnternet. Reading, MA: Addison-Wesley, 1999.]]
4. 4 T.G. Griffin and G. Wilfong, "An analysis of BGP convergence properties," in Proc. ACM SIGCOMM, Sept. 1999, pp. 277-288.]]
5. 5 K. Varadhan, R. Govindan, and D. Estrin, "Persistent route oscillations in inter-domain routing," Univ. of Southern California Information Sciences Inst., Los Angeles, Tech. Rep. 96-631, Feb. 1996.]]
6. 6 D. Meyer, J. Schmitz, C. Orange, M. Prior, and C. Alaettinoglu, "Using RPSL in practice," IETF, Request for Comments 2650, Aug. 1999.]]
7. 7 L. Gao and J. Rexford, "Stable Internet routing without global coordination," in Proc. ACM SIGMETRICS, June 2000, pp. 307-317.]]
8. 8 C. Alaettinoglu, "Scalable router configuration for the Internet," in Proc. 1EEE IC3N, Oct. 1996.]]
9. 9 G. Huston, "Interconnection, peering, and settlements," in Proc. INET, June 1999.]]
10. 10 L. Gao, "On inferring autonomous system relationships in the Internet," IEEE/ACM Trans. Networking, vol. 9, pp. 733-745, Dec. 2001.]]
11. 11 L. Subramanian, S. Agarwal, J. Rexford, and R. H. Katz, "Characterizing the Intemet hierarchy from multiple vantage points," presented at the IEEE Infocom, June 2002.]]
12. 12 S. Halabi and D. McPherson, Internet Routing Architectures, second ed. Indianapolis, IN: Cisco Press, 2001.]]
13. 13 R. Govindan and A. Reddy, "An analysis of Internet inter-domain topology and route stability," in Proc. IEEE INFOCOM, vol. 2, Apr. 1997, pp. 850-857.]]
14. 14 C. Labovitz, A. Ahuja, and F. Jahanian, "Experimental study of Internet stability and wide-area network failures," in Proc. Fault-Tolerant Computing Symp., June 1999, pp. 278-285.]]
15. 15 C. Labovitz, R. Malan, and E Jahanian, "Internet routing stability," IEEE/ACM Trans. Networking, vol. 6, pp. 515-528, Oct. 1998.]]
16. 16 ---, "Origins of pathological Intemet routing instability," in Proc. IEEEINFOCOM, vol. 1, Mar. 1999, pp. 218-226.]]
17. 17 C. Labovitz, A. Ahuja, A. Abose, and E Jahanian, "Delayed Internet routing convergence," 1EEE/ACM Trans. Networking, vol. 9, pp. 293-306, June 2001.]]
18. 18 R. Govindan, C. Alaettinoglu, G. Eddy, D. Kessens, S. Kumar, and W. Lee, "An architecture for stable, analyzable Internet routing," IEEE Network Mag., vol. 13, pp. 29-35, Jan./Feb. 1999.]]
19. 19 T. Griffin and G. Wilfong, "A safe path vector protocol," in Proc. IEEE INFOCOM, vol. 2, Mar. 2000, pp. 490-499.]]
20. 20 T.G. Griffin, E B. Shepherd, and G. Wilfong, "Policy disputes in pathvector protocols," in Proc. Int. Conf. Network Protocols, Nov. 1999, pp. 21-30.]]
21. 21 C. Alaettinoglu, C. Villamizar, E. Gerich, D. Kessens, D. Meyer, T. Bates, D. Karrenberg, and M. Terpstra, "Routing policy specification language (RPSL)," IETF, Request for Comments 2622, June 1999.]]
22. 22 R. Govindan, C. Alaettinoglu, K. Varadhan, and D. Estrin, "Route servers for inter-domain routing," Computer Networks 1SDN Syst., vol. 30, pp. 1157-1174, 1998.]]
23. 23 D. McPherson, V. Gill, D. Walton, and A. Retana. (2001, Mar.) BGP persistent route oscillation condition. IETF, Work in progress, Intemet Draft. {Online}. Available: http://www.ietf.org/intemet-drafts/draft-ietf-idr-route-oscillation-00.txt]]
24. 24 T. H. Cormen, C. E. Leiserson, and R. L. Rivest, Introduction to Algorithms. New York: McGraw-Hill, 1990.]]
25. 25 H. Chang, R. Govindan, S. Jamin, S. Shenker, and W. Willinger, "On inferring AS-level connectivity from BGP routing tables,", 2001, submitted for publication.]]
26. 26 M. Faloutsos, P. Faloutsos, and C. Faloutsos, "On power-law relationships of the Internet topology," in Proc. ACM SIGCOMM, Aug. 1999, pp. 251-261.]]
27. 27 E. Chen and T. Bates, "An application of the BGP Community attribute in multi-home routing," IETF, Request for Comments 1998, Aug. 1996.]]
28. 28 L. Gao, T. G. Griffin, and J. Rexford, "Inherently safe backup routing with BGP," in Proc. 1EEE INFOCOM, vol. 1, Apr. 2001, pp. 547-556.]]
29. 29 A. Feldmann and J. Rexford, "IP network configuration for intradomain traffic engineering," IEEE Network Mag., vol. 15, pp. 46-57, Sept./Oct. 2001.]]

Index Terms

• Mathematics of computing

  • Discrete mathematics

    • Graph theory

      • Paths and connectivity problems

• Networks

  • Network properties

    • Network structure

• Theory of computation

  • Design and analysis of algorithms

    • Approximation algorithms analysis

      • Routing and network design problems