1/27 Evaluating Potential Routing Diversity for Internet Failure Recovery *Chengchen Hu, + Kai Chen, + Yan Chen, *Bin Liu *Tsinghua University, + Northwestern.

Slides:



Advertisements
Similar presentations
Martin Suchara in collaboration with I. Avramopoulos and J. Rexford How Small Groups Can Secure Interdomain Routing.
Advertisements

CSE534- Fundamentals of Computer Networking Lecture 12-13: Internet Connectivity + IXPs (The Underbelly of the Internet) Based on slides by D. Choffnes.
1 EL736 Communications Networks II: Design and Algorithms Class3: Network Design Modeling Yong Liu 09/19/2007.
Network Layer: Internet-Wide Routing & BGP Dina Katabi & Sam Madden.
Packet Switching Vs Circuit Switching Packet-switched and circuit-switched networks use two different technologies for sending messages and data from one.
Internet and Overlay Networks Ram Keralapura ECE Dept
1 Internet Path Inflation Xenofontas Dimitropoulos.
Part II: Inter-domain Routing Policies. March 8, What is routing policy? ISP1 ISP4ISP3 Cust1Cust2 ISP2 traffic Connectivity DOES NOT imply reachability!
Progress in inferring business relationships between ASs Dmitri Krioukov 4 th CAIDA-WIDE Workshop.
1 Finding a Needle in a Haystack: Pinpointing Significant BGP Routing Changes in an IP Network Jian Wu (University of Michigan) Z. Morley Mao (University.
Traffic Engineering With Traditional IP Routing Protocols
Mini Introduction to BGP Michalis Faloutsos. What Is BGP?  Border Gateway Protocol BGP-4  The de-facto interdomain routing protocol  BGP enables policy.
CS Summer 2003 Quiz 1 Q1) Answer the following: List one protocol that is commonly used for intra AS routing? List one protocol that is used for.
On Power-Law Relationships of the Internet Topology CSCI 780, Fall 2005.
Dynamics of Hot-Potato Routing in IP Networks Renata Teixeira (UC San Diego) with Aman Shaikh (AT&T), Tim Griffin(Intel),
Inherently Safe Backup Routing with BGP Lixin Gao (U. Mass Amherst) Timothy Griffin (AT&T Research) Jennifer Rexford (AT&T Research)
The Shapley Value: Its Use and Implications on Internet Economics Richard T.B. Ma Columbia University Dah-ming Chiu, John C.S. Lui The Chinese University.
IP Addressing & Interdomain Routing. Next Topic  IP Addressing  Hierarchy (prefixes, class A, B, C, subnets)  Interdomain routing Physical Data Link.
Economic Incentives in Internet Routing Jennifer Rexford Princeton University
Building a Strong Foundation for a Future Internet Jennifer Rexford ’91 Computer Science Department (and Electrical Engineering and the Center for IT Policy)
Scalable Construction of Resilient Overlays using Topology Information Mukund Seshadri Dr. Randy Katz.
Computer Networks Layering and Routing Dina Katabi
Inter-domain Routing Outline Border Gateway Protocol.
NOC Lessons Learned TEIN2 and CERNET Xing Li
© XchangePoint 2001 Economic Differences Between Transit and Peering Exchanges Keith Mitchell Chief Technical Officer NANOG 25 10th June 2002.
Network Sensitivity to Hot-Potato Disruptions Renata Teixeira (UC San Diego) with Aman Shaikh (AT&T), Tim Griffin(Intel),
1 Meeyoung Cha, Sue Moon, Chong-Dae Park Aman Shaikh Placing Relay Nodes for Intra-Domain Path Diversity To appear in IEEE INFOCOM 2006.
Internet Policy Day 1 - Workshop Session No. 2 Market structure Prepared for CTO by Link Centre, Witwatersrand University, South Africa.
Impact of Prefix Hijacking on Payments of Providers Pradeep Bangera and Sergey Gorinsky Institute IMDEA Networks, Madrid, Spain Developing the Science.
Introduction to BGP.
Rade Stanojevic Using Tuángòu to Reduce IP Transit Costs Rade Stanojevic (Joint work with Ignacio Castro and Sergey Gorinsky) ‍‍ ACM CoNext 2011 Tokyo,
How Secure are Secure Inter- Domain Routing Protocols? SIGCOMM 2010 Presenter: kcir.
Internet Emergency Response through Reconnection in Internet Exchange Points Chengchen Hu Tsinghua University Kai Chen, Rahul Potharaju, Yan Chen Northwestern.
On AS-Level Path Inference Jia Wang (AT&T Labs Research) Joint work with Z. Morley Mao (University of Michigan, Ann Arbor) Lili Qiu (University of Texas,
Jennifer Rexford Fall 2014 (TTh 3:00-4:20 in CS 105) COS 561: Advanced Computer Networks BGP.
TDTS21: Advanced Networking Lecture 7: Internet topology Based on slides from P. Gill and D. Choffnes Revised 2015 by N. Carlsson.
David Wetherall Professor of Computer Science & Engineering Introduction to Computer Networks Hierarchical Routing (§5.2.6)
Aemen Lodhi (Georgia Tech) Amogh Dhamdhere (CAIDA)
Load-Balancing Routing in Multichannel Hybrid Wireless Networks With Single Network Interface So, J.; Vaidya, N. H.; Vehicular Technology, IEEE Transactions.
A Measurement Study on the Impact of Routing Events on End-to-End Internet Path Performance Feng Wang 1, Zhuoqing Morley Mao 2 Jia Wang 3, Lixin Gao 1,
T. S. Eugene Ngeugeneng at cs.rice.edu Rice University1 COMP/ELEC 429/556 Introduction to Computer Networks Inter-domain routing Some slides used with.
A Light-Weight Distributed Scheme for Detecting IP Prefix Hijacks in Real-Time Lusheng Ji†, Joint work with Changxi Zheng‡, Dan Pei†, Jia Wang†, Paul Francis‡
2007/03/26OPLAB, NTUIM1 A Proactive Tree Recovery Mechanism for Resilient Overlay Network Networking, IEEE/ACM Transactions on Volume 15, Issue 1, Feb.
1 A Framework for Measuring and Predicting the Impact of Routing Changes Ying Zhang Z. Morley Mao Jia Wang.
1/21 Evaluating Potential Routing Diversity for Internet Failure Recovery *Chengchen Hu, + Kai Chen, + Yan Chen, *Bin Liu *Tsinghua University, + Northwestern.
Detecting Attacks on Internet Infrastructure and Monitoring of Service Restoration in Real Time Andy Ogielski FCC Workshop on Cyber Security 30 September.
Fast recovery in IP networks using Multiple Routing Configurations Amund Kvalbein Simula Research Laboratory.
CSE534- Fundamentals of Computer Networking Lecture 12-13: Internet Connectivity + IXPs (The Underbelly of the Internet) Based on slides by D. Choffnes.
4: Network Layer4b-1 OSPF (Open Shortest Path First) r “open”: publicly available r Uses Link State algorithm m LS packet dissemination m Topology map.
Spring 2000CS 4611 Routing Outline Algorithms Scalability.
© 2005 Cisco Systems, Inc. All rights reserved. BGP v3.2—3-1 Route Selection Using Policy Controls Using Multihomed BGP Networks.
A Measurement Study on the Impact of Routing Events on End-to-End Internet Path Performance Feng Wang 1, Zhuoqing Morley Mao 2 Jia Wang 3, Lixin Gao 1,
Introduction Computer networks: – definition – computer networks from the perspectives of users and designers – Evaluation criteria – Some concepts: –
1/18 Evaluating Potential Routing Diversity for Internet Failure Recovery *Chengchen Hu, + Kai Chen, + Yan Chen, *Bin Liu *Tsinghua University, + Northwestern.
Inferring AS Relationships. The Problem  One view  AS relationships  BGP route tables  The other view  BGP route tables  AS relationships  Available.
Inter-domain Routing Outline Border Gateway Protocol.
Internet Traffic Engineering Motivation: –The Fish problem, congested links. –Two properties of IP routing Destination based Local optimization TE: optimizing.
1 Internet Routing 11/11/2009. Admin. r Assignment 3 2.
Investigation of Traffic Dependencies between IXPs in Failure Scenarios APRICOT 2016, Peering Forum Auckland, New Zealand Arnold Nipper Chief.
CS 3700 Networks and Distributed Systems
P4P : Provider Portal for (P2P) Applications Haiyong Xie, Y
Jian Wu (University of Michigan)
COS 561: Advanced Computer Networks
ISP and Egress Path Selection for Multihomed Networks
The Internet: A System of Interconnected Autonomous Systems
COS 561: Advanced Computer Networks
Lessons Learned TEIN2 and CERNET
COMP/ELEC 429/556 Introduction to Computer Networks
COS 461: Computer Networks
BGP Instability Jennifer Rexford
Presentation transcript:

1/27 Evaluating Potential Routing Diversity for Internet Failure Recovery *Chengchen Hu, + Kai Chen, + Yan Chen, *Bin Liu *Tsinghua University, + Northwestern University

2/27 Internet Failures  Failure is part of everyday life in IP networks  e.g., 675,000 excavation accidents in 2004 [Common Ground Alliance]  Network cable cuts every few days …  Real-world emergencies or disasters can lead to substantial Internet disruption  Earthquakes  Storms  Terrorist incident: 9.11 event  …

3/27 Example: Taiwan earthquake incident  Large earthquakes hit south of Taiwan on 26 December 2006  Only two of nine cross-sea cables not affected  There were still abundant physical level connectivity there, but it took too long for ISPs to find them and use them. 3 figures cited from "Aftershocks from the Taiwan Earthquakes: Shaking up Internet transit in Asia, NANOG42"

4/27 How reliable the Internet is?  Internet is not as reliable as people expected! [Wu, CoNEXT’07]  32% ASes are vulnerable to a single critical customer- provider link cut  93.7% Tier-1 ISP’s single-homed customers are lost from the peered ISP due to Tier-1 depeering  Our question: can we find more resources to increase the Internet reliability especially when Internet emergency happens?

5/27 Roadmap  Background  Where are the potential resources?  How much potential resources are there?  How to use the potential resources?

6/27 Basic Idea  Two places where we can find more routing diversities:  Internet eXchange Points (IXPs)  Co-location where multiple ASes exchange their traffic  Participant ASes in an IXP may not be connected via BGP  Internet valley-free routing policy  AS relationships: customer-provider, peering, sibling  Peering relaxation (PR): allow one AS to carry traffic from the other to its provider  Mentioned in [Wu, CoNEXT’07], but no evaluation  Our main focus:  How much can we gain from these two potential resources, i.e., IXP and PR?

7/27 Roadmap  Background  Where are the potential resources?  How much help could provide?  How to use the potential resources?

8/27 Dataset for Evaluation  Most complete AS topology graph  BGP data  Route Views, RIPE/RIS, Abilene, CERNET BGP View  P2P traceroute  Traceroute data from 992, 000 IPs in over 3, 700 ASes  In total, 120K AS links with AS relationships  s.html [Chen et al, CoNEXT’09]  IXP data  PCH + Peeringdb + Euro-IX (~200 IXPs)  3468 participant ASes

9/27 Failure Models  Tier-1 depeering  Real example: Cogent and Level3 depeering  Tier-1 provider-customer link teardown  Reported in NANOG forum  Mixed types of link breakdown  9.11 event, Taiwan earthquakes, 2003 Northeast blackout

10/27 Evaluation Metrics  Recovery Ratio  # of recovered AS pairs versus total # of affected AS pairs  Path Diversity  # of increased link-disjoint AS paths between affected AS pairs  Shifted Path  # of link-disjoint AS paths shifted onto a normal link after we use IXP or PR resources More results please check our report "Evaluating Potential Routing Diversity for Internet Failure

11/27 Results: Tier-1 Depeering  36 experiments for 9 Tier-1 ASes  Recovery ratio: most of the lost AS pairs can be recovered

12/27 Results: Tier-1 Depeering  Path diversity: multiple AS paths between lost AS pairs

13/27 Results: Tier-1 Depeering  Shifted path  On average, 3.75 ~ 17.2 for all 36 experiments  Moderate traffic load shifted onto the unaffected links

14/27 Roadmap  Background  Where are the potential resources?  How much help could provide?  How to use the potential resources?

15/27 Economic model  B pays to A for recovery  Business model  Risk alliance (like airlines): price is determined beforehand  pay on bandwidth & duration or bits (95 percentile) A B peer A B P-C A B A B IXP

16/27 Communication channel  Search for peers  Have direct connections to peers  Search for co-located ASes in the same IXP  ASes are connected by switches in modern IXPs  Messages are broadcasted via switches  Message confidentiality through public key crypto

17/27 Automatic communications: query phase victim AS potential helper A potential helper D potential helper B potential helper C who can connect to specific destination ASes? query

18/27 Automatic communications: Check availability victim AS potential helper A potential helper D potential helper B potential helper C 1. Check connectivity (traceroute) 2. Check available bandwidth (IGI/Yaz/pathload/spruce)

19/27 Automatic communications: reply phase victim AS potential helper A potential helper D potential helper B potential helper C I can provide X bandwidth to it reply I can provide Y bandwidth to it Message confidentiality with public key crypto

20/27 Automatic communications: ACK phase victim AS potential helper A potential helper D potential helper B potential helper C I would like buy Z (<=Y) ACK

21/27 Automatic communications: new BGP session victim AS potential helper A potential helper D potential helper B potential helper C Set up BGP session Can be withdrawn later

22/27 Optimal selection of helper ISPs  From a single victim ISP perspective  Buy transit from a minimal number of ASes  Recover all the (prioritized) traffic  Least cost

23/27 Selection heuristic Lost connectivity to {Di}, with bandwidth demand {Bi} is how much bandwidth AS j could provide to Di;

24/27 Selection heuristic Lost connectivity to {Di}, with bandwidth demand {Bi} Score each (helper) AS j with Select the AS with largest score (select the one with lowest price if same score)

25/27 Selection heuristic Update Lost connectivity to {Di}, with bandwidth demand {Bi} updated

26/27 Selection heuristic rescore and select Lost connectivity to {Di}, with bandwidth demand {Bi}

27/27 Summary  Point out a new venue for Internet failure recovery.  Evaluate the potential routing diversity via IXP and PR with the most complete AS topology graph.  40%-80% of affected AS pairs can be recovered via IXP and PR with multiple paths and moderate shifted paths.  Possible and practical mechanisms to utilize potential routing diversity.  Look forward to feedback and collaborations from IXP/ISPs!