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 routing table may specify a network, one destination address may match more than one routing table entry. The most specific table entry — the one with the highest 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 in the table entry match those of the destination address.
For example, consider this IPv4 routing table (CIDR notation is used):
192.168.20.16/28 192.168.0.0/16When the address 192.168.20.19 needs to be looked up, both entries in the routing 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 higher than the other entry's mask (/16), making the route more specific.
Routing 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.
Famous quotes containing the words longest and/or match:
“Once I went so far as to slaughter a woodchuck which ravaged my bean-field,—effect his transmigration, as a Tartar would say,—and devour him, partly for experiment’s sake; but though it afforded me a momentary enjoyment, notwithstanding a musky flavor, I saw that the longest use would not make that a good practice, however it might seem to have your woodchucks ready dressed by the village butcher.”
—Henry David Thoreau (1817–1862)
“They who have considered our nature, affirm that shame and disgrace are two of the most insupportable evils of human life: the courage and spirits of many have master’d other misfortunes and borne themselves up against them; but the wisest and best of souls have not been a match for these.”
—Laurence Sterne (1713–1768)