[52563] in North American Network Operators' Group
Re: UUNET Routing issues
daemon@ATHENA.MIT.EDU (Petri Helenius)
Fri Oct 4 17:09:31 2002
From: "Petri Helenius" <pete@he.iki.fi>
To: <Valdis.Kletnieks@vt.edu>
Cc: <nanog@merit.edu>
Date: Sat, 5 Oct 2002 00:08:50 +0300
Errors-To: owner-nanog-outgoing@merit.edu
>OK. I'll bite - is it feasible if you're a caspian engineer? ;)
Obviously, as most of the audience knows, it´s a function of the speed you want
to achieve, the number of flows you expect to be interested in and what you want
to do with the flows. Getting traffic split up in a few million flows and
maintaining
the flow cache and associated state and doing lookups in the the cache is not
too
hard. Doing anything more clever than switching packets (like scheduling which
one
goes next) across a large dataset has been unachievable challenge so far.
(at least at price points people want to pay)
It would have to be an earlier hour to walk trough if a design which would
combine
flow classification and CAM based scheduling would cut it, but I´m afraid of the
aliasing
contention killing the actual thing you´re trying to achieve. (service
quarantees)
Pete
