NameFilter: Achieving fast name lookup with low memory cost via applying two-stage Bloom filters

Proceedings - IEEE INFOCOM

Volumn , Issue , 2013, Pages 95-99

  Wang, Yi ^a   Pan, Tian ^a   Mi, Zhian ^a   Dai, Huichen ^a   Guo, Xiaoyu ^a   Zhang, Ting ^a   Liu, Bin ^a   Dong, Qunfeng ^b  

^a TSINGHUA UNIVERSITY   (China)

^b UNIVERSITY OF SCIENCE AND TECHNOLOGY OF CHINA   (China)

Author keywords

[No Author keywords available]

Indexed keywords

BLOOM FILTERS; EVALUATION RESULTS; FILTER-BASED; INCREMENTAL UPDATES; MEMORY ACCESS; MEMORY SAVINGS; NAMED DATA NETWORKINGS; TRIE STRUCTURES;

OPTIMIZATION; SCALABILITY; TABLE LOOKUP;

DATA STRUCTURES;

EID: 84883072082     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFCOM.2013.6566742     Document Type: Conference Paper

References (13)

1. V. Jacobson, D. K. Smetters, J. D. Thornton, M. Plass, N. Briggs, and R. Braynard, "Networking Named Content," in Proc. of ACM CoNEXT, 2009.
2. L. Zhang, D. Estrin, V. Jacobson, and B. Zhang, "Named Data Networking (NDN) project," in Technical Report, NDN-0001, 2010.
3. B. H. Bloom, "Space/time trade-offs in hash coding with allowable errors," Communications of the ACM, vol. 13, no. 7, pp. 422-426, July 1970.
4. E. Fredkin, "Trie memory," Commun. ACM, vol. 3, no. 9, pp. 490-499, Sep. 1960.
5. S. Dharmapurikar, P. Krishnamurthy, and D. E. Taylor, "Longest Prefix Matching using Bloom Filters," in Proceedings of ACM SIMCOMM'03, 2003.
6. D. E. Knuth, The Art of Computer Programming, volume 1/Fundamental Algorithms. Addison-Wesley, 1968.
7. Y. Qiao, T. Li, and S. Chen, "One memory access bloom filters and their generalization," in INFOCOM, 2011 Proceedings IEEE. IEEE, 2011, pp. 1745-1753.
8. D. J. Bernstein, "DJB hash." [Online]. Available: http://www.partow.net/programming/hashfunctions/#DJBHashFunction
9. Y. Wang, K. He, H. Dai, W. Meng, J. Jiang, B. Liu, and Y. Chen, "Scalable name lookup in NDN using effective name component encoding," in Proceedings of IEEE ICDCS, 2012.
10. "The OpenMP API specification for parallel programming." [Online]. Available: http://openmp.org/wp/
11. Z. Prodanoff and K. Christensen, "Managing routing tables for url routers in content distribution networks," International Journal of Network Management, vol. 14, no. 3, pp. 177-192, 2004.
12. L. Xiao-Ming and F. Wang-Sen, "Two Effective Functions on Hashing URL [j]," Journal of Software, vol. 2, 2004.
13. M. Yu, A. Fabrikant, and J. Rexford, "BUFFALO: Bloom filter forwarding architecture for large organizations," in Proc. of ACM CoNEXT. ACM, 2009, pp. 313-324.