Prev: forming a link in a tree
Next: "make clean" recuresively into sub-directories.
From: Noor on 5 May 2008 11:32
Hi All,

I want to develope a firewall program that maintain tcp session
table,each entry identify the the state of the session, each session
key is 96-bit and constructing from source and destination IPs, source
and destination ports. my issue is which algorithm is practical, and
has fast lookup,insert and delete? is radix-tree or Btree? can u
please suggst me good one?

Regards
From: Alex Colvin on 5 May 2008 17:52
>... each session
>key is 96-bit and constructing from source and destination IPs, source
>and destination ports.

Hash.

--
mac the na�f
From: Noor on 6 May 2008 12:40
On May 6, 12:52 am, Alex Colvin <al...(a)TheWorld.com> wrote:
> >... each session
> >key is 96-bit and constructing from source and destination IPs, source
> >and destination ports.
>
> Hash.
>
> --
> mac the naïf

so you think the Hash is good, mmm i will think.

Thanks
 | 
Pages: 1
Prev: forming a link in a tree
Next: "make clean" recuresively into sub-directories.