Adam, K., Michael, M., Less hashing, same performance: Building a better bloom filter (2006) Algorithms-ESA 2006, pp. 456-467. , Springer
Derek, P., Ziyan, L., Hang, P., IP address lookup using bit-shuffled trie (2014) IEEE Computer Communications
Devavrat, S., Pankaj, G., Fast incremental updates on ternary-cams for routing lookups and packet classification (2000) Proc. Hot Interconnects
Feng, W., Mounir, H., Matching the speed gap between sram and dram (2008) Proc. IEEE HSPR, pp. 104-109
Florin, B., Dean, T., Grigore, R., Sumeet, S., A tree based router search engine architecture with single port memories (2005) Proc. IEEE ISCA
Francis, Z., Girija, N., Anindya, B., Coolcams: Power-efficient tcams for forwarding engines (2003) Proc. IEEE INFOCOM, pp. 42-52
Gábor, R., János, T., Korósi, A., Majdán, A., Heszberger, Z., Compressing IP forwarding tables: Towards entropy bounds and beyond (2013) Proc. ACM SIGCOMM
Gupta, P., Lin, S., McKeown, N., Routing lookups in hardware at memory access speeds (1998) Proc. IEEE INFOCOM, pp. 1240-1247
Hamid, F., Saheb, Z.M., Masoud, S., A novel reconfigurable hardware architecture for IP address lookup (2005) Proc. ACM/IEEE ANCS, pp. 81-90
Haoyu, S., Murali, K., Fang, H., Tv, L., Scalable IP lookups using shape graphs (2009) Proc. ACM/IEEE ICNP, pp. 73-82
Hoang, L., Weirong, J., A sram-based architecture for trie-based IP lookup using fpga (2008) Proc. IEEE FCCM, pp. 33-42
Hyesook, L., Changhoon, Y., Earl, S., Priority tries for IP address lookup (2010) IEEE Transactions on Computers, 59 (6), pp. 784-794
Jing, F., Jennifer, R., Efficient IP-address lookup with a shared forwarding table for multiple virtual routers (2008) Proc. ACM CoNEXT, , ACM
Kai, Z., Chengchen, H., Hongbin, L., Bin, L., A tcam-based distributed parallel IP lookup scheme and performance analysis (2006) IEEE/ACM Transactions on Networking, 14 (4), pp. 863-875
Keith, S., A tree-based packet routing table for berkeley unix (1991) USENIX Winter, pp. 93-99
Layong, L., Gaogang, X., Kavé, S., Steve, U., Laurent, M., Yingke, X., A trie merging approach with incremental updates for virtual routers (2013) Proc. IEEE INFOCOM, pp. 1222-1230
Lim, H., Lim, K., Lee, N., Park, K.-H., On adding bloom filters to longest prefix matching algorithms (2014) IEEE Transactions on Computers (TC), 63 (2), pp. 411-423
Mahmoud, M., Massato, M., A new hardware algorithm for fast IP routing targeting programmable routers (2003) Network Control and Engineering for Qos, Security and Mobility II, pp. 164-179. , Springer
Marcel, W., George, V., Jon, T., Bernhard, P., Scalable high speed ip routing lookups (1997) Proc. ACM SIGCOMM
Marko, Z., Luigi, R., Miljenko, M., Dxr: Towards a billion routing lookups per second in software (2012) ACM SIGCOMM Computer Communication Review, 42 (5), pp. 29-36
Masanori, B., Jonathan, C.H., Flashtrie: Hash-based prefix-compressed trie for IP route lookup beyond 100gbps (2010) Proc. IEEE INFOCOM
Miguel, R., Ernst, B., Walid, D., Survey and taxonomy of ip address lookup algorithms (2001) Network, IEEE, 15 (2)
Mikael, D., Andrej, B., Svante, C., Stephen, P., Small forwarding tables for fast routing lookups (1997) Proc. ACM SIGCOMM, pp. 3-14
Mohammad, A., Mehrdad, N., Rina, P., Samar, S., A tcam-based parallel architecture for high-speed packet forwarding (2007) IEEE Transactions on Computers, 56 (1), pp. 58-72
(2012) NVIDIA CUDA C Best Practices Guide, Version 5.0, , NVIDIA Corporation., Oct
Pierluigi, C., Leandro, D., Roberto, G., IP address lookupmade fast and simple (1999) Algorithms-ESA'99, pp. 65-76. , Springer
Priyank, W., Subhash, S., George, V., Multiway range trees: Scalable ip lookup with fast updates (2004) Computer Networks, 44 (3), pp. 289-303
Rama, S., Natsuhiko, F., Srinivas, A., Arun, S., Scalable, memory efficient, high-speed IP lookup algorithms (2005) IEEE/ACM Transactions on Networking, 13 (4), pp. 802-812
Rina, P., Samar, S., Reducing tcam power consumption and increasing throughput (2002) Proc. High Performance Interconnects, pp. 107-112
Sangjin, H., Keon, J., Kyoungsoo, P., Sue, M., Packetshader: A gpu-accelerated software router (2010) Proc. ACM SIGCOMM, pp. 195-206
Sarang, D., Praveen, K., Longest prefix matching using bloom filters (2003) Proc. ACM SIGCOMM, pp. 201-212
Song, H., Kodialam, M., Hao, F., Lakshman, T., Building scalable virtual routers with trie braiding (2010) Proc. IEEE INFOCOM
Stefan, N., Gunnar, K., IP-address lookup using lc-tries. Selected areas in communications (1999) IEEE Journal on, 17 (6), pp. 1083-1092
Venkatachary, S., George, V., Fast address lookups using controlled prefix expansion (1999) ACM TOCS, 17 (1), pp. 1-40
Will, E., George, V., Zubin, D., Tree bitmap: Hardware/software IP lookups with incremental updates (2004) ACM SIGCOMM Computer Communication Review, 34 (2), pp. 97-122
Yang, T., Mi, Z., Duan, R., Guo, X., Lu, J., Zhang, S., Sun, X., Liu, B., An ultra-fast universal incremental update algorithm for trie-based routing lookup (2012) Proc. ACM/IEEE ICNP
Zhao, J., Zhang, X., Wang, X., Xue, X., Achieving O(1) IP lookup on gpu-based software routers (2010) ACM SIGCOMM Computer Communication Review, 40, pp. 429-430. , ACM
