Internet resiliency to attacks and failures under BGP policy routing

Authors:
Danny Dolev;Sugih Jamin;Osnat Mokryn;Yuval Shavitt
Affiliations:
School of Engineering and Computer Science, The Hebrew University, Jerusalem, Israel;Department of EECS, University of Michigan, Michigan;School of Electrical Engineering, Tel Aviv University, Ramat Aviv, Israel;School of Electrical Engineering, Tel Aviv University, Ramat Aviv, Israel
Venue:
Computer Networks: The International Journal of Computer and Telecommunications Networking
Year:
2006

Citing 10
Cited 10

Approximating maximum independent sets by excluding subgraphs

BIT
Internet routing instability

SIGCOMM '97 Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communication
On power-law relationships of the Internet topology

Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
An analysis of BGP convergence properties

Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
On the origin of power laws in Internet topologies

ACM SIGCOMM Computer Communication Review
BGP4: Inter-Domain Routing in the Internet

BGP4: Inter-Domain Routing in the Internet
Mapping the Internet

Computer
Network topology generators: degree-based vs. structural

Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
BRITE: An Approach to Universal Topology Generation

MASCOTS '01 Proceedings of the Ninth International Symposium in Modeling, Analysis and Simulation of Computer and Telecommunication Systems
DIMES: let the internet measure itself

ACM SIGCOMM Computer Communication Review

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
Bringing order to BGP: Decreasing time and message complexity

Computer Networks: The International Journal of Computer and Telecommunications Networking
Beyond centrality: classifying topological significance using backup efficiency and alternative paths

NETWORKING'07 Proceedings of the 6th international IFIP-TC6 conference on Ad Hoc and sensor networks, wireless networks, next generation internet
The (in)completeness of the observed internet AS-level structure

IEEE/ACM Transactions on Networking (TON)
Towards an AS-to-organization map

IMC '10 Proceedings of the 10th ACM SIGCOMM conference on Internet measurement
Expected convergence properties of BGP

Computer Networks: The International Journal of Computer and Telecommunications Networking
Anatomy of a large european IXP

Proceedings of the ACM SIGCOMM 2012 conference on Applications, technologies, architectures, and protocols for computer communication
A theory for the connectivity discovered by routing protocols

IEEE/ACM Transactions on Networking (TON)
Anatomy of a large european IXP

ACM SIGCOMM Computer Communication Review - Special october issue SIGCOMM '12
A high performance optimal dynamic routing algorithm with unicast multichannel QoS guarantee in communication systems

The Journal of Supercomputing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We investigate the resiliency of the Internet at the Autonomous System (AS) level to failures and attacks, under the real constraint of business agreements between the ASs. The agreements impose policies that govern routing in the AS level, and thus the resulting topology graph is directed, and thus the teachability between Ases is not transitive. We show, using partial views obtained from the Internet, that the Internet's resiliency to a deliberate attack is much smaller than previously found, and its teachability is also somewhat lower under random failures. We use different metrics to measure resiliency, and also investigate the effect of added backup connectivity on the resiliency.