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 Notation→→BGP: 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 Zero → The Number Zero → Counting to Five → Counting to 10 → Counting to 20 → Counting a Set of Objects Up to 20 → Cardinality: The Last Number Counted → Matching Numerals to Quantities → Subitizing Small Quantities → Addition Within 10 → Number Bonds to 10 → Addition Within 20 → Doubles and Near Doubles → Doubles Facts Within 10 → Near Doubles Facts Within 20 → Mental Math Strategies for Addition → Mental Math: Adding and Subtracting Tens → Addition Within 100 → Repeated Addition as Multiplication → Multiplication as Equal Groups → Multiplication: Arrays → Basic Multiplication Facts (0s, 1s, 2s, 5s, 10s) → Multiplication Facts Within 100 → Division as Equal Sharing → Division as Grouping (Measurement Division) → Division: Grouping (Repeated Subtraction) Model → Division: Fair Sharing Model → Division as Equal Sharing → Division as Grouping → Basic Division Facts → Division Facts Within 100 → Multiplication and Division Fact Families → Relationship Between Multiplication and Division → Division Facts as Inverse of Multiplication → Remainders and Quotients in Division → Division Word Problems → Multi-Step Word Problems → Solving Multi-Step Word Problems → Multiplication Word Problems → Division Word Problems → Introduction to Long Division → Factors and Multiples → Prime and Composite Numbers → Equivalent Fractions → Relating Fractions and Decimals → Decimal Place Value → Integers and the Number Line → Comparing and Ordering Integers → Absolute Value → Adding Integers → Subtracting Integers → Multiplying Integers → Introduction to Exponents → Order of Operations → Integer Order of Operations → Variable Expressions → The Distributive Property → Variables and Expressions Review → Introduction to Polynomials → Adding and Subtracting Polynomials → Multiplying Polynomials → Factorial → Permutations → Combinations → Counting Principles: Addition and Multiplication Rules → Introduction to Graph Theory → Propositional Logic Foundations → Logical Equivalences → Boolean Algebra → Boolean Type and Truth Values → Comparison Operators and Boolean Tests → Logical Operators and Boolean Algebra → Boolean Algebra and Fundamental Laws → Logic Gates Fundamentals → Implementing Boolean Functions with Gates → Karnaugh Map Simplification → Combinational Circuit Design → Flip-Flops and Latches → Binary Counters: Design and Analysis → Binary Arithmetic → Subnetting and CIDR Notation → Route Aggregation and Supernetting

Longest path: 82 steps · 337 total prerequisite topics

Prerequisites (1)

Leads To (1)