Flow Communication System Packet Processing Segmentation

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Existing flow communication systems, such as OpenFlow, cannot perform different packet processing operations for a sequence of packets belonging to the same single flow, limiting flexibility in handling various messages within a single flow.

Innovation Solution

Introducing a new deletion condition based on the sum of packet lengths, where a flow entry is deleted from the flow table when the total packet length exceeds a predetermined deletion unit length specific to each message, allowing for different packet processing actions for each message within a single flow.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Adaptability or versatility

If a single flow entry is used to handle all packets in a flow, then packet processing is simple and efficient, but different packet processing operations cannot be performed for different messages within the same flow

Engineering Contradiction:
Improvepacket processing flexibilityVSAvoidflow table management complexity
Core Design Contradiction:
Adaptability or versatilityVSDevice complexity

Solution Approach 1:

The patent segments a single flow entry into multiple flow entries, each corresponding to a specific message within the flow. When a packet arrives, the system determines whether it belongs to a new message or an existing message, and selects or creates appropriate flow entries accordingly. This segmentation enables different packet processing operations for different messages while maintaining efficient handling within each message context.

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The patent introduces dynamic flow entry management where flow entries are created, updated, and deleted based on message boundaries and packet characteristics. The system dynamically adjusts the number and content of flow entries according to the actual message structure within the flow, allowing flexible adaptation to varying message lengths and types while optimizing resource utilization.

Inventive Principle:
Principle #15Dynamics

2Reliability

If flow entries are deleted based on time-out values, then memory resources are freed, but flow entries may be deleted before processing is complete for variable-length messages

Engineering Contradiction:
Improvepacket processing completenessVSAvoidflow entry retention time
Core Design Contradiction:
ReliabilityVSLoss of time

Solution Approach 1:

The patent implements feedback mechanisms where the system continuously monitors packet processing status and message completion status. Based on this feedback, the system determines whether to retain or delete flow entries. The deletion decision is made only when the message processing is confirmed complete, ensuring no incomplete processing occurs while optimizing memory usage by deleting entries promptly after completion.

Inventive Principle:
Principle #23Feedback

Solution Approach 2:

The patent establishes preliminary conditions for flow entry deletion by setting deletion criteria based on message length and processing status before actual deletion occurs. The system pre-determines the appropriate retention period and deletion timing based on message characteristics, ensuring that flow entries are retained long enough to complete processing but deleted promptly afterward to free resources.

Inventive Principle:
Principle #10Preliminary action

Data Source

PatentEP2676410B1Flow communication system
Publication Date: 2016.01.06 NEC CORP
  • EP2676410B1 patent drawingFigure 1
  • EP2676410B1 patent drawingFigure 2~3
  • EP2676410B1 patent drawingFigure 4

AI summary

A flow communication system has: a node having a flow table; and a controller configured to set a flow entry in the flow table. Each flow entry that is set in the flow table specifies packet processing which is performed with respect to a packet matching a match condition. If a hit entry exists in the flow table, the node performs the packet processing specified by the hit entry with respect to a received packet. If a deletion condition with regard to a first flow entry in the flow table is satisfied, the node deletes the first flow entry from the flow table. The deletion condition includes that a sum of packet lengths of all the received packets matching the first flow entry after the first flow entry is set up exceeds a predetermined deletion unit length.