[28200] in North American Network Operators' Group
Re: Peering Table Question
daemon@ATHENA.MIT.EDU (Randy Bush)
Wed Apr 19 20:31:20 2000
From: Randy Bush <randy@psg.com>
MIME-Version: 1.0
Content-Type: text/plain; charset=us-ascii
Content-Transfer-Encoding: 7bit
To: Larry Snyder <larrys@lexis-nexis.com>
Cc: nanog@nanog.org
Message-Id: <E12i4ps-0002mP-00@rip.psg.com>
Date: Wed, 19 Apr 2000 17:28:48 -0700
Errors-To: owner-nanog-outgoing@merit.edu
> A large file of baseline traceroutes could replace the benefits of
> disclosure, I suppose.
if it could, many of us would beg someone to do it RIGOROUSLY and publish.
a few problems:
o routing is not always symmetric, or i guess rarely is
o you would have to do it from'*many* distributed locations to many
distributed locations to see all the peering points through the potato
fog
o heck, due to bgp best path propagation, unless you are on a router with
which P is a peer, you can not really tell if C is a customer or peer
of P.
o and it still would not tell you who is paying whom when it is peering
randy
