Optimizing SMT processors for IP-packet processing

2005 ◽  
Vol 29 (7) ◽  
pp. 337-349 ◽  
Author(s):  
Behnam Robatmili ◽  
Nasser Yazdani ◽  
Mehrdad Nourani
Keyword(s):  
Author(s):  
Guangdeng Liao ◽  
Xia Zhu ◽  
Steen Larsen ◽  
Laxmi Bhuyan ◽  
Ram Huggahalli

2021 ◽  
Vol 48 (4) ◽  
pp. 45-48
Author(s):  
Shunsuke Higuchi ◽  
Junji Takemasa ◽  
Yuki Koizumi ◽  
Atsushi Tagami ◽  
Toru Hasegawa

This paper revisits longest prefix matching in IP packet forwarding because an emerging data structure, learned index, is recently presented. A learned index uses machine learning to associate key-value pairs in a key-value store. The fundamental idea to apply a learned index to an FIB is to simplify the complex longest prefix matching operation to a nearest address search operation. The size of the proposed FIB is less than half of an existing trie-based FIB while it achieves the computation speed nearly equal to the trie-based FIB. Moreover, the computation speed of the proposal is independent of the length of IP prefixes, unlike trie-based FIBs.


2016 ◽  
Vol 51 (4) ◽  
pp. 67-81 ◽  
Author(s):  
Antoine Kaufmann ◽  
SImon Peter ◽  
Naveen Kr. Sharma ◽  
Thomas Anderson ◽  
Arvind Krishnamurthy

Sign in / Sign up

Export Citation Format

Share Document