Toward Valley-Free Inter-domain Routing

ASes in inter-domain routing receive little information about the quality of the routes they receive. This lack of information can lead to inefficient and even incorrect routing. In this paper, we quantitatively characterize BGP announcements that violate the so-called valley- free property-an indicator that universal best practices are not being preserved in the propagation of routes. Our analysis indicates that valley announcements are more pervasive than expected. Approximately ten thousand valley announcements appear every day and involve a substantial number of prefixes. 11 % of provider ASes propagate valley announcements, with a majority of violations happening at intermediate providers. We find that large surges of violating announcements can be attributed to transient configuration errors. We further propose a dynamic mechanism that provides route propagation information as transitive attributes of BGP. This information implicitly reflects the policies of the ASes along the path, without revealing the relationship of each AS pair. BGP-speaking routers use this information to identify (and presumably avoid) routes that violate the valley-free property.

[1]  Charles Lynn,et al.  Secure Border Gateway Protocol (Secure-BGP) , 2000 .

[2]  G GriffinTimothy,et al.  An analysis of BGP convergence properties , 1999 .

[3]  Joseph Kee-yin Ng,et al.  Extensions to BGP to Support Secure Origin BGP , 2004 .

[4]  Mark Handley,et al.  HLP: a next generation inter-domain routing protocol , 2005, SIGCOMM '05.

[5]  Lixia Zhang,et al.  Quantifying Path Exploration in the Internet , 2006, IEEE/ACM Transactions on Networking.

[6]  Stephen T. Kent,et al.  Secure Border Gateway Protocol (S-BGP) , 2000, IEEE Journal on Selected Areas in Communications.

[7]  Randy H. Katz,et al.  Characterizing the Internet hierarchy from multiple vantage points , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[8]  Lixin Gao,et al.  On the evaluation of AS relationship inferences [Internet reachability/traffic flow applications] , 2004, IEEE Global Telecommunications Conference, 2004. GLOBECOM '04..

[9]  Josh Karlin Pretty Good BGP : Protecting BGP by Cautiously Selecting Routes Paper , 2005 .

[10]  Patrick D. McDaniel,et al.  Characterizing Address Use Structure and Stability of Origin Advertisement in Inter-domain Routing , 2006, 11th IEEE Symposium on Computers and Communications (ISCC'06).

[11]  Jennifer Rexford,et al.  Pretty Good BGP: Improving BGP by Cautiously Adopting Routes , 2006, Proceedings of the 2006 IEEE International Conference on Network Protocols.

[12]  Daniel Massey,et al.  PHAS: A Prefix Hijack Alert System , 2006, USENIX Security Symposium.

[13]  Yih-Chun Hu,et al.  SPV: secure path vector routing for securing BGP , 2004, SIGCOMM 2004.

[14]  Ratul Mahajan,et al.  Understanding BGP misconfiguration , 2002, SIGCOMM 2002.

[15]  Deborah Estrin,et al.  Persistent route oscillations in inter-domain routing , 2000, Comput. Networks.

[16]  Jennifer Rexford,et al.  Stable internet routing without global coordination , 2001, TNET.

[17]  Lixin Gao,et al.  On inferring autonomous system relationships in the Internet , 2000, Globecom '00 - IEEE. Global Telecommunications Conference. Conference Record (Cat. No.00CH37137).

[18]  A. Terzis,et al.  Efficient Techniques for Detecting False Origin Advertisements in Inter-domain Routing , 2006, 2006 2nd IEEE Workshop on Secure Network Protocols.

[19]  Nick Feamster,et al.  Some Foundational Problems in Interdomain Routing , 2004 .

[20]  Michalis Faloutsos,et al.  Analyzing BGP policies: methodology and tool , 2004, IEEE INFOCOM 2004.

[21]  Volker Roth,et al.  Listen and whisper: security mechanisms for BGP , 2004 .

[22]  Gordon T. Wilfong,et al.  An analysis of BGP convergence properties , 1999, SIGCOMM '99.

[23]  Gordon T. Wilfong,et al.  The stable paths problem and interdomain routing , 2002, TNET.

[24]  G. Di Battista,et al.  Computing the types of the relationships between autonomous systems , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[25]  G. Huston,et al.  Interconnection, Peering and Settlements , 2003 .

[26]  Lixin Gao,et al.  On inferring and characterizing Internet routing policies , 2003, Journal of Communications and Networks.

[27]  Patrick D. McDaniel,et al.  Origin authentication in interdomain routing , 2003, CCS '03.