Scalability issues in the Internet routing system

Tony Li tony.li at tony.li
Tue Oct 18 20:45:35 UTC 2005




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




More information about the NANOG mailing list