Open In App

Longest Prefix Matching in Routers

Last Updated : 15 Jun, 2022
Like Article

What is Forwarding? 
Forwarding is moving incoming packets to the appropriate interface. Routers use a forwarding table to decide which incoming packet should be forwarded to which next hop. 

What is an IP prefix? 
IP prefix is a prefix of IP address. All computers on one network have the same IP prefix. For example, in, 18 is the length of the prefix and prefix is the first 18 bits of the address. 

How does forwarding work? 
Routers basically look at the destination address’s IP prefix, searches the forwarding table for a match, and forward the packet to the corresponding next hop in the forwarding table. 

What happens if the prefixes overlap? 
Since prefixes might overlap (this is possible as classless addressing is used everywhere), an incoming IP’s prefix may match multiple IP entries in a table. 
For example, consider the below forwarding table 


Prefix Next Hop D B

In the above table, addresses from to overlap, i.e., match with both entries of the table. 
To handle the above situation, routers use the Longest Prefix Matching rule. The rule is to find the entry in a table which has the longest prefix matching with the incoming packet’s destination IP and forward the packet to the corresponding next hope. 
In the above example, all packets in overlapping range ( to are forwarded to next hop B as B has a longer prefix (22 bits). 


Example 1: Routers forward a packet using forwarding table entries. The network address of the incoming packet may match multiple entries. How do routers resolve this? 
(A) Forward it to the router whose entry matches with the longest prefix of the incoming packet 
(B) Forward the packet to all routers whose network addresses match. 
(C) Discard the packet. 
(D) Forward it the router whose entry matches with the longest suffix of an incoming packet 

Answer: (A) The network addresses of different entries may overlap in the forwarding table. Routers forward the incoming packet to the router which hashes the longest prefix matching with the incoming packet. 

 Example 2: Classless Inter-domain Routing (CIDR) receives a packet with address The router’s routing table has the following entries: (GATE CS 2015) 

Prefix           Output Interface Identifier              3              5              2              1 

The identifier of the output interface on which this packet will be forwarded is ______. 

Answer: “1”. We need to first find out matching table entries for an incoming packets with address “”. The address matches with two entries “” and “” (We found this by matching the first 12 and 15 bits respectively). 
So should the packet go to interface 3 or 1? We use Longest Prefix Matching to decide among the two. The most specific of the matching table entries is used as the interface. Since “” is most specific, the packet goes to interface 1. 

Consider the following routing table of a router. 

Prefix Next Hop D B

Consider the following three IP addresses. 


Like Article
Suggest improvement
Share your thoughts in the comments

Similar Reads