science

Longest prefix match

Longest prefix match is a science topic covered in the lgStudy science library. This page brings together a partial reference excerpt, illustrations, worked examples, real-world applications and a short study plan, so you can understand Longest prefix match rather than just read about it. In short: Longest prefix match (also called Maximum prefix length match) refers to an algorithm used by routers in Internet Protocol (IP) networking to select an entry from a routing table. Because each entry in a forwarding table may specify a sub-network, one destination address may match more than one forwarding table entry.

Key takeaways

Longest prefix match belongs to science; place it in that map before memorising details.
Learn the definition first, then one example that makes the definition concrete.
Connect Longest prefix match to a quantity you can measure, compute or draw — that is where exam questions come from.
Reproduce the core statement of Longest prefix match from memory before moving on to harder problems.

Reference excerpt

Longest prefix match (also called Maximum prefix length match) refers to an algorithm used by routers in Internet Protocol (IP) networking to select an entry from a routing table. Because each entry in a forwarding table may specify a sub-network, one destination address may match more than one forwarding table entry. The most specific of the matching table entries — the one with the longest subnet mask — is called the longest prefix match. It is called this because it is also the entry where the largest number of leading address bits of the destination address match those in the table entry.

For example, consider this IPv4 forwarding table (CIDR notation is used):

192.168.20.16/28 192.168.0.0/16

When the address 192.168.20.19 needs to be looked up, both entries in the forwarding table "match". That is, both entries contain the looked up address. In this case, the longest prefix of the candidate routes is 192.168.20.16/28, since its subnet mask (/28) is longer than the other entry's mask (/16), making the route more specific. Forwarding tables often contain a default route, which has the shortest possible prefix match, to fall back on in case matches with all other entries fail.

See also Network Search Engine: hardware accelerator used in routers for LPM lookups. Trie: prefix tree

References

Worked examples

Example 1 — a first encounter with Longest prefix match

Start with the simplest possible case. Write down what Longest prefix match claims or describes in one sentence, then invent the smallest concrete situation in which that sentence is true. In science, the smallest case is usually a single object, a single equation or a single measurement. Check that every symbol or term in your sentence has a meaning in that case.

Example 2 — changing one variable

Take the situation from Example 1 and change exactly one quantity: double it, halve it, or set it to zero. Predict what should happen to Longest prefix match before you calculate. Comparing your prediction with the result is the fastest way to find out whether you understand the idea or only the words.

Example 3 — an exam-style question

Typical questions about Longest prefix match ask you to (a) state it precisely, (b) apply it to given data, and (c) explain a limitation. Practise writing all three answers in under five minutes; the third part is what separates a full-mark answer from an average one.

Applications of Longest prefix match

In research: Longest prefix match appears in science research whenever the underlying quantities have to be modelled precisely. Papers usually cite it as a starting assumption and then explore where it breaks down.
In technology and industry: Engineering practice reuses Longest prefix match in design rules, simulations and safety margins. Knowing the idea lets you read a specification sheet and understand why the numbers look the way they do.
In the classroom: Longest prefix match is common in secondary-school and first-year university syllabi. It links to neighbouring topics Internet architecture, Routing protocols, so understanding it makes those chapters shorter.
In everyday life: Look for Longest prefix match outside the textbook — in sport, cooking, traffic, electronics or the sky above you. An example you found yourself is remembered far longer than one you were given.

Ask Teacher Smith questions about this articleOpens your AI tutor with a question about “Longest prefix match” →

Affiliate

Preply — study more efficiently by working with a personal tutor. 50% off.

How to study Longest prefix match in 20 minutes

Read the reference excerpt below once, without taking notes.
Close the page and write down what Longest prefix match means in your own words.
Compare your version with the excerpt and mark what you missed.
Work through the three examples above with pen and paper.
Explain Longest prefix match out loud to somebody else — or to Teacher Smith in the lgStudy chat.

Frequently asked questions

What is Longest prefix match in simple terms?

Why does Longest prefix match matter?

Because it connects several science ideas at once: it gives you a definition you can apply, a quantity you can calculate, and a way to check whether a result is plausible.

How should I study Longest prefix match?

Read the excerpt, restate it from memory, then work through the examples and applications listed on this page. The five-step study plan above takes about twenty minutes.

What does this page cover?

It gives you a compact reference excerpt plus original lgStudy explanations, examples, applications and study material on Longest prefix match.