Bounding Longest Match Considered
draft-grow-bounded-longest-match-00

Document Type Expired Internet-Draft (grow WG)
Last updated 2003-06-03
Stream IETF
Intended RFC status (None)
Formats
Expired & archived
plain text pdf html bibtex
Stream WG state WG Document
Document shepherd No shepherd assigned
IESG IESG state Expired
Consensus Boilerplate Unknown
Telechat date
Responsible AD (None)
Send notices to (None)

This Internet-Draft is no longer active. A copy of the expired Internet-Draft can be found at
https://www.ietf.org/archive/id/draft-grow-bounded-longest-match-00.txt

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

Russ White (riw@cisco.com)
Ted Hardie (ted.hardie@nominum.com)

(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)