SYSTEM AND METHOD FOR FLOW TABLE MANAGEMENT

• US 20120213074A1
• Filed: 01/25/2012
• Published: 08/23/2012
• Est. Priority Date: 01/27/2011
• Status: Active Grant

• Current Assignee: Cognyte Technologies Israel Ltd. (Cognyte Software Ltd.)
• Original Assignee: Verint Systems Limited (Verint Systems Incorporated)
• Inventors: Goldfarb, Eithan, Altman, Yuval, Yaari, Gur, Frid, Naomi
• Granted Patent: US 8,767,551 B2
• Time in Patent Office: Days
• US Class Current: 370/235
• CPC Class Codes: H04L 43/026 using flow identification
• CPC Class Codes: H04L 47/2441 relying on flow classification, e.g. using integrated services [IntServ]
• CPC Class Codes: H04L 63/1416 Event detection, e.g. attack signature detection

Abstract

Methods and systems for managing the actions that are applied to packet flows by packet processing systems. A packet processing system maintains a flow table, i.e., a list of active flows and respective actions to be applied to the flows. The system classifies each incoming packet into a respective flow, and processes the packet in accordance with the action that is specified for this flow in the flow table. Typically, the system deletes a packet flow from the flow table when it becomes inactive, e.g., when no packets belonging to the flow arrive within a certain time-out period.

Claims

1. A method, comprising:

in a system that processes communication packets, maintaining a list of active packet flows and respective actions that are specified for application to the packet flows;

classifying input packets into the packet flows, and applying to each input packet a respective action in accordance with the list;

defining different respective time-out periods for different ones of the packet flows on the list; and

upon detecting that no packet belonging to a given packet flow was accepted within a respective time-out period of the given packet flow, deleting the given packet flow from the list of the active flows.

2. The method according to claim 1, wherein maintaining the list comprises storing, for each packet flow, a respective time stamp that indicates a respective time at which a most recent packet belonging to the packet flow was accepted, and wherein detecting that no packet was accepted within the time-out period comprises comparing a current time to the respective time stamp of the given packet flow.

3. The method according to claim 1, wherein maintaining the list comprises storing the time-out periods on the list in association with the respective packet flows.

4. The method according to claim 1, wherein defining the time-out periods comprises applying a predefined criterion to the respective packet flows.

5. The method according to claim 1, wherein defining the time-out periods comprises setting the time-out periods based on respective protocol types used for sending the respective packet flows.

6. The method according to claim 1, wherein defining the time-out periods comprises setting the time-out periods based on respective application types whose data are conveyed by the respective packet flows.

7. The method according to claim 1, wherein, for a first packet flow having a first characteristic inter-packet interval and a second packet flow having a second characteristic inter-packet interval that is larger than the first characteristic inter-packet interval, defining the time-out periods comprises setting respective first and second time-out periods for the first and second packet flows, such that the second time-out period is longer than the first time-out period.

8. The method according to claim 1, and comprising selecting the given packet flow for evaluation of the time-out period based on a predefined selection criterion.

9. The method according to claim 8, wherein maintaining the list comprises representing the list by a hash table, wherein classifying the input packets comprises computing a respective hash index for each input packet and accessing the hash table using the hash index, and wherein the selection criterion specifies, upon receiving a given input packet having a given hash index, selection of one or more of the packet flows corresponding to the given hash index.

10. A method, comprising:

in a system that processes communication packets, maintaining a set of packet processing rules and a list of packet flows;

based on the rules, defining respective actions for application to the packet flows;

accepting a change in the packet processing rules;

classifying an input packet into a packet flow from the list;

verifying that a respective action applicable to the packet flow matches the packet processing rules only upon arrival of a first packet belonging to the packet flow following the change in the packet processing rules; and

applying the verified action to the input packet.

11. The method according to claim 10, wherein maintaining the list comprises storing respective time stamps that indicate respective times at which most recent packets belonging to the respective packet flows were accepted, and wherein verifying that the action matches the rules comprises comparing the action to the rules only when a respective time stamp of the packet flow is later than an occurrence time of the change in the rules.

12. The method according to claim 11, and comprising updating the action on the list upon detecting that the respective time stamp of the packet flow is earlier than the occurrence time of the change

13. Apparatus, comprising:

a memory, which is configured to hold a list of active packet flows and respective actions that are specified for application to the packet flows; and

processing circuitry, which is configured to maintain the list, to classify input packets into the packet flows, to apply to each input packet a respective action in accordance with the list, to define different respective time-out periods for different ones of the packet flows on the list, and, upon detecting that no packet belonging to a given packet flow was accepted within a respective time-out period of the given packet flow, to delete the given packet flow from the list of the active flows.

14. The apparatus according to claim 13, wherein the processing circuitry is configured to store on the list, for each packet flow, a respective time stamp that indicates a respective time at which a most recent packet belonging to the packet flow was accepted, and to detect that no packet was accepted within the time-out period by comparing a current time to the respective time stamp of the given packet flow.

15. The apparatus according to claim 13, wherein the processing circuitry is configured to store the time-out periods on the list in association with the respective packet flows.

16. The apparatus according to claim 13, wherein the processing circuitry is configured to define the time-out periods by applying a predefined criterion to the respective packet flows.

17. The apparatus according to claim 13, wherein the processing circuitry is configured to set the time-out periods based on respective protocol types used for sending the respective packet flows.

18. The apparatus according to claim 13, wherein the processing circuitry is configured to set the time-out periods based on respective application types whose data are conveyed by the respective packet flows.

19. The apparatus according to claim 13, wherein, for a first packet flow having a first characteristic inter-packet interval and a second packet flow having a second characteristic inter-packet interval that is larger than the first characteristic inter-packet interval, the processing circuitry is configured to set respective first and second time-out periods for the first and second packet flows, such that the second time-out period is longer than the first time-out period.

20. The apparatus according to claim 13, wherein the processing circuitry is configured to select the given packet flow for evaluation of the time-out period based on a predefined selection criterion.