Draft considering bounding longest match.

[hardie at equinix.com]

Hi,

Below is the abstract of draft-hardie-bounded-longest-match-00.txt,
now available from an I-D directory near you.  Essentially, it
presents an alternative to filtering which may have somewhat better
recovery and reachability characteristics.  Comments, criticism, and
discussion of unintended consequences welcome.
			regards,
				Ted





 Abstract

 This is a very drafty draft; so much so that the author isn't even
 sure what adjective should follow "considered" in the title.  It
 attempts to explore what would happen to the routing system if
 network engineers were able to modify 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.