[70864] in North American Network Operators' Group
Re: Open Source BGP Route Optimization?
daemon@ATHENA.MIT.EDU (Paul Jakma)
Sat May 29 07:19:41 2004
Date: Sat, 29 May 2004 12:18:34 +0100 (IST)
From: Paul Jakma <paul@clubi.ie>
To: Bruce Pinsky <bep@whack.org>
Cc: Per Gregers Bilse <bilse@networksignature.com>,
Sam Stickland <sam_ml@spacething.org>, nanog@merit.edu
In-Reply-To: <40B7948A.9000600@whack.org>
Errors-To: owner-nanog-outgoing@merit.edu
On Fri, 28 May 2004, Bruce Pinsky wrote:
> But the "optimizing" device wouldn't be advertising multiple paths.
> It would be advertising its selected path from all viable paths
> based on the selection criteria/policy implemented by the user.
> The optimizing device can then keep track of what it has advertised
> and withdraw as appropriate/necessary.
But how do the edge routers, which are passing on all their paths,
pass on withdraws? The edge routers would have resend all routes
after a withdraw (which current implementations do not do,
obviously).
Also, the optimising device would not be BGP compliant, an update of
a route is an implicit withdraw, so the optimising device could not
know, if given additional UPDATE messages for additional prefixes,
whether the edge device still had the previous route or not.
Essentially, it's impossible to do right with BGP at the moment. If
it is possible, I'd love to hear how having previously tried to
implement this (and failed).
regards,
--
Paul Jakma paul@clubi.ie paul@jakma.org Key ID: 64A2FF6A
warning: do not ever send email to spam@dishone.st
Fortune:
If you wish to succeed, consult three old people.
