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

Route Aggregation and Supernetting

Graduate Depth 81 in the knowledge graph I know this Set as goal
4topics build on this
337prerequisites beneath it
See this on the map →
Subnetting and CIDR NotationBGP: Border Gateway Protocol
aggregation supernetting cidr routing-scalability

Core Idea

Route aggregation combines multiple routing table entries with consecutive CIDR blocks into a single entry with a shorter prefix, reducing routing table size. For example, 192.168.0.0/24 and 192.168.1.0/24 can be aggregated as 192.168.0.0/23. Aggregation is essential for scaling the Internet; without it, routing tables would contain billions of entries.

Explainer

From your work with subnetting and CIDR notation, you know that IP addresses are divided into a network prefix and a host portion, and that the prefix length determines the size of the address block. Subnetting splits a larger block into smaller ones by extending the prefix — moving the boundary rightward. Route aggregation (also called supernetting) is the reverse operation: it combines multiple smaller, contiguous blocks into a single larger block by shortening the prefix — moving the boundary leftward.

Consider a concrete example. An organization has been assigned four /24 networks: 10.1.0.0/24, 10.1.1.0/24, 10.1.2.0/24, and 10.1.3.0/24. Without aggregation, the upstream router must maintain four separate routing table entries. But look at the binary representations of the third octet: 00, 01, 10, 11. The first 22 bits of all four addresses are identical (10.1.0.0 through 10.1.3.255). So the upstream router can advertise a single route: 10.1.0.0/22. Any packet destined for any address in that range gets forwarded the same way. Four entries collapse into one.

The mathematical requirement is that aggregation only works cleanly when the blocks are contiguous and aligned. You cannot aggregate 10.1.1.0/24 and 10.1.3.0/24 into a single prefix because 10.1.2.0/24 sits between them — a shorter prefix covering both would also cover 10.1.0.0/24 and 10.1.2.0/24, potentially attracting traffic not meant for your network. This is why careful IP address planning matters: organizations that allocate addresses from contiguous CIDR blocks can aggregate cleanly, while fragmented allocations resist aggregation and bloat the global routing table.

The stakes are real. The global Internet routing table (carried by BGP between autonomous systems) currently holds over a million entries. Every router in the default-free zone must store and search this table for every packet. Without aggregation, the table would be orders of magnitude larger — one entry per individual network instead of one per aggregated block. ISPs perform aggregation hierarchically: customer routes are aggregated at the edge, regional routes are aggregated at the backbone, and the result is a routing table that remains manageable despite the Internet's explosive growth. The tradeoff is that overly aggressive aggregation can create routing black holes — if part of an aggregated block is actually unreachable, the aggregate route still attracts traffic to it, which then gets dropped. Operators must balance aggregation's scalability benefits against the precision of more specific routes.

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 AlgebraBoolean Algebra and Fundamental LawsLogic Gates FundamentalsImplementing Boolean Functions with GatesKarnaugh Map SimplificationCombinational Circuit DesignFlip-Flops and LatchesBinary Counters: Design and AnalysisBinary ArithmeticSubnetting and CIDR NotationRoute Aggregation and Supernetting

Longest path: 82 steps · 337 total prerequisite topics

Prerequisites (1)

Leads To (1)