Skip to search formSkip to main contentSkip to account menu

Longest prefix match

Known as: LPM, Longest prefix matching 
Longest prefix match (also called Maximum prefix length match) refers to an algorithm used by routers in Internet Protocol (IP) networking to select… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Longest Prefix Match (LPM) is a basic and important function for current network devices. Hash-based approaches appear to be… 
2016
2016
The splitting processes of bremsstrahlung and pair production in a medium are coherent over large distances in the very high… 
2014
2014
A central component in all contemporary intrusion detection systems (IDSs) is their pattern matching algorithms, which are often… 
Highly Cited
2013
Highly Cited
2013
This paper presents an envelope tracking power amplifier (ET PA) using a dual-mode supply modulator for handset application. The… 
2011
2011
With the growing speed of computer networks, the core routers have to increase performance of longest prefix match (LPM… 
2011
2011
In this paper, we describe an IP-Lookup method for network routing. We extend the basic Range Trie data-structure to support… 
1999
1999
This paper presents a hardware table-lookup (TLU) engine that allows the real-time operation of complicated TLU for… 
1998
1998
A router uses the destination address of every incoming packet to decide the proper next-hop information of t he packet. High… 
1997
1997
A novel Trench Lateral Power MOSFET (T-LPM) structure and its fabrication process are presented in this paper. The gate, channel…