[86204] in North American Network Operators' Group
Re: Scalability issues in the Internet routing system
daemon@ATHENA.MIT.EDU (Valdis.Kletnieks@vt.edu)
Wed Oct 26 12:13:17 2005
To: Alexei Roudnev <alex@relcom.net>
Cc: Lincoln Dale <ltd@interlink.com.au>, nanog@nanog.org,
Daniel Senie <dts@senie.com>
In-Reply-To: Your message of "Wed, 26 Oct 2005 08:53:50 PDT."
<00bd01c5da45$77fdd690$6401a8c0@alexh>
From: Valdis.Kletnieks@vt.edu
Date: Wed, 26 Oct 2005 12:12:44 -0400
Errors-To: owner-nanog@merit.edu
--==_Exmh_1130343163_12537P
Content-Type: text/plain; charset=us-ascii
On Wed, 26 Oct 2005 08:53:50 PDT, Alexei Roudnev said:
> Anyway, as I said - it is only small, minor engineering question - how to
> forward having 2,000,000 routes. If internet will require such router - it
> will be crearted easily. Today we eed 160,000 routes - and it works (line
> cards,m software, etc - it DO WORK).
Forwarding packets is only half the story. Building a routing table is
the other half.
Route flaps. Even if you have an algorithm that's O(n), 2M routes will take
12.5 times as long to crunch as 160K. If your routing protocol is O(n**2) on
number of routes, that's about 150 times as much.
Such a router is probably buildable. I'm not at all convinced that it's "easy"
to do so at a price point acceptable for most sites that currently have full
routing tables.
--==_Exmh_1130343163_12537P
Content-Type: application/pgp-signature
-----BEGIN PGP SIGNATURE-----
Version: GnuPG v1.4.2 (GNU/Linux)
Comment: Exmh version 2.5 07/13/2001
iD8DBQFDX6r7cC3lWbTT17ARApvXAJ4+V/JT8GzZCv/o1zIE0dSlGEx6oACg50qi
4U9JV7aCzmKVbjyRFhK9WJA=
=UnNj
-----END PGP SIGNATURE-----
--==_Exmh_1130343163_12537P--
