1 |
M. A. Ruiz-Sanchez, E. M. Biersack and W. Dabbous, "Survey and taxonomy of IP address lookup algorithms," IEEE Networks, vol. 15, no. 2, pp. 8-23, March/April 2001.
|
2 |
H. Lim and N. Lee, "Survey and proposal on binary search algorithms for longest prefix match," IEEE Communications Surverys and Tutorials, vol. 14, no. 3, pp. 681-697, Third Quarters, 2012.
|
3 |
S. Tarkoma, C. E. Rothenberg, and E. Lagerspetz, "Theory and Practice of Bloom Filters for Distributed Systems," IEEE Communications Surveys and Tutorials, vol. 14, no. 1, pp. 131-155, First Quarter, 2012.
DOI
ScienceOn
|
4 |
S. Dharmapurikar, P. Krishnamurthy, and D. Taylor, "Longest prefix matching using Bloom filters," IEEE/ACM Trans. Networking, vol.14, no.2, pp.397-409, Feb. 2006.
DOI
|
5 |
H. Lim, K. Lim, N. Lee, and K. Park, "On Adding Bloom Filters to Longest Prefix Matching Algorithms," IEEE Trans. Computers, vol. 63, no. 2, pp. 411-423, Feb. 2014.
DOI
ScienceOn
|
6 |
M. Waldvogel, G. Varghese, J. Turner, and B. Plattner, "Scalable high speed IP routing lookups", in Proc. of ACM SIGCOMM, 1997, pp.25-35.
|
7 |
J. H. Mun, H. Lim and C. Yim, "Binary search on prefix lengths for IP address lookup," IEEE Communications Letters, vol.10, no.6, pp.492-494, June 2006.
DOI
ScienceOn
|
8 |
http://www.potaroo.net
|
9 |
J. H. Mun and H. Lim, "On Reducing False Positives of a Bloom Filter in Trie-Based Algorithms," in Proc. Of ACM ANCS, Oct. 2014.
|