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… (More)
Wikipedia

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… (More)
  • figure 1
  • figure 2
  • figure 4
  • figure 3
  • figure 5
Is this relevant?
2017
2017
Ternary Content-Addressable Memory (tcam) is a powerful tool to represent network services with line-rate lookup time. There are… (More)
  • figure 1
  • figure 2
  • figure 3
  • table II
  • figure 4
Is this relevant?
2014
2014
A central component in all contemporary intrusion detection systems (IDSs) is their pattern matching algorithms, which are often… (More)
  • figure 1
  • figure 2
  • table I
  • figure 3
  • table II
Is this relevant?
Review
2012
Review
2012
The IP address lookup has been a major challenge for Internet routers. This is accompanied with a background of advances in link… (More)
  • figure 1
  • figure 2
  • table I
  • figure 4
  • figure 3
Is this relevant?
2011
2011
With the growing speed of computer networks, the core routers have to increase performance of longest prefix match (LPM… (More)
  • figure 1
  • figure 3
  • figure 2
  • figure 4
  • figure 5
Is this relevant?
2011
2011
he range trie constitutes an advanced address lookup scheme aiming at low lookup throughput, latency and memory requirements. The… (More)
  • figure 2.1
  • figure 2.2
  • figure 2.3
  • figure 2.8
  • figure 2.9
Is this relevant?
2011
2011
In this paper, we describe an IP-Lookup method for network routing. We extend the basic Range Trie data-structure to support… (More)
  • figure 1
  • figure 2
  • figure 5
  • figure 3
  • figure 4
Is this relevant?
2010
2010
Faculty of Electrical Engineering, Mathematics and Computer Science CE-MS-2010-22 Address lookup has become a major bottleneck in… (More)
  • figure 1.1
  • figure 1.2
  • figure 1.3
  • figure 1.4
  • figure 1.5
Is this relevant?
2009
2009
An IP router determines the next hop for an internet protocol packet by finding the longest prefix match. Ternary CAMs, which… (More)
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2000
Highly Cited
2000
We propose an IP forwarding table search engine architecture, VLMP (Vertical Logical operation with Maskencoded Prefix-length… (More)
  • figure 1
  • figure 3
  • figure 2
  • figure 4
  • figure 5
Is this relevant?