Methods for balancing storage data traffic in a system in which at least one computing device (server) coupled to a converged network accesses at least one storage device coupled (by at least one adapter) to the network, systems configured to perform such methods, and devices configured to implement such methods or for use in such systems. Typically, the system includes servers and adapters, and server agents implemented on the servers and adapter agents implemented on the adapters are configured to detect and respond to imbalances in storage and data traffic in the network, and to redirect the storage data traffic to reduce the imbalances and, thereby to improve the overall network performance (for both data communications and storage traffic). Typically, each agent operates autonomously (except in that an adapter agent may respond to a request or notification from a server agent), and no central computer or manager directs operation of the agents.

A signature matching hardware accelerator system comprising one or more hardware accelerator circuits, wherein each of the hardware accelerator circuit utilizes a compressed deterministic finite automata (DFA) comprising a state table representing a database of digital signatures defined by a plurality of states and a plurality of characters, wherein the plurality of states are divided into groups, each group comprising a leader state having a plurality of leader state transitions and one or more member states, each having a plurality of member state transitions is disclosed. The hardware accelerator circuit comprises a memory circuit configured to store the leader state transitions within each group of the compressed DFA, only the member state transitions that are different from the leader state transitions for a respective character within each group of the compressed DFA and a plurality of member transition bitmasks associated respectively with the plurality of member state transitions.

A signature matching hardware accelerator system comprising one or more hardware accelerator circuits, wherein each of the hardware accelerator circuit utilizes a compressed deterministic finite automata (DFA) comprising a state table representing a database of digital signatures defined by a plurality of states and a plurality of characters, wherein the plurality of states are divided into groups, each group comprising a leader state having a plurality of leader state transitions and one or more member states, each having a plurality of member state transitions is disclosed. The hardware accelerator circuit comprises a memory circuit configured to store a single occurrence of a most repeated leader state transition within each group, the unique leader state transitions comprising the leader state transitions that are different from the most repeated leader state transition within the respective group; and leader transition bitmasks associated respectively with the leader states within each group.

Systems and related methods include node directed management of multicast traffic within a wireless mesh network. A wireless mesh network may include a plurality of mesh nodes and a central server in communication with at least one of the mesh nodes of the plurality of mesh nodes. The central server may be configured to generate one or more rules for at least one of the mesh nodes to instruct a change in a pre-routing parameter in a packet header based on received channel state information. The central server may include a rules-based engine configured to generate and convey one or more traffic shaping rules in response to sensing traffic conditions. The position of received multicast packets in a packet order may be modified.

It is disclosed a performance measurement application for a user communication device. The device runs at least one user application which exchanges at least one packet flow with a packet-switched communication network. When executed, the performance measurement application receives from an owner of the user communication device a request for performing a performance measurement. In response to such request, the performance measurement application activates a marking functionality comprising marking upstream packets of the packet flow to be measured and inducing the network node originating the downstream packets of the packet flow to be measured to mark them. The performance measurement application then provides performance parameter(s) relating to the marked upstream packets as transmitted and/or the marked downstream packets as received and, based on such parameter(s), provides a performance measurement. The measurement results are then shared with a measurement management server.

It is disclosed a performance measurement application for a user communication device. The device runs at least one user application which exchanges at least one packet flow with a packet-switched communication network. When executed, the performance measurement application receives from an owner of the user communication device a request for performing a performance measurement. In response to such request, the performance measurement application activates a marking functionality comprising marking upstream packets of the packet flow to be measured and inducing the network node originating the downstream packets of the packet flow to be measured to mark them. The performance measurement application then provides performance parameter(s) relating to the marked upstream packets as transmitted and/or the marked downstream packets as received and, based on such parameter(s), provides a performance measurement. The measurement results are then shared with a measurement management server.

Techniques are provided to enable the SMF or other network node performing UPF selection to determine a computational resource demand, also referred to herein as the computational footprint, associated with a PDU session. The computational footprint can then be used by the SMF or other network node to inform the selection of the UPF.

Techniques are provided to enable the SMF or other network node performing UPF selection to determine a computational resource demand, also referred to herein as the computational footprint, associated with a PDU session. The computational footprint can then be used by the SMF or other network node to inform the selection of the UPF.

In one aspect, a computerized method of an application routing service includes the step of using a deep-packet inspection (DPI) technique on a first network flow to identify an applications The method includes the step of storing an Internet-protocol (IP) address and a port number used by the application and an identity of the application in a databases The method includes the step of detecting a second network flow. The method includes the step of identifying the IP address and the port number of the application in the second network flow. The method includes the step of looking up the IP address and the port number in the database. The method includes the step of identifying the application based on the IP address and the port number.

In one aspect, a computerized method of an application routing service includes the step of using a deep-packet inspection (DPI) technique on a first network flow to identify an applications The method includes the step of storing an Internet-protocol (IP) address and a port number used by the application and an identity of the application in a databases The method includes the step of detecting a second network flow. The method includes the step of identifying the IP address and the port number of the application in the second network flow. The method includes the step of looking up the IP address and the port number in the database. The method includes the step of identifying the application based on the IP address and the port number.