good algorithm for this issue - Unix

This is a discussion on good algorithm for this issue - Unix ; 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 ...

+ Reply to Thread
Results 1 to 3 of 3

Thread: good algorithm for this issue

  1. good algorithm for this issue

    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

  2. Re: good algorithm for this issue

    >... each session
    >key is 96-bit and constructing from source and destination IPs, source
    >and destination ports.


    Hash.

    --
    mac the naf

  3. Re: good algorithm for this issue

    On May 6, 12:52 am, Alex Colvin wrote:
    > >... each session
    > >key is 96-bit and constructing from source and destination IPs, source
    > >and destination ports.

    >
    > Hash.
    >
    > --
    > mac the naf


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

    Thanks

+ Reply to Thread