A topic in the Open Knowledge Graph — a free, open map of 15,290 topics and the order to learn them in.

Routing Convergence, Flapping, and Damping

Graduate Depth 101 in the knowledge graph I know this Set as goal
623prerequisites beneath it
See this on the map →
BGP: Border Gateway ProtocolRouting Algorithms and Protocols+1 more
routing bgp stability flap-damping

Core Idea

Routing flapping occurs when a route is advertised as up and down repeatedly due to link instability, causing routing churn and traffic loss. BGP flap damping penalizes unstable routes by suppressing them temporarily when they exceed a flap threshold. Proper configuration of dampening parameters balances stability (penalizing flaps) against availability (suppressing stable routes).

How It's Best Learned

Simulate link flapping in a lab by rapidly toggling interfaces. Observe routing table updates and packet loss. Configure BGP dampening and observe suppression behavior. Monitor flap statistics using show ip bgp flap-statistics.

Common Misconceptions

Flap damping does not prevent flaps; it hides them after a threshold. Over-aggressive dampening can suppress legitimate route changes. Flap damping should not be applied to eBGP routes learned from direct neighbors; it is most useful for route aggregates.

Explainer

From your study of routing algorithms and BGP, you know that routers exchange reachability information and update their forwarding tables when the network topology changes. Routing convergence is the process by which all routers in the network agree on a consistent view of the topology after a change. During convergence, some routers have stale information while others have already updated, causing packets to be dropped, looped, or black-holed. The faster a network converges, the shorter this window of instability — but convergence speed depends on how quickly change notifications propagate and how many routers must recalculate their tables.

Route flapping is what happens when a route alternates rapidly between available and unavailable — typically because a physical link is unstable (a damaged cable, an overheating interface, or an intermittent connection). Each time the route goes down, the router withdraws it from its BGP neighbors. Each time it comes back, the router re-advertises it. These updates ripple outward through the internet's BGP mesh. A single flapping link in one autonomous system can generate thousands of update messages across hundreds of routers worldwide, each one triggering a table recalculation. This is called routing churn, and at scale it can consume so much CPU on core routers that it destabilizes routes that have nothing to do with the flapping link.

Flap damping is BGP's defense mechanism. Each route is assigned a penalty score that increases every time the route flaps. When the penalty exceeds a suppress threshold, the route is suppressed — the router stops advertising it to its neighbors, effectively hiding the instability. The penalty decays exponentially over time with a configurable half-life (typically 15 minutes). Once the penalty drops below a reuse threshold, the route is unsuppressed and advertised again. The key insight is that a route that flaps once or twice will never accumulate enough penalty to be suppressed, but a route that flaps repeatedly will be quickly silenced until it stabilizes.

The art of configuring flap damping lies in balancing stability against reachability. If thresholds are too aggressive, even legitimate route changes (like a planned maintenance event) can trigger suppression, making destinations unreachable for minutes longer than necessary. If thresholds are too lenient, flapping routes continue to generate churn. Modern best practice, informed by RFC 7196, recommends using flap damping conservatively — primarily on aggregate routes rather than specific prefixes, and with half-lives and thresholds tuned to the network's tolerance for convergence delay. Many operators have disabled flap damping entirely for directly connected eBGP peers, preferring fast convergence over churn reduction at the edge.

Practice Questions 5 questions

Prerequisite Chain

Understanding ZeroThe Number ZeroCounting to FiveCounting to 10Counting to 20Counting a Set of Objects Up to 20Cardinality: The Last Number CountedMatching Numerals to QuantitiesSubitizing Small QuantitiesAddition Within 10Number Bonds to 10Addition Within 20Doubles and Near DoublesDoubles Facts Within 10Near Doubles Facts Within 20Mental Math Strategies for AdditionMental Math: Adding and Subtracting TensAddition Within 100Repeated Addition as MultiplicationMultiplication as Equal GroupsMultiplication: ArraysBasic Multiplication Facts (0s, 1s, 2s, 5s, 10s)Multiplication Facts Within 100Division as Equal SharingDivision as Grouping (Measurement Division)Division: Grouping (Repeated Subtraction) ModelDivision: Fair Sharing ModelDivision as Equal SharingDivision as GroupingBasic Division FactsDivision Facts Within 100Multiplication and Division Fact FamiliesRelationship Between Multiplication and DivisionDivision Facts as Inverse of MultiplicationRemainders and Quotients in DivisionDivision Word ProblemsMulti-Step Word ProblemsSolving Multi-Step Word ProblemsMultiplication Word ProblemsDivision Word ProblemsIntroduction to Long DivisionFactors and MultiplesPrime and Composite NumbersEquivalent FractionsRelating Fractions and DecimalsDecimal Place ValueIntegers and the Number LineComparing and Ordering IntegersAbsolute ValueAdding IntegersSubtracting IntegersMultiplying IntegersIntroduction to ExponentsOrder of OperationsInteger Order of OperationsVariable ExpressionsThe Distributive PropertyVariables and Expressions ReviewIntroduction to PolynomialsAdding and Subtracting PolynomialsMultiplying PolynomialsFactorialPermutationsCombinationsCounting Principles: Addition and Multiplication RulesIntroduction to Graph TheoryPropositional Logic FoundationsLogical EquivalencesBoolean AlgebraBoolean Type and Truth ValuesComparison Operators and Boolean TestsLogical Operators and Boolean AlgebraConditional StatementsDefining and Calling FunctionsFunctions: Decomposing ProblemsFunction Parameters and Argument PassingReturn ValuesVariable ScopeIntroduction to ClassesObjects and InstancesMethods and AttributesAlgorithm Design BasicsTree Structure and Node PropertiesBinary TreesTree TraversalsDepth-First Search (DFS)Depth-First Search: Implementation and ApplicationsTopological SortDynamic ProgrammingLongest Common Subsequence (LCS) ProblemEdit Distance: Levenshtein Distance and DP0/1 Knapsack Problem: Bounded Capacity DPGreedy AlgorithmsActivity Selection Problem Using Greedy AlgorithmsDijkstra's AlgorithmFloyd-Warshall Algorithm for All-Pairs Shortest PathsBellman-Ford AlgorithmBellman-Ford Algorithm and Distance-Vector RoutingDistance-Vector Routing ProtocolsBGP: Border Gateway ProtocolBGP Route Filtering and Hijacking PreventionRouting Convergence, Flapping, and Damping

Longest path: 102 steps · 623 total prerequisite topics

Prerequisites (3)

Leads To (0)

No topics depend on this one yet.