Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Longest_prefix_match> ?p ?o. }
Showing items 1 to 26 of
26
with 100 items per page.
- Longest_prefix_match abstract "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 of the matching table entries — 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 of the destination address match those in the table entry.For example, consider this IPv4 routing table (CIDR notation is used):192.168.20.16/28192.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.".
- Longest_prefix_match wikiPageID "764303".
- Longest_prefix_match wikiPageRevisionID "596832136".
- Longest_prefix_match hasPhotoCollection Longest_prefix_match.
- Longest_prefix_match subject Category:Internet_architecture.
- Longest_prefix_match subject Category:Routing_protocols.
- Longest_prefix_match type Abstraction100002137.
- Longest_prefix_match type Communication100033020.
- Longest_prefix_match type Direction106786629.
- Longest_prefix_match type Message106598915.
- Longest_prefix_match type Protocol106665108.
- Longest_prefix_match type RoutingProtocols.
- Longest_prefix_match type Rule106652242.
- Longest_prefix_match comment "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 of the matching table entries — the one with the highest subnet mask — is called the longest prefix match.".
- Longest_prefix_match label "Longest Prefix Match".
- Longest_prefix_match label "Longest prefix match".
- Longest_prefix_match label "Longest prefix match".
- Longest_prefix_match label "最长前缀匹配".
- Longest_prefix_match sameAs Longest_Prefix_Match.
- Longest_prefix_match sameAs Longest_prefix_match.
- Longest_prefix_match sameAs m.039hbc.
- Longest_prefix_match sameAs Q1015367.
- Longest_prefix_match sameAs Q1015367.
- Longest_prefix_match sameAs Longest_prefix_match.
- Longest_prefix_match wasDerivedFrom Longest_prefix_match?oldid=596832136.
- Longest_prefix_match isPrimaryTopicOf Longest_prefix_match.