What supernetting and route summarization mean
Supernetting or route summarization represents several more-specific prefixes with one shorter aggregate prefix. The goal is not to merge Layer 2 networks. It is to reduce the amount of routing information that must be carried and processed when the addressing plan is sufficiently hierarchical.
For example, four aligned /24 networks may sometimes be represented by one /22. Routers outside the summarized domain can then carry one route instead of four while more-specific detail remains inside.
Subnetting versus supernetting
Subnetting starts with a parent prefix and divides it into smaller, more-specific child prefixes. Supernetting works in the opposite direction: it asks whether several child prefixes share enough leading bits to be represented by a shorter parent-like aggregate.
Both operations are based on CIDR and binary prefix boundaries. Learning one makes the other much easier.
Find the common binary prefix
The mathematically correct summary is determined by the longest sequence of leading bits shared by all addresses that must be represented. Where the binary values first differ, the common prefix ends.
This is why summarization is not simply “subtract one from the prefix length.” The component networks must also occupy a properly aligned contiguous range.
Power-of-two grouping and alignment
An exact aggregate normally combines a power-of-two number of equal-size adjacent prefixes and begins on the correct boundary for the shorter aggregate. Two /24s can form a /23 only when they are the two halves of the same aligned /23. Four aligned /24s can form a /22.
The same logic applies to IPv6, although the much larger address space makes hexadecimal boundary reasoning especially useful.
Exact summaries versus covering summaries
An exact summary covers only the component prefixes you intend to represent. A covering summary may also include unused or unreachable address space. Covering summaries can still be operationally useful, but they require care because upstream routers may send traffic for those additional addresses toward the summarizing device.
The design must therefore decide whether the broader reachability claim is safe.
Summaries coexist with more-specific routes
Longest Prefix Match allows a broad aggregate to coexist with exceptions. If a router knows 10.20.0.0/16 and also 10.20.30.0/24, traffic for 10.20.30.10 uses the /24 while other destinations in the /16 can follow the aggregate.
This property is fundamental to hierarchical routing: detail can be preserved only where it is required.
Why a discard route often accompanies a summary
A router that advertises a broad summary should be prepared to receive traffic for any address covered by that summary, including unused space. A local discard or null route for the aggregate can prevent such traffic from following a default route and looping back toward the network.
More-specific connected or learned routes still win over the discard because they have longer prefix lengths.
Worked example: summarizing four /24 networks into a /22
Consider 192.0.0.0/24, 192.0.1.0/24, 192.0.2.0/24, and 192.0.3.0/24. They are contiguous, equal in size, and aligned on the boundary of 192.0.0.0/22. The /22 covers 192.0.0.0 through 192.0.3.255 exactly, so it is a valid aggregate for all four networks.
If the set instead included 192.0.1.0/24 through 192.0.4.0/24, the same simple /22 aggregate would not represent the set exactly because the range crosses summary boundaries.
VLSM and address-plan design
Good VLSM planning leaves related networks contiguous so they can be summarized later. If subnets belonging to one site are scattered throughout the global address space, aggregation becomes difficult or impossible.
Summarization is therefore not just a routing trick. It starts during address planning.
Summarization with OSPF
Hierarchical routing protocols can support summarization at selected boundaries. In OSPF, inter-area and external-route summarization depend on router role and implementation. The operational objective is to hide unnecessary detail while preserving correct reachability.
Do not summarize simply to reduce a route count if the resulting aggregate hides failure information that the rest of the network needs.
CIDR and aggregation on the Internet
Classless Inter-Domain Routing made prefix aggregation possible at Internet scale. Providers can advertise aggregated address blocks instead of every customer subnet separately when allocation and topology allow it.
More-specific announcements can still appear for traffic-engineering, policy, multihoming, or operational reasons. Aggregation reduces information, but policy may deliberately reintroduce detail.
Common summarization mistakes
- Combining prefixes that are not contiguous.
- Ignoring alignment boundaries.
- Assuming every group of two networks can be shortened by one bit.
- Advertising a covering summary without handling unreachable space.
- Summarizing across a failure boundary that should remain visible.
- Forgetting that more-specific routes still override the summary.
A practical method using the lowest and highest addresses
For a set of routes, identify the lowest network address and the highest address that must be covered. Convert them to binary and find the common leading bits. That shared prefix gives the shortest covering summary.
Then ask a second question: is that covering summary exact, or does it include extra address space? The binary calculation tells you what can cover the range; network design decides whether the extra coverage is acceptable.
Precision versus compression
More-specific routes provide precise reachability information but consume more control-plane and forwarding resources. Summaries reduce route count and can limit the visibility of internal topology changes, but they also hide detail.
The right design balances scale, fault isolation, troubleshooting, convergence behavior, and policy. The smallest routing table is not automatically the best routing table.
Closing the core routing cluster
At this point you should be able to read a routing table, configure static routes conceptually, understand how OSPF learns paths, recognize NAT/PAT at an edge, and design CIDR summaries. The next step is policy-oriented and large-scale routing with BGP, followed by first-hop redundancy and VRF-based segmentation.