@techreport{grow-bounded-longest-match-00,
    number =    {draft-grow-bounded-longest-match-00},
    type =      {Internet-Draft},
    institution =   {Internet Engineering Task Force},
    publisher = {Internet Engineering Task Force},
    note =      {Work in Progress},
    url =       {https://datatracker.ietf.org/doc/draft-grow-bounded-longest-match/00/},
    author =    {Russ White and Ted Hardie},
    title =     {{Bounding Longest Match Considered}},
    pagetotal = 8,
    year =      2003,
    month =     jun,
    day =       3,
    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.},
}