The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Hash tables are fundamental components of several network processing algorithms and applications, including route lookup, intrusion detection, viruses, worms and other malicious code detection and filtering. Collisions exist in common hash tables, which can critically affect the worst-case throughput of an application, since the number of memory accesses required for each lookup can vary. A non-collision...
Bloom filter is a fast and simple structure for string matching, but it allows false positives. Longest prefix matching bloom filters (LPM) with counter and extended fast hash table can eliminate false positives at the expense of double memory and none wire-speed. Faster searching speed can be achieved with parallel LPMs (PLPM), using more memory. We present an algorithm named memory efficient parallel...
IP lookup is widely performed in many network applications, including route lookup, packet classification and network monitoring. Hashing scheme is an important technology for it and can gain O(1) average memory access per lookup. But collisions exist in common hash scheme, which need multiple memory accesses, affecting the worst-case throughput critically. A perfect-hashing scheme was proposed. By...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.