[7938] in North American Network Operators' Group
Re: "routing table slots" and the real problem
daemon@ATHENA.MIT.EDU (Mike O'Dell)
Sun Mar 2 17:21:40 1997
To: perry@piermont.com
cc: nanog@merit.edu, mo@UU.NET
In-reply-to: Your message of "Sun, 02 Mar 1997 13:39:33 EST."
<199703021839.NAA08043@jekyll.piermont.com>
Date: Sun, 02 Mar 1997 17:16:22 -0500
From: "Mike O'Dell" <mo@UU.NET>
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
