Some of the SNMP tables can get large (like route table), and the existing table storage implementation has linear search on insert. Has anyone done an alternative that uses something smarter (tree, hash, b-tree)?
This would fix a number of issues when using net-snmp with a router with a full BGP feed (200K+ routes). The existing code is N^2 and is therefore useless. The container class seems to be built nicely for such usage, but I don't see anything smarter. Maybe binary-array? ------------------------------------------------------------------------------ The Planet: dedicated and managed hosting, cloud storage, colocation Stay online with enterprise data centers and the best network in the business Choose flexible plans and management services without long-term contracts Personal 24x7 support from experience hosting pros just a phone call away. http://p.sf.net/sfu/theplanet-com _______________________________________________ Net-snmp-coders mailing list [email protected] https://lists.sourceforge.net/lists/listinfo/net-snmp-coders
