We have accelerated FIB lookups (fib_find() and fib_route()) using a data structure named Bloom Filter when number of inserted nodes into FIB becomes huge, for example more than 200,000 IPs are inserted into one FIB. Consequently, the linked list chains becomes huge, the Bloom filter avoids traverse these long chains when an IP cannot be found.
The paper: http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=6999678 Please let me know your opinion about it. Or any suggestions ... Thanks in advance. -- Best wishes, Bahram BahramBeigy http://www.bahrambeigy.ir
