Bounding Longest Match Considered
draft-hardie-bounded-longest-match-05
| Document | Type |
Replaced Internet-Draft
(individual in gen area)
Expired & archived
|
|
|---|---|---|---|
| Authors | Russ White , Ted Hardie | ||
| Last updated | 2015-10-14 (Latest revision 2004-02-09) | ||
| Replaced by | draft-white-bounded-longest-match | ||
| RFC stream | Internet Engineering Task Force (IETF) | ||
| Intended RFC status | Informational | ||
| Formats | |||
| Stream | WG state | (None) | |
| Document shepherd | (None) | ||
| IESG | IESG state | Replaced by draft-white-bounded-longest-match | |
| Action Holders |
(None)
|
||
| Consensus boilerplate | Unknown | ||
| Telechat date | (None) | ||
| Responsible AD | Alex D. Zinin | ||
| Send notices to | Ted.Hardie@nominum.com |
This Internet-Draft is no longer active. A copy of the expired Internet-Draft is available in these formats:
Abstract
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.
Authors
(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)