A prefix tree is a nonsequential collection of
permit and deny conditions that apply to IP addresses. Like a prefix
list, the prefix tree specifies a base IP address and a length, the
number of bits applied to the base to determine the network prefix.
The tested address is matched against the prefix. The prefix tree
also enables route summarization.
However, the prefix tree does not match addresses
one by one in sequence against the listed conditions. The router performs
a binary search against the tree structure of the entries. If the
tested address is less than a particular entry, it branches one way
to another test pair; if it is greater than the entry, it branches
the other way to another mutually exclusive test pair. The router
stops testing conditions when it finds the best match. If no conditions
match, the router rejects the address. An empty prefix tree results
in an automatic permit of the tested address.
The prefix tree provides a faster search method
and matches the test address more closely than either the access list
or the prefix list.
Use the ip prefix-tree command to define an IP prefix tree. Use the prefix-tree keyword with the match ip address or match ip next-hop commands to add a clause to a route
map. Use the match-set summary prefix-tree command to specify the prefix tree that summarizes routes for a
particular route map.
Using a Prefix Tree
The following example creates a prefix tree that
permits routes with a prefix length of 24 or larger in the 10.10.2.0/24
network:
Use to clear all hit counts in the prefix trees or the
specified entry from the specified prefix tree. (The router increments
the hit count by 1 each time an entry matches.)
Use to specify the prefix tree that summarizes routes
for a particular route map.
Use the ip prefix-tree command
to set the conditions of the prefix tree, including which routes to
summarize and how many bits of the network address to preserve.