High-performance IP lookup using Intel Xeon Phi: a Bloom filters based approach

被引:2
作者
Lucchesi, Alexandre [1 ]
Drummond, Andre C. [1 ]
Teodoro, George [1 ]
机构
[1] Univ Brasilia, Dept Comp Sci, Brasilia, DF, Brazil
关键词
Longest prefix matching; Software router; Intel Xeon Phi;
D O I
10.1186/s13174-017-0075-y
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
IP lookup is a core operation in packet forwarding, which is implemented using a Longest Prefix Matching (LPM) algorithm to find the next hop for an input address. This work proposes and evaluates the use of parallel processors to deploy an optimized IP lookup algorithm based on Bloom filters. We target the implementation on the Intel Xeon Phi (Intel Phi) many-core coprocessor and on multi-core CPUs, and also evaluate the cooperative execution using both computing devices with several optimizations. The experimental evaluation shows that we were able to attain high IP lookup throughputs of up to 182.7 Mlps (Million packets per second) for IPv6 packets on a single Intel Phi. This performance indicates that the Intel Phi is a very promising platform for deployment of IP lookup. We also compared the Bloom filters to an efficient approach based on the Multi-Index Hybrid Trie (MIHT) in which the Bloom filters was up to 5.1 x faster. We also propose and evaluate the cooperative use of CPU and Intel Phi in the IP lookup, which resulted in an improvement of about 1.3 x as compared to the execution using only the Intel Phi.
引用
收藏
页数:18
相关论文
共 41 条
[1]  
[Anonymous], 2016, CAIDA UCSD ANONYMIZE
[2]   Poptrie: A Compressed Trie with Population Count for Fast and Scalable Software IP Routing Table Lookup [J].
Asai, Hirochika ;
Ohara, Yasuhiro .
ACM SIGCOMM COMPUTER COMMUNICATION REVIEW, 2015, 45 (04) :57-70
[3]  
Augonnet C, 2009, LECT NOTES COMPUT SC, V5704, P863, DOI 10.1007/978-3-642-03869-3_80
[4]   SPACE/TIME TRADE/OFFS IN HASH CODING WITH ALLOWABLE ERRORS [J].
BLOOM, BH .
COMMUNICATIONS OF THE ACM, 1970, 13 (07) :422-&
[5]  
Broder A., 2004, INTERNET MATH, V1, P485, DOI [DOI 10.1080/15427951.2004.10129096, 10.1080/15427951.2004.10129096]
[6]   IP Address Lookup by Using GPU [J].
Chu, Hung-Mao ;
Li, Tsung-Hsien ;
Wang, Pi-Chung .
IEEE TRANSACTIONS ON EMERGING TOPICS IN COMPUTING, 2016, 4 (02) :187-198
[7]   Longest prefix matching using bloom filters [J].
Dharmapurikar, S ;
Krishnamurthy, P ;
Taylor, DE .
IEEE-ACM TRANSACTIONS ON NETWORKING, 2006, 14 (02) :397-409
[8]  
Dharmapurikar S, 2003, ACM SIGCOMM COMP COM, V33, P201
[9]  
Dobrescu M, 2009, SOSP'09: PROCEEDINGS OF THE TWENTY-SECOND ACM SIGOPS SYMPOSIUM ON OPERATING SYSTEMS PRINCIPLES, P15
[10]   OnipSs: A PROPOSAL FOR PROGRAMMING HETEROGENEOUS MULTI-CORE ARCHITECTURES [J].
Duran, Alejandro ;
Ayguade, Eduard ;
Badia, Rosa M. ;
Labahta, Jesus ;
Martinell, Luis ;
Martorell, Xavier ;
Planas, Judit .
PARALLEL PROCESSING LETTERS, 2011, 21 (02) :173-193