An analysis of BGP convergence properties
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
RIP: an intra-domain routing protocol
RIP: an intra-domain routing protocol
Stable internet routing without global coordination
IEEE/ACM Transactions on Networking (TON)
On inferring autonomous system relationships in the internet
IEEE/ACM Transactions on Networking (TON)
The stable paths problem and interdomain routing
IEEE/ACM Transactions on Networking (TON)
Algebra and algorithms for QoS path computation and hop-by-hop routing in the internet
IEEE/ACM Transactions on Networking (TON)
Policy Disputes in Path-Vector Protocols
ICNP '99 Proceedings of the Seventh Annual International Conference on Network Protocols
An algebraic theory of dynamic network routing
IEEE/ACM Transactions on Networking (TON)
Incentive-compatible interdomain routing
EC '06 Proceedings of the 7th ACM conference on Electronic commerce
AS relationships: inference and validation
ACM SIGCOMM Computer Communication Review
Internet resiliency to attacks and failures under BGP policy routing
Computer Networks: The International Journal of Computer and Telecommunications Networking
Computing the types of the relationships between autonomous systems
IEEE/ACM Transactions on Networking (TON)
On guidelines for safe route redistributions
Proceedings of the 2007 SIGCOMM workshop on Internet network management
Internet routing resilience to failures: analysis and implications
CoNEXT '07 Proceedings of the 2007 ACM CoNEXT conference
Shedding light on the glue logic of the internet routing architecture
Proceedings of the ACM SIGCOMM 2008 conference on Data communication
Digraphs: Theory, Algorithms and Applications
Digraphs: Theory, Algorithms and Applications
Connectivity Measures for Internet Topologies on the Level of Autonomous Systems
Operations Research
IEEE Network: The Magazine of Global Internetworking
BGP routing policies in ISP networks
IEEE Network: The Magazine of Global Internetworking
| Hi-index | 0.00 |
Route-vector protocols, such as the Border Gateway Protocol (BGP), have nodes elect and exchange routes in order to discover paths over which to send traffic. We ask the following: What is the minimum number of links whose failure prevents a route-vector protocol from finding such paths? The answer is not obvious because routing policies prohibit some paths from carrying traffic and because, on top of that, a route-vector protocol may hide paths the routing policies would allow. We develop an algebraic theory to address the above and related questions. In particular, we characterize a broad class of routing policies for which we can compute in polynomial time the minimum number of links whose failure leaves a route-vector protocol without a communication path from one given node to another. The theory is applied to a publicly available description of the Internet topology to quantify how much of its intrinsic connectivity is lost due to the traditional customer-provider, peer-peer routing policies and how much can be regained with simple alternative policies.