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:
- "routing table slots" and the real problem Mike O'Dell (Mar 02)
- Re: "routing table slots" and the real problem Perry E. Metzger (Mar 02)
- Re: "routing table slots" and the real problem Mike O'Dell (Mar 02)
- Re: "routing table slots" and the real problem Michael Dillon (Mar 02)
- Re: "routing table slots" and the real problem Mike O'Dell (Mar 02)
- <Possible follow-ups>
- Re: "routing table slots" and the real problem Paul Ferguson (Mar 02)
- Re: "routing table slots" and the real problem Scott Bradner (Mar 02)
- Re: "routing table slots" and the real problem Paul Ferguson (Mar 02)
- Re: "routing table slots" and the real problem Joseph T. Klein (Mar 02)
- Re: "routing table slots" and the real problem Mr. Dana Hudes (Mar 03)
- Re: "routing table slots" and the real problem Joseph T. Klein (Mar 02)
- Re: "routing table slots" and the real problem Paul Ferguson (Mar 02)
- Re: "routing table slots" and the real problem Vadim Antonov (Mar 02)
- Re: "routing table slots" and the real problem Mike O'Dell (Mar 02)
- Re: "routing table slots" and the real problem Vadim Antonov (Mar 02)
(Thread continues...)
- Re: "routing table slots" and the real problem Perry E. Metzger (Mar 02)
