Name: draft-hardie-bounded-longest-match-05
Title: Bounding Longest Match Considered
State: Pending
Authors: Russ White, Ted Hardie
Group: Individual Submissions (none)
Date: 2004-02-09
Some ASes currently use length-based filters to manage the size of the
routing table they use and propagate. This draft explores an alternative to
length-based filters which allows for more automatic configuration and
which provides for better redundancy. Rather than use a filter, this draft
proposes a method of modifying the BGP longest match algorithm by setting a
bound on the prefix lengths eligible for preference. A bound would operate
on long prefixes when covering route announcements are available; in
certain circumstances it would cause a router to prefer an aggregate over a
more specific route announcement.
[sh-index] Back to list of manuals
|
| |
