R-BGP: Staying Connected in a Connected World Nate Kushman Srikanth Kandula, Dina Katabi, and Bruce Maggs.

Slides:



Advertisements
Similar presentations
Multihoming and Multi-path Routing
Advertisements

Part IV: BGP Routing Instability. March 8, BGP routing updates  Route updates at prefix level  No activity in “steady state”  Routing messages.
Network Layer: Internet-Wide Routing & BGP Dina Katabi & Sam Madden.
Path Vector Routing NETE0514 Presented by Dr.Apichan Kanjanavapastit.
© J. Liebeherr, All rights reserved 1 Border Gateway Protocol This lecture is largely based on a BGP tutorial by T. Griffin from AT&T Research.
Fundamentals of Computer Networks ECE 478/578 Lecture #18: Policy-Based Routing Instructor: Loukas Lazos Dept of Electrical and Computer Engineering University.
DSN 2003 A Study of Packet Delivery Performance during Routing Convergence Dan Pei, Lan Wang, Lixia Zhang, UCLA Dan Massey, USC/ISI S. Felix Wu, UC Davis.
Consensus Routing: The Internet as a Distributed System John P. John, Ethan Katz-Bassett, Arvind Krishnamurthy, and Thomas Anderson Presented.
1 Interdomain Routing Protocols. 2 Autonomous Systems An autonomous system (AS) is a region of the Internet that is administered by a single entity and.
Towards a Logic for Wide-Area Internet Routing Nick Feamster and Hari Balakrishnan M.I.T. Computer Science and Artificial Intelligence Laboratory Kunal.
Transient BGP Loops Do they matter, and what can be done about them? Nate Kushman MIT/Akamai Srikanth Kandula, Dina Katabi and John Wroclawski.
Inferring Autonomous System Relationships in the Internet Lixin Gao.
An Energy Efficient Hierarchical Heterogeneous Wireless Sensor Network
HLP: A Next Generation Interdomain Routing Protocol Lakshminarayanan Subramanian* Matthew Caesar* Cheng Tien Ee*, Mark Handley° Morley Maoª, Scott Shenker*
1 Tutorial 5 Safe “Peering Backup” Routing With BGP Based on:
Tutorial 5 Safe Routing With BGP Based on: Internet.
1 An Experimental Analysis of BGP Convergence Time Timothy Griffin AT&T Research & Brian Premore Dartmouth College.
Internet Networking Spring 2004 Tutorial 5 Safe “Peering Backup” Routing With BGP.
Delayed Internet Routing Convergence Craig Labovitz, Abha Ahuja, Abhijit Bose, Farham Jahanian Presented By Harpal Singh Bassali.
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)
Stable Internet Routing Without Global Coordination Jennifer Rexford AT&T Labs--Research
Stable Internet Routing Without Global Coordination Jennifer Rexford AT&T Labs--Research Joint work with Lixin Gao.
Interdomain Routing and the Border Gateway Protocol (BGP) Reading: Section COS 461: Computer Networks Spring 2011 Mike Freedman
Scalable Construction of Resilient Overlays using Topology Information Mukund Seshadri Dr. Randy Katz.
Computer Networks Layering and Routing Dina Katabi
EQ-BGP: an efficient inter- domain QoS routing protocol Andrzej Bęben Institute of Telecommunications Warsaw University of Technology,
Network Sensitivity to Hot-Potato Disruptions Renata Teixeira (UC San Diego) with Aman Shaikh (AT&T), Tim Griffin(Intel),
Constructing Inter-Domain Packet Filters to Control IP Spoofing Based on BGP Updates Zhenhai Duan, Xin Yuan Department of Computer Science Florida State.
1 Computer Communication & Networks Lecture 22 Network Layer: Delivery, Forwarding, Routing (contd.)
Information-Centric Networks04a-1 Week 4 / Paper 1 Open issues in Interdomain Routing: a survey –Marcelo Yannuzzi, Xavier Masip-Bruin, Olivier Bonaventure.
9/15/2015CS622 - MIRO Presentation1 Wen Xu and Jennifer Rexford Department of Computer Science Princeton University Chuck Short CS622 Dr. C. Edward Chow.
CS 3700 Networks and Distributed Systems Inter Domain Routing (It’s all about the Money) Revised 8/20/15.
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,
Reducing Transient Disconnectivity using Anomaly-Cognizant Forwarding Andrey Ermolinskiy, Scott Shenker University of California – Berkeley and ICSI.
Jennifer Rexford Fall 2014 (TTh 3:00-4:20 in CS 105) COS 561: Advanced Computer Networks BGP.
More on Internet Routing A large portion of this lecture material comes from BGP tutorial given by Philip Smith from Cisco (ftp://ftp- eng.cisco.com/pfs/seminars/APRICOT2004.
BGP topics to be discussed in the next few weeks: –Excessive route update –Routing instability –BGP policy issues –BGP route slow convergence problem –Interaction.
Routing Convergence Dan Massey Colorado State University.
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.
On Understanding of Transient Interdomain Routing Failures Feng Wang, Lixin Gao, Jia Wang, and Jian Qiu Department of Electrical and Computer Engineering.
Network Layer4-1 Intra-AS Routing r Also known as Interior Gateway Protocols (IGP) r Most common Intra-AS routing protocols: m RIP: Routing Information.
SIGCOMM 2012 (August 16, 2012) Private and Verifiable Interdomain Routing Decisions Mingchen Zhao * Wenchao Zhou * Alexander Gurney * Andreas Haeberlen.
Eliminating Packet Loss Caused by BGP Convergence Nate Kushman Srikanth Kandula, Dina Katabi, and Bruce Maggs.
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.
7/11/0666th IETF1 QoS Enhancements to BGP in Support of Multiple Classes of Service Andreas Terzis Computer Science Department Johns Hopkins University.
© 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,
Border Gateway Protocol (BGP) (Bruce Maggs and Nick Feamster)
Traffic-aware Inter-Domain Routing for Improved Internet Routing Stability Zhenhai Duan Florida State University 1.
Constructing Inter-Domain Packet Filters to Control IP Spoofing Based on BGP Updates Zhenhai Duan, Xin Yuan Department of Computer Science Florida State.
CSci5221: Inter-Domain Routing Convergence Issues and Improvements 1 Inter-Domain Routing Convergence Issues, Impacts and Improvements Inter-Domain Routing.
1 Internet Routing 11/11/2009. Admin. r Assignment 3 2.
CS 3700 Networks and Distributed Systems
CS 3700 Networks and Distributed Systems
Border Gateway Protocol
COMP 3270 Computer Networks
COS 561: Advanced Computer Networks
Department of Computer and IT Engineering University of Kurdistan
COS 561: Advanced Computer Networks
CS 3700 Networks and Distributed Systems
COS 561: Advanced Computer Networks
COS 561: Advanced Computer Networks
CS 3700 Networks and Distributed Systems
COS 561: Advanced Computer Networks
COMP/ELEC 429/556 Introduction to Computer Networks
COS 461: Computer Networks
Transient BGP Loops Do they matter, and what can be done about them?
BGP Instability Jennifer Rexford
Presentation transcript:

R-BGP: Staying Connected in a Connected World Nate Kushman Srikanth Kandula, Dina Katabi, and Bruce Maggs

BGP Convergence Causes Packet Loss When a route changes, up to 30% packet loss for more than 2 minutes [Labovitz00] Even domains dual homed to tier 1 providers see many loss bursts on a route change [Wang06] Even popular prefixes experience losses due to BGP convergence [Wang05] 50% of VoIP disruptions are highly correlated with BGP updates [Kushman06] The Problem:

Goal: Ensure ASes stay connected as long as the physical network is connected Links, Links Everywhere But Not a Path to Forward!

We Focus on Forwarding Don’t worry about BGP’s routing Ensure forwarding works by forwarding packets on pre-computed failover paths

Why Focus on Forwarding? Convergence is unlikely to be fast enough Strict timing constraints limit innovation

No BGP caused packet loss Guarantee: Our Contribution Just like BGP, each AS advertises at most one path to each neighbor Low Overhead: On link failure, we reduce disconnected ASes from 22% to Zero

What Causes Transient Disconnection?  Nobody offers Hari an alternate path MIT AT&T Pete r Hari Sprint All of Hari’s providers use him to get to MIT BGP Rule: An AS advertises only its current forwarding path

What Causes Transient Disconnection? Pete r Hari MIT AT&T Sprint Link Down Hari knows no path to MIT Hari drops Peter and AT&T’s packets in addition to his own X LOSS!

What Causes Transient Disconnection? MIT AT&T Hari Sprint Hari withdraws path Pete r AT&T and Peter move to alternate paths X

MIT AT&T Hari Sprint AT&T announces the Sprint path to Hari  Traffic flows Transient Packet Loss Pete r Hari withdraws path What Causes Transient Disconnection? AT&T and Peter move to alternate paths X

An AS advertises only its current path. It advertises an alternate only after a link fails BGP: Advertises an alternate, i.e. failover path, before a link fails R-BGP: How do failover paths solve the problem?

AT&T advertises to Hari “AT&T  Sprint  MIT” as a failover path Link Fails  Hari immediately sends traffic on failover path MIT AT&T Pete r Hari Sprint No Loss ! Failover Paths X

Two Challenges Challenge 1: Challenge 2: Minimize the number of failover paths, while ensuring an AS always has a usable path Transition from usable path to converged path without creating forwarding loops

Challenge 1: Minimize number of failover paths Claim: Just like BGP, advertise one path per neighbor, either current or failover AT&T Hari Sprint Pete r Current path Failover Path MI T Insight: Replace path advertised to downstream AS with a failover path

Lemma: Advertising Most Disjoint is equivalent to advertising all paths. Dest AT&T John Bob x Joe Which failover path should it advertise? Most Disjoint Path

When a link fails: Theorem 1: The AS upstream of down link knows a failover path if it will know a path at convergence When a link fails: Theorem 1: The AS upstream of down link knows a failover path if it will know a path at convergence Advertise to downstream AS as a failover path the path most disjoint from the current path R-BGP Rule: Challenge 1: Minimize number of failover paths

MIT AT&T Hari Sprint Hari withdraws path Pete r Challenge 2: Transition without loops X

AT&T may choose to route through Peter Peter may choose to route through AT&T Forwarding Loop! MIT AT&T Hari Sprint Pete r Challenge 2: Transition without loops LOOP! X Hari withdraws path

Hari includes Root Cause Information with the withdrawal It routes through Sprint instead Solution 2: Root Cause Information MIT AT&T Hari Sprint Pete r Hari->MIT Link down Theorem 2 : No forwarding loops will form Theorem 2 : No forwarding loops will form Challenge 2: Transition without loops AT&T recognizes the Peter->Hari->MIT path is down X

R-BGP Solution 1:Advertise most disjoint path to downstream AS Solution 2: Include Root Cause Information Final Theorem: No AS will see BGP caused packet loss if it will have a path at convergence Final Theorem: No AS will see BGP caused packet loss if it will have a path at convergence

Experimental Results

Setup AS-Level Simulation over the full Internet AS-graph with 24,142 ASes from Routeviews BGP Data Use inference algorithm to annotate links with customer-provider or peer relationships

Dual-homed AS loses one link Find percentage of ASs that see transient disconnection to the destination Run for all dual homed ASes Single Link Failure Results Destination X

Single Link Failure Results Percentage of ASes transiently disconnected 22% - BGP Zero - R-BGP R-BGP Eliminates all Transient Disconnection

Most disjoint path may not be compliant with BGP routing policies Still an AS may want to advertise it: o To protect its own traffic o Because it is temporary What if we choose most-disjoint among policy compliant paths? Cost of Policy Compliance

Percentage of ASes transiently disconnected 22% - BGP Zero - R-BGP

Policy compliant failover paths may be sufficient Cost of Policy Compliance Percentage of ASes transiently disconnected 22% - BGP Zero - R-BGP 1.4% - R-BGP: policy compliant

All proofs are for single link failure Randomly choose a second link Multiple Link Failure Results Destination X

Multiple link failures are unlikely to interact Percentage of ASes transiently disconnected 22% - BGP 0% - R-BGP 1.4% - R-BGP: policy compliant Multiple Link Failure Results

Fail link on current path Fail link on corresponding failover path Worst Case Scenario Destination Hari X X

Multiple Link Failure Results Percentage of ASes transiently disconnected 33% - BGP

Multiple Link Failure Results Percentage of ASes transiently disconnected 33% - BGP 12% - R-BGP: policy compliant

Eliminates 80% of disconnection even in the worst case of link failures on both current and failover Worst case Scenario Percentage of ASes transiently disconnected 33% - BGP 7% - R-BGP 12% - R-BGP: policy compliant

Conclusion BGP loses connectivity even when the physical network is connected R-BGP uses a few failover paths to ensure forwarding works throughout convergence o Guarantees no packet loss o Just like BGP, one path per neighbor o Reduces disconnected ASes from 22% to zero Working with Cisco on prototype feasibility

The End