IP Packet Forwarding via Prefix Table Lookup and Entry Identifier Generation
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current network protocols, such as IP, face challenges in efficiently forwarding Internet Protocol frames to their intended destinations, particularly in networks with limited size and high frame rates, due to time-consuming destination identification processes that can be costly and computationally intensive.
Innovation Solution
The method involves extracting IP addresses into disjunctive portions, identifying prefix entries in a table, generating an entry identifier through mathematical operations, and using this identifier to retrieve receiver data from a second table, optimizing the forwarding process with a forwarding engine that supports CIDR lookups and operates at wire-speed with reduced costs.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If traditional IP forwarding algorithms are used to determine destination, then routing decisions can be made, but the process is time-consuming and computationally intensive
Solution Approach 1:
The IP address is divided into two disjunctive portions: a first portion (portion A) that is used for prefix table lookup, and a second portion (portion B) that is used for generating an entry identifier. This segmentation allows the forwarding decision to be based on the first portion while the second portion provides additional identification, reducing the time needed for complete destination determination.
Solution Approach 2:
An entry identifier is introduced as an intermediary element that maps to receiver data in a second table. The entry identifier is generated by performing a mathematical operation on portion B and a base address, serving as a mediator between the IP address portions and the final receiver data, thereby simplifying the lookup process.
2Reliability
If existing forwarding techniques are implemented, then packets can be forwarded to destinations, but the cost (monetary, computational, and temporal) increases
Solution Approach 1:
The invention extracts only the necessary portions of the IP address for forwarding decisions. By using only the first portion (portion A) for prefix table lookup and generating an entry identifier from the second portion (portion B), the system avoids processing the entire IP address structure, thereby reducing computational complexity while maintaining forwarding accuracy.
Solution Approach 2:
The system performs partial action by using a simplified lookup process that does not require exhaustive search through all possible IP address spaces. The prefix table stores only the necessary routing information, and the mathematical operation on portion B provides sufficient identification without requiring full IP address processing.
3Measurement precision
If comprehensive destination identification is performed, then accurate forwarding decisions are made, but the address analysis rate decreases
Solution Approach 1:
The prefix table is pre-populated with routing information before packet arrival. When a packet needs to be forwarded, the system only needs to perform a lookup in the pre-organized prefix table and generate an entry identifier, rather than performing comprehensive destination identification in real-time, thereby increasing the address analysis rate while maintaining accuracy.
Data Source
AI summary
Forwarding decisions for Internet Protocol packets/frames are provided. An IP address from received packets/frames is extracted and split into portions or parts, a prefix, offset and suffix. A prefix table is used to identify an entry with a longest match to the prefix. A base address is retrieved from the identified entry to generate an identifier used to locate another entry in another table. The other identified entry provides receiver data or information regarding the intended destination.