Re: High Speed Firewalls

["Johann G. Hautzinger" <trema () eic at>]

woody weaver wrote:
> A couple of points:
>
> 1.  (obligatory mathematical note from an ex math professor) The
> rainwall actually scales sublinearly.  Each machine (tries to) talk to
> every other machine, and there are election rules and etc.  That sort of
> overhead increases as the square of the number of firewalls, and so at
> some point, the complexity of that computation would start getting
> significant. (end obligatory math note)
as an ex pupil of a math professor i doubt this ... if there were two
firewalls each one would have to talk to the other (=2x1), if there were
three, this would be 6 (=3x2x1) ... with n firewalls this would be
nx(n-1)x(n-2)...x1 or n! in short. looks to me as if this was faculty,
no?

*greetz* from vienna

Hannes

-- 
Johann Georg Hautzinger,  email: trema () eic at,  Tel.: 531 00 1907
Erste Bank AG - OE 0423 - Orga./Entw. Treasury u. Orga.Wertpapier
Boersegasse 14, 1010 Wien            http://treasury.erstebank.at