[25431] in North American Network Operators' Group
Re: BGP and memory
daemon@ATHENA.MIT.EDU (Phillip Vandry)
Wed Oct 13 11:44:33 1999
Date: Wed, 13 Oct 1999 11:31:18 -0400 (EDT)
From: Phillip Vandry <vandry@Mlink.NET>
Message-Id: <199910131531.LAA16274@Iodine.Mlink.NET>
To: "Alex P. Rudnev" <alex@virgin.relcom.eu.net>
Cc: nanog@merit.edu
MIME-Version: 1.0
Content-Type: TEXT/PLAIN; charset=US-ASCII
In-reply-to: Your message of "Wed, 13 Oct 1999 18:22:30 EDT."
<Pine.SUN.4.10.9910131818200.547-100000@virgin.relcom.eu.net>
Errors-To: owner-nanog-outgoing@merit.edu
I think you are forgetting that these routes need to be stored in a data
structure that allows fast queries as well as fast inserts and deletes.
That index takes space, and your "sh ip bgp" doesn't show you that.
Yeah, let's store the routing table in a linked list!
-Phil
> No, if someone want to implement the core BGP in the 8 MB ram, he can do
> it as well (through the cost of his work + cost of debug should be much
> greater than the cost of 128RAM memory -:)).
>
> Aleksei Roudnev, Network Operations Center, Relcom, Moscow
> (+7 095) 194-19-95 (Network Operations Center Hot Line),(+7 095) 230-41-41, N 1
> 3729 (pager)
> (+7 095) 196-72-12 (Support), (+7 095) 194-33-28 (Fax)
>
>
