RE: hard questions: request routing

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

> -----Original Message-----
> From: Dmitri Krioukov [mailto:dima@krioukov.net]
> Sent: Thursday, March 29, 2001 9:03 PM
> To: Cain, Brad
> Cc: cdn@ops.ietf.org
> Subject: RE: hard questions: request routing
> 
> 
> I still think that the easiest way to
> attack p.2 is a very straightforward hard
> choice -- everyone agrees on the single
> metric whose primary purpose is proper
> inter-CDN request routing with loop
> avoidance -- 

it is the easiest but i highly doubt we will get
consensus... if we were to go that way, i'd
propose two metrics to be evaluated in this
order:
	1. simple path vector (ala bgp)
	2. 64 bit "generic" metric

#2 would have to be generic because there is no way
to get people to agree on something that is measurable
(i.e. delay)

as for #1, it is sensible for basic loop preventation (plus
operators are used to opaque policies and wouldn't go for
a new paradigm like link state)


-brad