RE: hard questions: request routing

["Cain, Brad" <bcain@cereva.com>]

> -----Original Message-----
> From: Dmitri Krioukov [mailto:dima@krioukov.net]
> Sent: Saturday, March 31, 2001 11:02 PM
> To: Oliver Spatscheck
> Cc: cdn@ops.ietf.org
> Subject: RE: hard questions: request routing
> 
> 
> I'd like to add that the path vector protocols are the worst known
> ones from the loop prevention and convergence standpoints (cf.
> "Delayed Internet Routing Convergence" by Craig Labovitz
> et al., for example).

yes... but link state will never fly in inter-provider because
of the desire to keep policies (and interconnects) opaque to
peers

an alternative would be to add a diffusion update to path
vector (ala eigrp)... this probably wouldn't fly in bgp because
of the depth but may work in overlays we expect depth to
be shallow (e.g. nearly full mesh)

> On the hand, why can't something related to delay be a good
> candidate?

because one metric isn't enough

-brad