[85890] in North American Network Operators' Group
Re: Scalability issues in the Internet routing system
daemon@ATHENA.MIT.EDU (Tony Li)
Tue Oct 18 16:49:44 2005
In-Reply-To: <4355152A.80607@nrg4u.com>
Cc: nanog@nanog.org
From: Tony Li <tony.li@tony.li>
Date: Tue, 18 Oct 2005 13:45:35 -0700
To: Andre Oppermann <nanog-list@nrg4u.com>
Errors-To: owner-nanog@merit.edu
Andre,
> capacity = prefix * path * churnfactor / second
>
> capacity = prefixes * packets / second
> I think it is safe, even with projected AS and IP uptake, to assume
> Moore's law can cope with this.
>
> This one is much harder to cope with as the number of prefixes and
> the link speeds are rising. Thus the problem is multiplicative to
> quadratic.
You'll note that the number of prefixes is key to both of your
equations. If the number of prefixes exceeds Moore's law, then it
will be very difficult to get either of your equations to remain
under Moore's law on the left hand side.
That's the whole point of the discussion.
Tony
