Satellite Payload Routing via Precomputed Trie Structures
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing routers in space environments face challenges in implementing high-speed layer 3-based IP packet processing due to limited performance of components qualified for space environments, leading to burdens in processing and transmission speeds, such as the Internet Routing In Space (IRIS) system with a packet processing performance of only 250 Mbps.
Innovation Solution
An electronic apparatus method that acquires routing table information, generates identification information including satellite and cell IDs, and transmits signals with this information to efficiently route data packets across satellite groups, using a label structure with satellite ID, cell ID, quality of service, and reserve bits to facilitate high-speed packet switching even with limited hardware performance.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If layer 3-based IP packet processing is implemented using software-based routing table lookup, then routing functionality is achieved, but processing speed is limited due to the longest prefix matching method requiring relatively long processing time
Solution Approach 1:
The patent segments the routing table lookup process into two distinct phases: an offline preprocessing phase where the routing table is converted into a trie data structure with pre-calculated path information, and an online query phase where packet routing is performed using simple pointer following. This segmentation allows the complex longest prefix matching computation to be performed once offline, enabling extremely fast online routing decisions with minimal processing time per packet.
Solution Approach 2:
The patent performs preliminary action by pre-processing the routing table information before actual packet routing occurs. The routing table is converted into a trie structure with pre-calculated next-hop pointers and path information during an offline setup phase. This preliminary preparation eliminates the need for complex computations during online packet routing, allowing routers to make forwarding decisions rapidly by simply following pre-computed pointers in the trie structure.
2Productivity
If high-performance CPU is used to implement hardware for high-speed packet processing, then packet processing speed is improved, but cost and device complexity increase
Solution Approach 1:
The patent replaces the mechanical/computational system of traditional routing table lookup with a data structure-based system using tries. Instead of using complex CPU-based longest prefix matching algorithms, the invention uses a trie data structure where routing decisions are made through simple pointer following and bit comparison. This substitution reduces the computational burden from complex sequential searches to simple structural traversals, enabling high-speed packet processing with simpler hardware requirements.
Solution Approach 2:
The patent changes the fundamental parameter of how routing information is organized and accessed. Rather than storing routing tables in traditional formats requiring complex lookup algorithms, the invention transforms the routing table into a trie data structure with specific properties: prefix-based organization, pre-calculated path pointers, and hierarchical node structure. This parameter change in data organization enables O(1) or O(log n) routing decisions instead of O(n) linear searches, dramatically improving processing speed while reducing hardware complexity.
3Reliability
If previous generation components qualified for space environment are used, then reliability in space environment is ensured, but packet processing performance is limited to 250 Mbps
Solution Approach 1:
The patent replaces the CPU-intensive mechanical processing system with a data structure-based pointer following system. By using tries with pre-calculated paths, the invention eliminates the need for complex sequential searching and longest prefix matching computations that burden previous generation space-qualified processors. This substitution enables gigabit-speed packet processing using simpler operational mechanisms that are well-suited for space-qualified hardware with limited processing capabilities.
Solution Approach 2:
The patent fundamentally changes the operational parameters of packet routing from complex algorithmic processing to simple structural traversal. The trie data structure enables routing decisions to be made through minimal pointer following and bit comparison operations, reducing the computational parameter from thousands of CPU cycles per packet to merely a handful of simple operations. This parameter change allows space-qualified components to achieve gigabit processing speeds despite their limited performance characteristics.
4Measurement precision
If identification information including satellite ID and cell ID is generated and transmitted, then routing accuracy and precision are improved, but signal transmission overhead increases
Solution Approach 1:
The patent merges multiple identification parameters (satellite ID, cell ID, and routing path information) into a single integrated label structure. This label is attached to each packet and contains all necessary routing information in a compact, unified format. By merging these separate identification elements into one consolidated structure, the patent reduces the total overhead compared to transmitting multiple separate identification fields, while maintaining complete routing precision for satellite-based networks.
Data Source
AI summary
According to the present disclosure, systems, devices, methods, and instructions for transmitting a signal may include acquiring routing table information including information associated with a plurality of Internet Protocol (IP) addresses, generating, based on the routing table information, identification information for a predetermined IP address associated with another electronic apparatus to which a data packet is to be transmitted, and transmitting a signal including the identification information and the data packet.