Re[2]: Avoiding natd overhead
- From: Anton Yuzhaninov <citrin@xxxxxxxxx>
- Date: Sun, 22 Oct 2006 02:52:47 +0400
Saturday, October 21, 2006, 6:42:15 PM, Eugene Grosbein wrote:
1. libalias allocate memory for create each new entry in NAT table.
libalias use linear search in linked list to find entry in table.
It very slow when you have thousands simultaneous connections via
nat
EG> In RELENG_4 libalias uses hash table, not linear search.
EG> Are you sure it switched to linear search? And why?
Yes, I was mistaken. libalis use lookup tables linkTableOut and linkTableIn
--
WBR, Anton Yuzhaninov
- References:
- Avoiding natd overhead
- From: Brett Glass
- Re: Avoiding natd overhead
- From: Matthew D. Fuller
- Re[2]: Avoiding natd overhead
- From: Anton Yuzhaninov
- Re: Avoiding natd overhead
- From: Eugene Grosbein
- Avoiding natd overhead
- Prev by Date: Re: Avoiding natd overhead
- Next by Date: Re: more on pfil and bridging
- Previous by thread: Re: Avoiding natd overhead
- Next by thread: Re: Avoiding natd overhead
- Index(es):