NIU Yun, WU Liji, ZHANG Xiangmin. An IPsec accelerator design for a 10Gbps in-line security network processor[J]. Journal of Computers (Finland), 2013, 8(2): 319-325.
[2]
胥小波,郑康锋,李丹,等.基于并行BP神经网络的路由查找算法[J].通信学报, 2012, 33(2): 61-68.XU Xiaobo, ZHENG Kangfeng, LI Dan, et al. Routing lookup algorithm based on parallel BP neural network [J]. Journal of Communications, 2012, 33(2): 61-68.
[3]
袁博,汪斌强,王志明. 并行多流水绿色路由查找架构和算法[J]. 西安电子科技大学学报, 2012, 39(2): 145-152.YUAN Bo, WANG Binqiang, WANG Zhiming. Green IP lookup architecture and algorithm based on the parallel multi-pipeline[J]. Journal of Xidian University, 2012, 39(2): 145-152.
[4]
SARANG D, PRAVEEN K, TAYLOR D E. Longest prefix matching using bloom filters[J]. IEEE/ACM Transactions on Networking, 2006, 14(2): 397-409.
[5]
LIM Hyesook, LIM Kyuhee, LEE Nara, et al. On adding Bloom filters to longest prefix matching algorithms[J]. IEEE Transactions on Computers, 2014, 63(2): 411-423.
[6]
SONG Haoyu, KODIALAM M, HAO Fang, et al. Building scalable virtual routers with trie braiding[C]//Proceedings of IEEE INFOCOM 2010. San Diego, USA, 2010: 14-19.
[7]
LUO Layong, XIE Gaogang, XIE Yingke, et al. A hybrid hardware architecture for high speed IP lookups and fast route updates[J]. IEEE/ACM Transactions on Networking, 2014, 22(3): 957-969.
[8]
李鲲鹏,兰巨龙. 基于TCAM的高效浮动关键词匹配算法[J]. 计算机工程, 2012, 38(4): 269-274.LI Kunpeng, LAN Julong. Efficient unfixed keywords matching algorithm based on TCAM[J]. Computer Engineering, 2012, 38(4): 269-274.
[9]
GUO Deke,LIU Yunhao, LI Xiangyang, et al. False negative problem of counting Bloom filter[J]. IEEE Transactions on Knowledge and Data Engineering, 2010, 22(5): 651-664.
[10]
ROTHENBERG C E, MACAPUNA C A B, VERDI F L, et al. The deletable Bloom filter: a new member of the Bloom family[J]. IEEE Communications Letters, 2010, 14(6): 557-559.
