Longest prefix match
id:
longest-prefix-match-244-16479419
title:
Longest prefix match
text:
Longest prefix 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 o
brand slug:
wiki
category slug:
encyclopedia
description:
String-searching algorithm used in IP routing
original url:
https://en.wikipedia.org/wiki/Longest_prefix_match
date created:
date modified:
2023-11-20T23:32:12Z
main entity:
{"identifier":"Q1015367","url":"https://www.wikidata.org/entity/Q1015367"}
image:
fields total:
13
integrity:
14