Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 228,232,281 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
6 relations
Algorithm
Content-addressable memory
Default route
Multiprotocol Label Switching
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Statistical Optimal Hash-Based Longest Prefix Match
Yi Wang
,
Zhuyun Qi
,
Huichen Dai
,
Hao Wu
,
Kai Lei
,
B. Liu
Symposium on Architectures for Networking and…
2017
Corpus ID: 1904659
Longest Prefix Match (LPM) is a basic and important function for current network devices. Hash-based approaches appear to be…
Expand
2014
2014
CompactDFA: Scalable Pattern Matching Using Longest Prefix Match Solutions
A. Bremler-Barr
,
David Hay
,
Yaron Koral
IEEE/ACM Transactions on Networking
2014
Corpus ID: 446532
A central component in all contemporary intrusion detection systems (IDSs) is their pattern matching algorithms, which are often…
Expand
2014
2014
An Analytical Method for Estimation of Lightning Performance of Transmission Lines Based on a Leader Progression Model
W. Sima
,
Yongfu Li
,
V. Rakov
,
Q. Yang
,
T. Yuan
,
Ming Yang
IEEE transactions on electromagnetic…
2014
Corpus ID: 1188743
The leader progression model (LPM) is a tool for estimating the lightning performance of transmission lines. However, the large…
Expand
2011
2011
Effective hash-based IPv6 longest prefix match
Jiri Tobola
,
J. Korenek
14th IEEE International Symposium on Design and…
2011
Corpus ID: 12811424
With the growing speed of computer networks, the core routers have to increase performance of longest prefix match (LPM…
Expand
2011
2011
Longest Prefix Match and updates in Range Tries
I. Sourdis
,
S. Katamaneni
IEEE International Conference on Application…
2011
Corpus ID: 11526182
In this paper, we describe an IP-Lookup method for network routing. We extend the basic Range Trie data-structure to support…
Expand
2007
2007
Understanding ion-mobility and transport properties of aerosol nanowires
S. Kim
,
G. Mulholland
,
M. Zachariah
2007
Corpus ID: 55128939
2005
2005
A longest prefix first search tree for IP lookup
Lih-Chyau Wuu
,
Tzong-Jye Liu
,
Kuo-Ming Chen
IEEE International Conference on Communications…
2005
Corpus ID: 460212
1999
1999
High-speed table lookup engine for IPv6 longest prefix match
T. Hayashi
,
T. Miyazaki
Seamless Interconnection for Universal Services…
1999
Corpus ID: 59118108
This paper presents a hardware table-lookup (TLU) engine that allows the real-time operation of complicated TLU for…
Expand
1998
1998
Longest Prefix Search Using Compressed Trees
H. Tzeng
1998
Corpus ID: 17320032
A router uses the destination address of every incoming packet to decide the proper next-hop information of t he packet. High…
Expand
1997
1997
A trench lateral power MOSFET using self-aligned trench bottom contact holes
N. Fujishima
,
C. Salama
International Electron Devices Meeting. IEDM…
1997
Corpus ID: 32508204
A novel Trench Lateral Power MOSFET (T-LPM) structure and its fabrication process are presented in this paper. The gate, channel…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE