Abstract: A non-transitory computer readable medium storing instructions which, when executed by one or more hardware processors, causes performance of operations including: performing, by a controller, one or more processing actions for data corresponding to a particular session associated with a client device; identifying one or more characteristics corresponding to the particular session; based on the one or more characteristics corresponding to the particular session: selecting a network device, other than the controller, to perform the one or more processing actions for the data corresponding to the particular session; causing the network device to perform the one or more processing actions, for the data corresponding to the particular session, instead of the controller.

Abstract: A non-transitory computer readable medium storing instructions which, when executed by one or more hardware processors, causes performance of operations including: performing, by a controller, one or more processing actions for data corresponding to a particular session associated with a client device; identifying one or more characteristics corresponding to the particular session; based on the one or more characteristics corresponding to the particular session: selecting a network device, other than the controller, to perform the one or more processing actions for the data corresponding to the particular session; causing the network device to perform the one or more processing actions, for the data corresponding to the particular session, instead of the controller.

Abstract: Allocation of buffer space for segment re-ordering is restricted based on a probability that the flow would consume too much space. A flow's current or recently past space consumption is used to predict the flow's activity with respect to future consumption. If the prediction of future consumption is high relative to other flows and to the total allocable buffer space in the device, then a decreasing amount of space than would otherwise be provided is allocated to the flow. In a preferred embodiment, if a flow's buffers are below a predetermined threshold for the flow (i.e., the “flow threshold”), and the amount of overall system memory space is above a predetermined system threshold then buffer allocation can proceed normally for that flow. For example, all of an additional amount of space that the flow may currently be requesting can be allocated to the flow.

Abstract: Embodiments of the invention are directed to systems that detect maliciously formed TCP/IP retransmit packets attempting to pass through an intrusion detection system (IDS) and prevent them from reaching their destination by forcing early flow termination. The IDS may be configured to track a hash of certain fields in each packet. This set of hashes is maintained for all of the packets in the currently open TCP window for each flow. If the hash of a retransmit packet does not match the cached hash of the corresponding original packet, the system concludes that there is an attack under way and terminates the flow. The hash function may range in complexity and security from low complexity and relative insecurity to high complexity and high security. Hash algorithms may also be used in conjunction with a private seed value concatenated with the packet fields prior to hashing.

Abstract: A switch including circuitry and methods for decreasing latency associated with initiating Internet communications are disclosed. The switch includes a host processor and a transport subsystem that receives incoming data and sends outgoing data. The switch also has a semantic processor. The semantic processor anticipates real-time communication by analyzing the incoming data for specific types of data from a first user in order to instruct the host processor to pre-fetch data needed to initiate real-time communications with a second user. The pre-fetching of the data needed to initiate real-time communications decreases the latency associated with establishing communications between the first user and the second user.

Abstract: A processing system wherein a bitmap array is first used to obtain an index. The index is used to obtain a value from an array. A predefined default value is used to improve compression and speed in cases where a single default value is often encountered. In this embodiment the size of each entry in the bitmap array is one bit. In another approach, a bitmap array having two bit entries is provided. The use of two bits allows four different entry values. Two values are used to indicate two different default values. A third value is used for a “repeat” indicator to when the last-used next-state value should be re-used. The fourth value is used to indicate indexing into a pointer table, similarly to the embodiment using single-bit entries in the bitmap array.

Abstract: Allocation of buffer space for segment re-ordering is restricted based on a probability that the flow would consume too much space. A flow's current or recently past space consumption is used to predict the flow's activity with respect to future consumption. If the prediction of future consumption is high relative to other flows and to the total allocable buffer space in the device, then a decreasing amount of space than would otherwise be provided is allocated to the flow. In a preferred embodiment, if a flow's buffers are below a predetermined threshold for the flow (i.e., the “flow threshold”), and the amount of overall system memory space is above a predetermined system threshold then buffer allocation can proceed normally for that flow. For example, all of an additional amount of space that the flow may currently be requesting can be allocated to the flow.