ICN Forwarding Node PIT-Based Interest Routing
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
The existing Named Data Network (NDN) routing efficiency is low due to the need for hop-by-hop querying of the Forwarding Information Base (FIB) for routing interest packets, which hampers the scalability and speed of content retrieval in Information Centric Networks (ICNs).
Innovation Solution
A packet processing method that utilizes the Pending Information Table (PIT) to forward interest packets by matching content names within data packets, eliminating the need for FIB querying, and includes mechanisms for updating and managing PIT entries to efficiently route interest packets.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If hop-by-hop FIB querying is used for routing interest packets in NDN, then the routing process can be implemented with simple table structures, but the routing efficiency becomes low and content retrieval speed decreases
Solution Approach 1:
The patent inverts the traditional FIB querying approach by using PIT entries to store reverse mapping information (next hop and outgoing interface) for interest packets. Instead of querying FIB hop-by-hop to find the next hop, the system pre-stores the reverse mapping in PIT when the interest packet is first processed, allowing direct retrieval of routing information without hop-by-hop FIB queries, thus significantly improving routing efficiency and content retrieval speed
2Productivity
If FIB querying is performed hop-by-hop for each interest packet, then the forwarding process can be simple, but the network overhead increases and scalability is hampered
Solution Approach 1:
The patent applies preliminary action by pre-storing the reverse mapping information (next hop router and outgoing interface) in the PIT entry when the interest packet is first received and processed. This pre-computed routing information is then directly retrieved and used for forwarding subsequent data packets, eliminating the need for complex hop-by-hop FIB queries and reducing forwarding process complexity while improving routing efficiency
Solution Approach 2:
The PIT entry acts as an intermediary structure that stores reverse mapping information between interest packets and their corresponding routing paths. Instead of directly querying FIB tables hop-by-hop, the system uses PIT entries as intermediaries to retrieve pre-stored routing information, simplifying the forwarding process and reducing network overhead while maintaining high routing efficiency
Data Source
Figure 1~2
Figure 3
Figure 4
AI summary
Embodiments of the present invention provide a packet processing method and a device. The method is applied to a forwarding node in an ICN, where the forwarding node includes a PIT, the PIT includes one or more PIT entries, and each PIT entry includes a content name and a port. The method includes: receiving a data packet that is generated and sent by a destination device after the destination device receives a first interest packet that is forwarded by a source device via the forwarding node, where the data packet carries a content name that is the same as a content name of content requested by using the first interest packet; when forwarding the first interest packet, generating, by the forwarding node, a PIT entry corresponding to the first interest packet in the PIT; and when determining that the data packet carries a second interest packet, matching the content name carried in the data packet with a content name in the PIT entry, and forwarding the data packet to the source device according to a port in the matched PIT entry. The technical solutions in the present invention can improve efficiency of routing an interest packet in an NDN.