Find the names of the network interfaces by their IPs by the /proc/net/fib_trie file

Extracting IP Addresses From /proc/net/fib_trie file In Linux. In this video, we dive deep into a Bash script designed to extract IP addresses from the Linux kernel's Forwarding Information Base (FIB) Trie and map them to their respective network interfaces.
We'll walk you through each line of the script, explaining how it reads from /proc/net/fib_trie, processes the data with awk, and uses associative arrays in Bash to create a comprehensive mapping of IP addresses to their device names.
-- What is /proc/net/fib_trie file? --
The /proc/net/fib_trie file in the Linux operating system provides information about the Forwarding Information Base (FIB) in the form of a prefix tree (Trie). FIB stands for Forwarding Information Base and its function is to store information about the best route to reach any IP address on the network.
A prefix tree is a type of tree data structure that is optimized for storing and searching IP addresses efficiently. In this structure, each node in the tree represents an IP prefix, and its sub-branches represent more specific IP addresses.
The /proc/net/fib_trie file provides the following information about each entry in the FIB:
1) IP prefix: The IP address and its prefix length (e.g., 192.168.1.0/24)
2) Route type: The type of routing (e.g., unicast, multicast)
3) Metric: A number that indicates the preference for using this route
4) Interface: The network interface that is used to send packets to this IP address
5) Flags: Flags that provide additional information about the route
To view the contents of the /proc/net/fib_trie file, you can use the cat command:
cat /proc/net/fib_trie
-- What is a Prefix Tree (Trie)? --
A prefix tree (trie) is a type of tree data structure that is optimized for storing and searching IP addresses efficiently. In this structure, each node in the tree represents an IP prefix, and its subtrees represent more specific IP addresses.
-- Advantages of using prefix trees: --
1) Fast searching: Searching for IP addresses in a prefix tree is much faster than searching in a simple list or table.
2) Efficient storage: Prefix trees can store IP addresses more efficiently than lists or tables, because they only store unique prefixes.
3) Easy updates: Updating information about IP addresses in a prefix tree is easy, because only the nodes corresponding to the changed IP addresses need to be changed.
-- Applications of prefix trees in Linux: --
1) Forwarding Information Base (FIB): The file /proc/net/fib_trie provides information about the FIB in the form of a prefix tree. The FIB is responsible for storing information about the best route to reach each IP address on the network.
2) IP routing table: The Linux kernel uses prefix trees to store information about the IP routing table.
3) Packet filtering: Prefix trees can be used to filter IP packets based on the source or destination IP address.
4) DNS: Some DNS servers use prefix trees to store information about domain names and their corresponding IP addresses.