Hash-Based Rule Table Routing for Low-Power Ethernet-TSN Switches
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
In-vehicle communication systems face challenges with high power consumption and heat generation due to large-scale logic required for implementing high security functions, especially when connected to both local and global networks, which is exacerbated by the need for extensive comparison circuits in Ethernet-TSN systems.
Innovation Solution
A network router configuration using a hash-based addressing system for rule storage in a rule table, combined with a collision control mechanism, reduces circuit area and power consumption by using hash values as indices for rule retrieval and managing collisions efficiently.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If large-scale logic is implemented for high security function, then security is improved, but power consumption increases
Solution Approach 1:
The patent segments the rule table into multiple smaller tables (first rule table and second rule table) and divides processing into stages. Instead of using one large comparison circuit, the system processes frames through multiple smaller tables sequentially, reducing the power consumption of individual comparison operations while maintaining overall security through multi-stage verification.
2Productivity
If large comparison circuits are used for high-speed frame processing, then processing speed is improved, but circuit area increases
Solution Approach 1:
The patent divides the rule table into multiple smaller tables and processes frames through multiple stages. This segmentation allows the system to achieve high processing speeds by parallelizing operations across multiple smaller comparison circuits rather than using a single large circuit, thereby reducing overall circuit area while maintaining processing throughput.
Solution Approach 2:
The patent transitions from a single-dimension approach (one large comparison circuit) to a multi-dimensional approach (multiple smaller tables processed in stages). By adding the dimension of processing stages and distributing rules across multiple tables, the system achieves high-speed processing without requiring a large single circuit, effectively trading spatial complexity for temporal processing structure.
3Productivity
If large comparison circuits are used for high-speed frame processing, then processing speed is improved, but power consumption increases
Solution Approach 1:
The patent segments the frame processing task across multiple smaller rule tables and stages. This allows the system to maintain high processing speeds by distributing work across multiple smaller comparison circuits that consume less power individually, while their combined throughput matches or exceeds that of a single large circuit.
4Ease of operation
If conventional hash table method is used, then address determination is simplified, but hash collision problems occur
Solution Approach 1:
The patent segments the hash table into multiple smaller rule tables and introduces multi-stage processing. This segmentation reduces hash collisions by distributing entries across more tables, and the multi-stage approach allows for collision detection and handling at intermediate stages, maintaining simplicity while improving reliability.
Solution Approach 2:
The patent introduces intermediate processing stages between the hash value generation and final rule retrieval. These intermediate stages act as mediators that can detect and handle collisions before they affect the final result, allowing the system to maintain the simplicity of hash-based addressing while adding reliability through intermediate verification points.
Data Source
Figure 1
Figure 2
Figure 3
AI summary
To realize a low power consumption and a small area of a network communication system and a semiconductor device for mounting the same. In the processing method of the network router or network communication frame, the received frame is input to the hash generator, to obtain an address based on the resulting hash value, the position of the address in the rule table, stores the rule corresponding to the received frame.