Routing Convergence and the Impact of Scale Dan Massey Colorado State University.

Slides:



Advertisements
Similar presentations
Karlston D'Emanuele Distance Vector Routing Protocols Notes courtesy of Mr. Joe Cordina Password Removed
Advertisements

Delayed Internet Routing Convergence due to Flap Dampening Z. Morley Mao Ramesh Govindan, Randy Katz, George Varghese
Internet Routing (COS 598A) Today: Interdomain Routing Convergence Jennifer Rexford Tuesdays/Thursdays.
Part IV: BGP Routing Instability. March 8, BGP routing updates  Route updates at prefix level  No activity in “steady state”  Routing messages.
Advanced Networks 1. Delayed Internet Routing Convergence 2. The Impact of Internet Policy and Topology on Delayed Routing Convergence.
BGP Convergence Jennifer Rexford. Outline Border Gateway Protocol (BGP) –Prefix-based routing at the AS level –Policy-based path-vector protocol –Incremental.
Network Layer: Internet-Wide Routing & BGP Dina Katabi & Sam Madden.
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.
1 Measurement of Highly Active Prefixes in BGP Ricardo V. Oliveira, Rafit Izhak-Ratzin, Beichuan Zhang, Lixia Zhang GLOBECOM’05.
Dynamic routing Routing Algorithm (Dijkstra / Bellman-Ford) – idealization –All routers are identical –Network is flat. Not true in Practice Hierarchical.
1 An Experimental Analysis of BGP Convergence Time Timothy Griffin AT&T Research & Brian Premore Dartmouth College.
Chapter 4 Distance Vector Problems, and Link-State Routing Professor Rick Han University of Colorado at Boulder
Improving BGP Convergence Through Consistency Assertions Dan Pei, Lan Wang, Lixia Zhang UCLA Xiaoliang Zhao, Daniel Massey, Allison Mankin, USC/ISI S.
Chapter 4 IP Routing Professor Rick Han University of Colorado at Boulder
Interdomain Routing and the Border Gateway Protocol (BGP) Reading: Section COS 461: Computer Networks Spring 2011 Mike Freedman
Fundamentals of Networking Discovery 2, Chapter 6 Routing.
Computer Networks Layering and Routing Dina Katabi
Delivery, Forwarding and
Distance Vector Routing Protocols Distance Vector Routing.
Chapter 22 Network Layer: Delivery, Forwarding, and Routing
Introduction to Routing and Routing Protocols By Ashar Anwar.
6: Routing Working at a Small to Medium Business.
Distance Vector Routing Protocols W.lilakiatsakun.
1 Computer Communication & Networks Lecture 22 Network Layer: Delivery, Forwarding, Routing (contd.)
Slide /2009COMM3380 Routing Algorithms Distance Vector Routing Each node knows the distance (=cost) to its directly connected neighbors A node sends.
Unicast Routing Protocols  A routing protocol is a combination of rules and procedures that lets routers in the internet inform each other of changes.
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.
Routing -2 Dynamic Routing
Understanding and Limiting BGP Instabilities Zhi-Li Zhang Jaideep Chandrashekar Kuai Xu
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.
On Understanding of Transient Interdomain Routing Failures Feng Wang, Lixin Gao, Jia Wang, and Jian Qiu Department of Electrical and Computer Engineering.
1 Quantifying Path Exploration in the Internet Ricardo Oliveira, Rafit Izhak-Ratzin, Lixia Zhang, UCLA Beichuan Zhang, UArizona Dan Pei, AT&T Labs -- Research.
TCOM 509 – Internet Protocols (TCP/IP) Lecture 06_a Routing Protocols: RIP, OSPF, BGP Instructor: Dr. Li-Chuan Chen Date: 10/06/2003 Based in part upon.
Detecting Selective Dropping Attacks in BGP Mooi Chuah Kun Huang November 2006.
1 Computer Communication & Networks Lecture 21 Network Layer: Delivery, Forwarding, Routing Waleed.
Routing Networks and Protocols Prepared by: TGK First Prepared on: Last Modified on: Quality checked by: Copyright 2009 Asia Pacific Institute of Information.
Eliminating Packet Loss Caused by BGP Convergence Nate Kushman Srikanth Kandula, Dina Katabi, and Bruce Maggs.
Interior Gateway Protocols (RIP, OSPF) continued….
An internet is a combination of networks connected by routers. When a datagram goes from a source to a destination, it will probably pass through many.
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.
Routing Protocols COSC 541 Data Commun. System & Networks Yue Dou.
Improving Fault Tolerance in AODV Matthew J. Miller Jungmin So.
1 Internet Routing: BGP Routing Convergence Jennifer Rexford Princeton University
Cisco 3 - Switch Perrine. J Page 17/3/2016 Chapter 3 Which of the following are found in the EIGRP neighbor table? (Choose two.) 1.routes installed by.
Dynamic routing Routing Algorithm (Dijkstra / Bellman-Ford) – idealization All routers are identical Network is flat. Not true in Practice Hierarchical.
CS 5565 Network Architecture and Protocols
Evolution Towards Global Routing Scalability
Dynamic routing Routing Algorithm (Dijkstra / Bellman-Ford) – idealization All routers are identical Network is flat. Not true in Practice Hierarchical.
COS 561: Advanced Computer Networks
IP Multicast Fast Reroute follow-up on draft-dimitri-rtgwg-mfrr-framework-00 RTG Working Group IETF 75 meeting Stockholm (Sweden) July 2009.
Intra-Domain Routing Jacob Strauss September 14, 2006.
Routing: Distance Vector Algorithm
Dynamic routing Routing Algorithm (Dijkstra / Bellman-Ford) – idealization All routers are identical Network is flat. Not true in Practice Hierarchical.
A stability-oriented approach to improving BGP convergence
Department of Computer and IT Engineering University of Kurdistan
COS 561: Advanced Computer Networks
RFC 1058 & RFC 2453 Routing Information Protocol
COS 561: Advanced Computer Networks
COS 561: Advanced Computer Networks
COS 561: Advanced Computer Networks
COS 561: Advanced Computer Networks
Communication Networks
BGP Interactions Jennifer Rexford
COS 461: Computer Networks
Communication Networks
BGP Instability Jennifer Rexford
Computer Networks Protocols
Dynamic routing Routing Algorithm (Dijkstra / Bellman-Ford) – idealization All routers are identical Network is flat. Not true in Practice Hierarchical.
Presentation transcript:

Routing Convergence and the Impact of Scale Dan Massey Colorado State University

26 October Internet Routing and BGP l Internet divided into Autonomous Systems n Large-scale implies maintaining entire topology at a router is not feasible. l BGP is the inter-AS routing protocol. n Router stores the AS path to a destination. n Path allows router to apply policies l How quickly does BGP converge after a change? n Can BGP continue to scale with more growth? n Do we need BGP changes or a new protocol?

26 October (B A) (C B A) (E D B A) (H G F E A) BGP Path Exploration H BZ D A E C dest. IG Obsolete paths: (C B A), (E D B A) If Z knew [B A] failed, it couldve avoided the obsolete paths Zs Candidate paths: () (C B A) (E D B A) (I H G F A) () (E D B A) (I H G F A) () (I H G F A) F ( )

26 October Path Exploration and Policy l Internet does not select the shortest path n Policies limit the number of potential paths. n Especially at high level tiers. l Example: Due to routing policy, AS-X (lower tier) sees more alternate paths than AS-Z (tier-1). n Via multiple providers n Via peers Z X P2 Y W P1

26 October Impact of Topology Growth l Denser connectivity => more alternate paths l Impact depends on policies and tier n Lower tier nodes see more slow convergence MRAI off MRAI on Jan 2, 2004Dec 2, 2004 Beacon prefix /24 RV peer ( AS# )#updates#paths#updates#paths 1239 (tier1) (tier1)

26 October Convergence Improvements l MRAI Timer (Deployed Now) n Require minimum time between updates n Typically 30 seconds l Assertion Checking (Proposed in INFOCOM 02) n Signal policy or topological failure in some cases n Discard routes that include failed subpath l Ghost Flushing (Proposed in INFOCOM 03) n When the MRAI timer delays an update, send a withdrawal l Attach Failure Notification (INFOCOM05, CompNet05) n Explicitly list the cause of the failure

26 October MRAI Rate-Limiting Timer Minimum Route Advertisement Interval (MRAI) timer: Within M=30 seconds, at most one announcement from A to B P1P1 P2P2 P P P As path changes: Msgs from A to B: P1P1 time=0time=30 time=60 P4P4 P b. delay convergence a. suppress transient changes Impact:

26 October MRAI and Ghost Flushing MRAI prevents removal of stale information Suppose P1 to P5 are increasingly worse Neighbor believes P1 still available until time 30 P1P1 P2P2 P P P As path changes: Msgs from A to B: P1P1 time=0time=30 time=60 P4P4 P w Ghost Flushing: if change to longer path and MRAI applies, send a withdraw w

26 October Root Cause Notification l The node who detects the failure attaches root cause to msg l Other nodes copy the root cause to outgoing messages (B A) (C B A) (E D B A) (H G F E A) H BZ D A E C IG Zs Candidate paths: F () ( C B A ) ( E D B A ) (I H G F A) ( ), [B A] failure the first msg is enough for Z to remove all the obsolete paths

26 October Ghost Flushing Assertion BGP Root Cause Notification Fail-down Simulation Results Fail-down: destination becomes unreachable

26 October Ghost Flushing Assertion BGP Root Cause Notification Implication: more redundancy means faster T long convergence Fail-over Simulation Results Fail-over: nodes switch to worse paths

26 October Conclusions? (Not Yet!) l Root Cause Approach is Clear Winner n But several non-trivial deployment problems n Not immediately clear we could standardize it. l Ghost-Flushing Does Well in Fail-down n Easily incrementally deployed n But may not work well in Fail-over l MRAI Timer Only n Leaves us with current convergence problems n And the network is getting larger…. n And other complications in large systems….

26 October Damping Analysis simulation calculation no damping Convergence Updates Trigger Damping Policies! (could fix if we damped the RCN rather than just updates)

26 October But What About Packets? Improving packet delivery is the ultimate goal Ghost Flushing Assertion BGP Root Cause Notification

26 October Conclusions l Root Cause Approach Adds Many Benefits n Convergence, dampening, packet delivery, diagnosis,…. l New Routing Designs Should Include RCN n Should be a required part of new routing protocols l Can RCN Be Added to BGP? n Not clear given existing complications n To be continued in IRTF Routing Research Group –Encourage interested researchers to join