On Inferring and Characterizing Internet Routing Policies

  • Wang, Feng (School of Engineering Computational & Sciences at Liberty University) ;
  • Gao, Lixin (Department of ECE, University of Massachusetts)
  • Published : 2007.12.31

Abstract

Border gateway protocol allows autonomous systems(ASes) to apply diverse routing policies for selecting routes and for propagating reachability information to other ASes. Although a significant number of studies have been focused on the Internet topology, little is known about what routing policies network operators employ to configure their networks. In this paper, we infer and characterize routing policies employed in the Internet. We find that routes learned from customers are preferred over those from peers and providers, and those from peers are typically preferred over those from providers. We present an algorithm for inferring and characterizing export policies. We show that ASes announce their prefixes to a selected subset of providers to perform traffic engineering for incoming traffic. We find that the selective announcement routing policies imply that there are much less available paths in the Internet than shown in the AS connectivity graph, and can make the Internet extremely sensitive to failure events. We hope that our findings will help network operators in designing routing policies.

Keywords

References

  1. Y. Rekhter and T. Li, 'Border gateway protocol 4 (BGP-4),' RFC 1771, T. J. Watson Research Center, IBM Corp., Cisco Systems, Mar. 1995
  2. H. Tangmunarunkit, R.Govindan, S. Jamin, S. Shenker, and W. Willinger, 'Network topology generators: Degree based vs. structural,' in Proc. ACM SIGCOMM, Aug. 2002
  3. R. Govindan and H. Tangmunarunkit, 'Heuristics for Internet map discovery,' in Proc. IEEE INFOCOM, 2000
  4. M. Faloutsos, P. Faloutsos, and C. Faloutsos, 'On power-law relationships of the Internet topology,' in Proc. ACM SIGCOMM, Cambridge, MA, USA, Sept. 1999
  5. P. Barford, A. Bestavros, J. Byers, and M. Crovella, 'On the marginal utility of network topology measurements,' in Proc. SIGCOMM Internet Measurement Workshop (IMW 2001), Nov. 2001
  6. Meirt Network. [Online]. Available: http://www.irr.net
  7. G. Huston, 'Interconnection, peering, and settlements,' in Proc. INET, June 1999
  8. University of Oregon Route Views Project. [Online]. Available: http://www.antc.uoregon.edu/route-views/
  9. Trace route. [Online]. Available: http://www.traceroute.org
  10. Merit Network. [Online]. Available: ftp://ftp.radb.net/routing.arbiter/radb/ dbase/
  11. L. Gao, 'On inferring autonomous system relationships in the Internet,' IEEE Trans. Networking, Dec, 2001
  12. L. Subramanian, S. Agarwal, J. Rexford, and R. H. Katz, 'Characterizing the Internet hierarchy from multiple vantage points,' in Proc. IEEE INFOCOM, June 2002
  13. G. D. Battista, M. Patrignani, and M. Pizzonia, 'Computing the types of the relationships between autonomous systems,' Tech. Rep. RT-DIA-732002, Dipartimento di Informatica e Automazione, University Roma Tre, Rome, 2002
  14. F. Wang and L. Gao, 'On inferring and characterizing Internet routing policies,' in Proc. ACM Internet Measurement Conf., Miami, USA, Oct. 2003