[7924] in North American Network Operators' Group
Re: "routing table slots" and the real problem
daemon@ATHENA.MIT.EDU (Paul Ferguson)
Sun Mar 2 13:00:52 1997
Date: Sun, 02 Mar 1997 12:55:16 -0500
To: mo@UU.NET (Mike O'Dell)
From: Paul Ferguson <pferguso@cisco.com>
Cc: nanog@merit.edu
At 12:09 PM 3/2/97 -0500, Mike O'Dell wrote:
>
>The REAL problem is the growing complexity of the ROUTING COMPUTATION,
>not the size of the resulting forwarding table. even if routers
>had infinite memory, we would still be crushed by the routing
>computation if allowed to grow unchecked.
>
I have always subscribed to this fundamental concept; memory to
accommodate N number of routes has never been an operational
issue. As you have stated, it's the computational resources
required to calculate optimal paths when path information
changes. There is a linear relationship between the number of
paths & routes that must be parsed, and the amount of time it
takes to compute install the best one(s).
- paul
