Re: DataStructure for Storing SPD,SA Entries

["Hilarie Orman" <HORMAN@volera.com>]

If the SPD's are non-interfering, the hash table is fine.  I'd guess that
these are the normal case for most configurations, but it's just a guess.

Hilarie

 >>> "Steven M. Bellovin" <smb@research.att.com> 10/15/01 04:52AM >>>
In message <PM.18490.1003122646@pmweb8.uk1.bibliotech.net>, "Amey Gokhale" writ
es:
 >hello,
 >
 >from the analysis of various data structures (linked list, balanced BST, unbal
 >anced BST, hash table, skip lists) for their search / insert / delete time, ha
 >sh 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
 >.
 >

Remember that unless you have first expanded the entries, you have to 
search the SPD in the order originally specified.  I don't know how to 
do that with a hash table.

		--Steve Bellovin, http://www.research.att.com/~smb 
		Full text of "Firewalls" book now at http://www.wilyhacker.com

---

• Prev by Date: RE: how Nonce payload be used to prevent replay attack
• Next by Date: Re: DataStructure for Storing SPD,SA Entries
• Prev by thread: Re: DataStructure for Storing SPD,SA Entries
• Next by thread: Re: DataStructure for Storing SPD,SA Entries
• Index(es):
  • Main
  • Thread