[8175] in North American Network Operators' Group

home help back first fref pref prev next nref lref last post

Re: consistent policy != consistent announcements

daemon@ATHENA.MIT.EDU (Randy Bush)
Fri Mar 14 11:27:01 1997

Date: Fri, 14 Mar 97 07:59 PST
From: randy@psg.com (Randy Bush)
To: Alan Barrett <apb@iafrica.com>
Cc: nanog@merit.edu

>                     M
>                   /   \
>                  A     B      * Peer link
>                  |     *      | Customer link
>                  RRRRRRR
>           Point1 *     * Point2
>                  VVVVVVV
> 
> I suppose that R should change their policy, so that all routes to M get
> treated as customer routes, even if non-customers appear in the path
> between R and M.

How is R supposed to recognize some likely disjoint set of of what A
announces to R as coming from M through B so as to recognize it as a
customer prefix?  Note that the paths from M to R through A and B can
be longer than depicted and that M's address space may not be taken
from R's, A's, or B's.

randy

home help back first fref pref prev next nref lref last post