[1229] in linux-net channel archive
Re: ip aliasing support ...
daemon@ATHENA.MIT.EDU (Stephen R. van den Berg)
Fri Oct 20 20:44:47 1995
From: srb@cuci.nl (Stephen R. van den Berg)
Date: Fri, 20 Oct 1995 20:11:44 +0100
In-Reply-To: Derek Atkins's message as of 1995 Oct 18 Wed 21:31.
<199510190131.VAA29111@toxicwaste.media.mit.edu>
To: linux-net@vger.rutgers.edu
Derek Atkins <warlord@mit.edu> wrote:
>> My single most fundamental objection was the linked list of addresses not an
>> array (which would be much much faster).
>Although an array is faster, it is static, which means you have a
>fundamenal resource limit. Perhaps a hash table pointing to linked
If changes to the array are insignificantly infrequent, then it is much
better to reallocate the array if it needs to be expanded. A routing
table or IP aliases are the perfect example of something that *doesn't* change
size more often than once every few seconds.
Contrary to how often lookups are being performed in this table. This is
being done for *every* packet that goes through the machine. If the table
starts approaching sizes like 7MB, then it had better be an array so that
binary searches are swift and painless (and so that it doesn't occupy more
memory due to pointers and such, which would likely increase the table
size by a significant amount).
--
Sincerely, srb@cuci.nl
Stephen R. van den Berg (AKA BuGless).
Confidence is that feeling you have before you understand the situation.
