SDN Switch Forwarding ID Insertion for Flow Table Optimization
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
In Software Defined Networks (SDNs), existing technologies face challenges in efficiently processing data packets when there is no matched keyword entry in the flow table, leading to increased reliance on controllers for path determination and slower data forwarding.
Innovation Solution
The implementation of a system where SDN switches use ID entries with a Forwarding ID (For ID) to enhance data packet processing speed by inserting this ID into the packet, allowing intermediate nodes to perform rapid forwarding, and the SDN controller generates and distributes these entries across the forwarding path, optimizing flow table usage and reducing processing time.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Speed
If traditional flow table forwarding is used, then the switch can perform fast forwarding for matched packets, but the flow table entries become long and complex when no matched keyword entry exists, reducing forwarding efficiency
Solution Approach 1:
The patent segments the flow table entry into two parts: a keyword part for matching and a Forwarding ID (For ID) part for identification. This segmentation allows the switch to store shorter entries in the flow table while maintaining the ability to perform fast forwarding. The For ID acts as a compact reference that links to the full forwarding path information stored elsewhere, thus reducing the complexity and length of flow table entries.
Solution Approach 2:
The controller performs preliminary action by pre-calculating the forwarding path and generating the For ID before the packet arrives at the switch. This allows the switch to simply match the For ID against the flow table entry and execute the pre-determined forwarding action, eliminating the need for complex real-time path calculation at the switch and improving forwarding speed.
2Measurement precision
If the flow table stores detailed forwarding paths, then accurate routing is achieved, but the entry length increases and search time is extended
Solution Approach 1:
The forwarding path information is segmented into a compact For ID that is stored in the flow table and the complete path information that is stored separately in the controller or routing table. This segmentation allows the flow table to store only the essential matching keywords and short For IDs, significantly reducing entry length and search time, while the complete forwarding path accuracy is maintained through the For ID lookup.
3Reliability
If the switch performs full path determination for each packet, then routing accuracy is maintained, but the processing time increases and controller reliance increases
Solution Approach 1:
The controller performs the time-consuming path determination action in advance, before packets need to be forwarded. It calculates the optimal forwarding path and encodes it into a compact For ID that is then distributed to the switch. This preliminary action allows the switch to perform only simple For ID matching for each packet, maintaining routing accuracy while dramatically reducing processing time and controller reliance for each packet.
Solution Approach 2:
Instead of copying the entire forwarding path into each flow table entry, the system creates a compact copy (the For ID) that references the full path information. This For ID copy is sufficient for the switch to determine the correct forwarding action without needing to store or process the complete path information, thus maintaining routing accuracy while reducing processing overhead.
Data Source
AI summary
A first node receives an original data packet sent from a terminal device. The first node inserts a forwarding identifier into original data packet and forwards the modified data packet to the other node. The other node forwards the data packet according to the forwarding identifier.