You're absolutely right. I dropped some decimal places. Thanks! However,
gateway addresses don't fit in a byte, they're stored in an unsigned long,
which is 4 bytes each. 4 * 16 million, right? And I think you need
counters and flags. So it's an array of structs of some modest size each.
But I see a complication: You will have to have n entries per route,
which will make loading the table a little less straightforward.
That will take time, so the update process probably has to be run in a
separate thread, and the current program isn't multithreaded. It'd be
somewhat of a development chore. Still, I like the idea.
- Brian
On Mon, May 01, 2017 at 07:43:37PM +0200, Rob Janssen wrote:
Interesting
concept. Someday if we have enough memory I may try it, but
right now amprgw (an old machine) has only 4 GB of memory. It'd die swapping.
128MB is only 3% of 4GB. What would be the problem reserving that for a lookup table?
Rob