[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

Re: DataStructure for Storing SPD,SA Entries

To: ipsec@lists.tislabs.com
Subject: Re: DataStructure for Storing SPD,SA Entries
From: "Amey Gokhale" <agokhale@postmaster.co.uk>
Date: Mon, 15 Oct 2001 06:10:46 +0100
Sender: owner-ipsec@lists.tislabs.com

hello,

from the analysis of various data structures (linked list, balanced BST, unbalanced BST, hash table, skip lists) for their search / insert / delete time, hash table is found best.
also it;s avg. search time is O(1) for any number of entries in it(ordered or random)....provided selected hash function ensures unique distribution of keys.

i havn;t explored tries data structure. if anybody knows some understandable link on it, plz tell. 

Regards,
Amey.

Prev by Date: Re: Implicit/Explicit IV
Next by Date: Re: DataStructure for Storing SPD,SA Entries
Prev by thread: DataStructure for Storing SPD,SA Entries
Next by thread: Re: DataStructure for Storing SPD,SA Entries
Index(es):
- Main
- Thread