nanog mailing list archives

Re: "routing table slots" and the real problem


From: "Mike O'Dell" <mo () UU NET>
Date: Sun, 02 Mar 1997 17:16:22 -0500


processors can't be relied upon to solve the problem.  
the computational cost grows faster than Moore's law

managing the complexity of the graph is the only alternative,
and generally the only way to manage tne complexity is through
aggregation.  at the moment, the only way to manage aggregation
is through address assignment.  whether we have other alternatives
over time is an open question.

        -mo
- - - - - - - - - - - - - - - - -


Current thread: