Skip to main content

Bounding Longer Routes to Remove TE
draft-white-bounded-longest-match-02

Document Type Expired Internet-Draft (individual)
Expired & archived
Author Susan Hares
Last updated 2008-07-31
Replaces draft-hardie-bounded-longest-match
RFC stream (None)
Intended RFC status (None)
Formats
Stream Stream state (No stream defined)
Consensus boilerplate Unknown
RFC Editor Note (None)
IESG IESG state Expired
Telechat date (None)
Responsible AD (None)
Send notices to (None)

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 [RFC1771] 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

Susan Hares

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