Proactive Wireless Networks With OpenBSD
Author: Reyk Floeter

unhashed
I replaced hashed tables in net80211 and hostapd Discussed with deraadt@, mcbride@ and claudio@ Replaced them with red-black trees for node tables The benefits Tree lookups are fast with many nodes in the table Ensures unique entries in the node table Is a countermeasure against possible hash collisions Easy to implement with tree(3) macros Available in OpenBSD 3.9 which fixes some problems with many nodes The disadvantages Slightly more (generated) code in the tree Other semantics in the net80211 scan algorithm
| "Proactive Wireless Networks With OpenBSD", BSDCan 2006, Ottawa, Canada, 2006-05-13 Reyk Floeter (reyk@vantronix.net) .vantronix | secure systems GmbH (http://www.vantronix.net/) |