Efficient name matching based on a fast two-dimensional filter in named data networking

References

• Vasilakos A , Li Z , Simon G , et al . Information centric network: research challenges and opportunities. J Network Comput Appl. 2015;52:1–10.
   Google Scholar
• Jacobson V , Smetters DK , Thornton JD , et al . Networking named content. ACM CoNEXT 2009. Rome, Italy; Dec 2009.
   Google Scholar
• Zhang L , Estrin D , Burke J , et al. Named data networking (NDN) project. Technical Report NDN-0001, Palo Alto Research Center (PARC), Oct 2010.
   Google Scholar
• Li F , Chen F , Wu J , et al . Longest prefix lookup in named data networking: how fast can it be? 9th IEEE International Conference on Networking, Architecture, and Storage (NAS). Tianjin, China: IEEE; 2014. p. 186–190.
   Google Scholar
• Quan W , Xu C , Guan J , et al . Scalable name lookup with adaptive prefix bloom filter for named data networking. IEEE Commun Lett. 2014;18(1):102–105.
   Google Scholar
• Huang S , Xu J , Yang X , et al . Steerable name lookup based on classified prefixes and scalable one memory access bloom filter for named data networking. Int J Future Gener Commun Netw. 2016;9(7):87–100.
   Google Scholar
• Won W , Narayanan A , Oran D . Named data networking on a router: fast and dos-resistant forwarding with hash tables. Proceedings of the 9th ACM/IEEE Symposium on Architectures for Networking and Communications Systems. San Jose, CA; 2013. p. 215–226.
   Google Scholar
• Li Z , Liu K , Zhao Y , et al . MaPIT: an enhanced pending interest table for NDN with mapping bloom filter. IEEE Commun Lett. 2014;18(11):1915–1918.
   Google Scholar
• Zhang L , Afanasyev A , Burke J , et al . Named data networking. ACM SIGCOMM Comput Commun Rev. 2014;44(3):66–73.
   Google Scholar
• Wang Y , Dai H , Zhang T , et al . GPU-accelerated name lookup with component encoding. Comput Netw. 2013;57(16):3165–3177.
   Google Scholar
• Cheng Y , Afanasyev A , Wang L , et al. Adaptive forwarding in named data networking. ACM SIGCOMM Comput Commun Rev. 2012;42(3):62–67.
   Google Scholar
• Wang Y , He K , Dai H , et al. Scalable name lookup in NDN using effective name component encoding. 2012 IEEE 32nd International Conference on Distributed Computing Systems (ICDCS). Macau, China; 2012; p. 688–697.
   Google Scholar
• Wang Y , Pan T , Mi Z , et al. NameFilter: achieving fast name lookup with low memory cost via applying two-stage Bloom filters. 2013 Proceedings IEEE INFOCOM. Turin, Italy: IEEE; 2013, p. 95–99.
   Google Scholar
• So W , Narayanan A , Oran D , et al. Named data networking on a router: forwarding at 20gbps and beyond. ACM SIGCOMM Comput Commun Rev. 2013; 43(4):495–496. ACM, 2013.
   Google Scholar
• Wang Y , Tai D , Zhang T , et al. Greedy name lookup for named data networking. ACM SIGMETRICS Perform Eval Rev. 2013;41(1):359–360. ACM, 2013.
   Google Scholar
• Wang Y , Xu B , Tai D . Fast name lookup for named data networking. 2014 IEEE 22nd International Symposium of Quality of Service (IWQoS). Hong Kong, China: IEEE; 2014. p. 198–207.
   Google Scholar
• Song T , Yuan H , Crowley P , et al. Scalable name-based packet forwarding: from millions to billions. Proceedings of the 2nd International Conference on Information-Centric Networking. San Francisco (CA): ACM; 2015. p. 19–28.
   Google Scholar
• Lee J , Shim M , Lim H . Name prefix matching using Bloom filter pre-searching for content centric network. J Netw Comput Appl. 2016;65:36–47.
   Google Scholar
• Saxena D , Raychoudhury V , Becker C , et al . Reliable memory efficient name forwarding in named data networking. EUC. 2016.
   Google Scholar
• Saxena D , Raychoudhury V . N-FIB: Scalable, memory efficient name-based forwarding. J Netw Comput Appl. 2016;76:101–109.
   Google Scholar
• Yuan H . Data structures and algorithms for scalable ndn forwarding [PhD diss], Washington University in St. Louis, 2015.
   Google Scholar
• Popa L , Ghodsi A , Stoica I . HTTP as the narrow waist of the future Internet. Proceedings of the 9th ACM SIGCOMM Workshop on Hot Topics in Networks. New York (NY): ACM; 2010. p. 6.
   Google Scholar
• Saxena D , Raychoudhury V , Suri N , et al . Named data networking: a survey. Comput Sci Rev. 2016;19:15–55.
   Google Scholar
• Xylomenos G , Ververidis C , Siris V , et al . A survey of information-centric networking research. IEEE Commun Surv Tutorial. 2014;16(2):1024–1049.
   Google Scholar
• Bouk S , Hassan S . Ahmed, and D. Kim, Hierarchical and hash based naming with Compact Trie name management scheme for vehicular content centric networks, Comput Commun. 2015;71:73–83.
   Google Scholar
• Tan Y , Zhu S . Efficient name lookup scheme based on hash and character trie in named data networking. 2015 12th Web Information System and Application Conference (WISA). Jinan, China: IEEE; 2015. p. 130–135.
   Google Scholar
• Luo J , Wu C , Jiang Y , et al . Name label switching paradigm for named data networking. IEEE Commun Lett. 2015;19(3):335–338.
   Google Scholar
• Bloom B . Space/time trade-offs in hash coding with allowable errors. Commun ACM. 1970;13(7):422–426.
   Google Scholar
• Broder A , Mitzenmacher M . Network applications of Bloom filters: a survey Internet Math. 2004;1(4):485–509.
   Google Scholar
• Bonelli N , Callegari C , Giordano S , et al. A bloom filter bank based hash table for high speed packet processing. 2014 IEEE International Conference on High Performance Computing and Communications, 2014 IEEE 6th International Symposium on Cyberspace Safety and Security, 2014 IEEE 11th International Conference on Embedded Software and Syst (HPCC, CSS, ICESS). Paris, France: IEEE; 2014. p. 974–981.
   Google Scholar
• Reviriego P , Pontarelli S , Maestro J , et al. A synergetic use of Bloom filters for error detection and correction. IEEE Trans Very Large Scale Integr (VLSI) Syst. 2015;23(3):584–587.
   Google Scholar
• Yao Y , Xiong S , Qi H , et al . Efficient histogram estimation for smart grid data processing with the Loglog-Bloom-filter, IEEE Trans. Smart Grid IEEE Trans Smart Grid. 2015;6(1):199–208.
   Google Scholar
• Zink T , Waldvogel M . Efficient hash tables for network applications. SpringerPlus. 2015;4(1):1–19.
   Google Scholar
• Bender M , Farach-Colton M , Johnson R , et al . Dont thrash: how to cache your hash on flash. Proc VLDB Endowment. 2012;5(11):1627–1637.
   Google Scholar
• Knuth DE . The art of computer programming: sorting and searching. Vol. 3. Addison Wesley; 1973. p. 2217–2220.
   Google Scholar
• Alhisnawi M , Ahmadi M . Deep packet inspection using quotient filter. IEEE Commun Lett. 2016;20(11).
   Google Scholar
• Aumasson J-P , Bernstein DJ . Siphash: a fast short-input PRF. Cryptology ePrint Archive, Report 2012/351, 2012. Available from: http://eprint.iacr.org/.
   Google Scholar
• Putze F , Sanders P , Johannes S . Cache-, hash- and space-efficient bloom filters. Experimental algorithms: Springer, Berlin; 2007. p. 108–121.
   Google Scholar
• Fan L , Cao P , Almeida J , et al . Summary cache: a scalable wide-area web cache sharing protocol. IEEE/ACM Trans Netw IEEE/ACM Trans Netw. 2000;8(3):281–293.
   Google Scholar
• Bonomi F , Mitzenmacher M , Panigrahy R , et al . An improved construction for counting bloom filters. Lecture notes in computer science algorithms, ESA. 2006;2006:684–95.
   Google Scholar
• Schnurrenberger U . The content name collection, CNC. Accessed Feb 20, 2017. Available from: http://www.icn-names.net/.
   Google Scholar
• Dharmapurikar S , Taylor DE , et al . Longest prefix matching using Bloom filters. IEEE/ACM Trans Netw. 2006;14:397–409.
   Google Scholar
• Project CCNx . Available from: http://www.ccnx.org.
   Google Scholar