An analysis of BGP multiple origin AS (MOAS) conflicts
IMW '01 Proceedings of the 1st ACM SIGCOMM Workshop on Internet Measurement
The stable paths problem and interdomain routing
IEEE/ACM Transactions on Networking (TON)
On the structure and application of BGP policy atoms
Proceedings of the 2nd ACM SIGCOMM Workshop on Internet measurment
Towards an accurate AS-level traceroute tool
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
On inferring and characterizing internet routing policies
Proceedings of the 3rd ACM SIGCOMM conference on Internet measurement
In search of path diversity in ISP networks
Proceedings of the 3rd ACM SIGCOMM conference on Internet measurement
Towards capturing representative AS-level Internet topologies
Computer Networks: The International Journal of Computer and Telecommunications Networking
Dynamics of hot-potato routing in IP networks
Proceedings of the joint international conference on Measurement and modeling of computer systems
BorderGuard: detecting cold potatoes from peers
Proceedings of the 4th ACM SIGCOMM conference on Internet measurement
SIGMETRICS '05 Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Building an AS-topology model that captures route diversity
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
AS relationships: inference and validation
ACM SIGCOMM Computer Communication Review
Computing the types of the relationships between autonomous systems
IEEE/ACM Transactions on Networking (TON)
Traffic matrix reloaded: impact of routing changes
PAM'05 Proceedings of the 6th international conference on Passive and Active Network Measurement
ACM SIGCOMM Computer Communication Review
Modeling internet topology dynamics
ACM SIGCOMM Computer Communication Review
Internet routing resilience to failures: analysis and implications
CoNEXT '07 Proceedings of the 2007 ACM CoNEXT conference
In search of the elusive ground truth: the internet's as-level connectivity structure
SIGMETRICS '08 Proceedings of the 2008 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Quantifying path exploration in the internet
IEEE/ACM Transactions on Networking (TON)
A hierarchical model for BGP routing policies
Proceedings of the 2nd ACM SIGCOMM workshop on Programmable routers for extensible services of tomorrow
The (in)completeness of the observed internet AS-level structure
IEEE/ACM Transactions on Networking (TON)
Impact of routing parameters on route diversity and path inflation
Computer Networks: The International Journal of Computer and Telecommunications Networking
Proceedings of the 6th International COnference
Phase changes in the evolution of the IPv4 and IPv6 AS-Level Internet topologies
Computer Communications
Routing policies in named data networking
Proceedings of the ACM SIGCOMM workshop on Information-centric networking
Obtaining provably legitimate internet topologies
IEEE/ACM Transactions on Networking (TON)
Border gateway protocol (BGP) and traceroute data workshop report
ACM SIGCOMM Computer Communication Review
Inferring visibility: who's (not) talking to whom?
ACM SIGCOMM Computer Communication Review - Special october issue SIGCOMM '12
Routing state distance: a path-based metric for network analysis
Proceedings of the 2012 ACM conference on Internet measurement conference
AS relationships, customer cones, and validation
Proceedings of the 2013 conference on Internet measurement conference
Studying interdomain routing over long timescales
Proceedings of the 2013 conference on Internet measurement conference
Hi-index | 0.00 |
Routing policies are typically partitioned into a few classes that capture the most common practices in use today[1]. Unfortunately, it is known that the reality of routing policies[2] and peering relationships is far more complex than those few classes[1,3]. We take the next step of searching for the appropriate granularity at which policies should be modeled. For this purpose, we study how and where to configure per-prefix policies in an AS-level model of the Internet, such that the selected paths in the model are consistent with those observed in BGP data from multiple vantage points. By comparing business relationships with per-prefix filters, we investigate the role and limitations of business relationships as a model for policies. We observe that popular locations for filtering correspond to valleys where no path should be propagated according to inferred business relationships. This result reinforces the validity of the valley-free property used for business relationships inference. However, given the sometimes large path diversity ASs have, business relationships do not contain enough information to decide which path will be chosen as the best. To model how individual ASs choose their best paths, we introduce a new abstraction: next-hop atoms. Next-hop atoms capture the different sets of neighboring ASs an AS uses for its best routes. We show that a large fraction of next-hop atoms correspond to per-neighbor path choices. A non-negligible fraction of path choices, however, correspond to hot-potato routing and tie-breaking within the BGP decision process, very detailed aspects of Internet routing.