The present disclosure relates to systems and methods for matching electronic activities with record objects based on entity relationships. The method can include accessing a plurality of electronic activities, identifying an electronic activity, identifying a first participant associated with a first entity and a second participant associated with a second entity, determining whether a record object identifier is included in the electronic activity, identifying a first record object of the system of record that includes an instance of the record object identifier, and storing an association between the electronic activity and the first record object. The method can include determining a second record object corresponding to the second entity, identifying, using a matching policy, a third record object linked to the second record object and identifying a third entity, and storing, by the one or more processors, an association between the electronic activity and the third record object.

The present disclosure relates to systems and methods for matching electronic activities with record objects based on entity relationships. The method can include accessing a plurality of electronic activities, identifying an electronic activity, identifying a first participant associated with a first entity and a second participant associated with a second entity, determining whether a record object identifier is included in the electronic activity, identifying a first record object of the system of record that includes an instance of the record object identifier, and storing an association between the electronic activity and the first record object. The method can include determining a second record object corresponding to the second entity, identifying, using a matching policy, a third record object linked to the second record object and identifying a third entity, and storing, by the one or more processors, an association between the electronic activity and the third record object.

A network traffic device comprising: at least one network device adapted to receive network data packets; wherein said at least one network device filters network data packets to locate at least one identifying packet, and samples said network data packets to select at least one sample packet. The at least one network device may transfer said at least one identifying packet and said at least one sample packet to an analyser. A predetermined sample rate may determine the number of sample packets selected by said at least one network device.

A network traffic device comprising: at least one network device adapted to receive network data packets; wherein said at least one network device filters network data packets to locate at least one identifying packet, and samples said network data packets to select at least one sample packet. The at least one network device may transfer said at least one identifying packet and said at least one sample packet to an analyser. A predetermined sample rate may determine the number of sample packets selected by said at least one network device.

One embodiment of the present invention sets forth a technique for evaluating connections between nodes in a mesh network. The technique includes determining, at a first node, one or more first accumulated message success rates associated with transmitting messages from the first node to a target destination within the mesh network via an established parent node and with receiving messages from the target destination via the established parent node; determining, based on the one or more first accumulated message success rates, that a search for a different parent node should be performed; identifying a plurality of potential parent nodes; computing, for each potential parent node, one or more second accumulated message success rates associated with transmitting messages from the first node to a target destination within the mesh network via the potential parent node and with receiving messages from the target destination via the potential parent node; and based on the second accumulated message success rates, selecting a new parent node from the plurality of potential parent nodes or maintaining the established parent node

A system and a method for performing programmable analytics on network data are described. A data layer constructs flow behavior information based on information present within headers of data packets flowing across one or more network devices configured in a computer network. An inline heuristics layer performs one or more inline heuristic operations on the flow behavior information to obtain aggregate statistical information. An integrated analytics layer performs one or more analytical operations on the flow behavior information to obtain network insights. A presentation layer filters and plots information obtained from the data layer, the inline heuristics layer, and the integrated analytics layer, based on a user input.

A system and a method for performing programmable analytics on network data are described. A data layer constructs flow behavior information based on information present within headers of data packets flowing across one or more network devices configured in a computer network. An inline heuristics layer performs one or more inline heuristic operations on the flow behavior information to obtain aggregate statistical information. An integrated analytics layer performs one or more analytical operations on the flow behavior information to obtain network insights. A presentation layer filters and plots information obtained from the data layer, the inline heuristics layer, and the integrated analytics layer, based on a user input.

A reactive buffering system for use in IIoT data pipelines dynamically adjusts data accumulation and delivery by a node of a pipeline based on aggregated downstream metrics representing current data processing latencies of downstream nodes. Based on these downstream performance metrics, a reactive node that adjusts the size of the next data batch to be sent to an adjacent downstream node. The nodes of the data pipeline are configured to support a request-response based handshaking protocol whereby the nodes that send data to downstream nodes maintain up-to-date performance level information from adjacent downstream nodes. With this performance information, together with pipeline priorities, the sending node (or reactive node) adjusts the transmission rate and intermediate buffering of data. In this way, the nodes of the pipeline can dynamically regulate interim data storage to avoid overwhelming the pipeline system with too much data during periods of high latency.

A reactive buffering system for use in IIoT data pipelines dynamically adjusts data accumulation and delivery by a node of a pipeline based on aggregated downstream metrics representing current data processing latencies of downstream nodes. Based on these downstream performance metrics, a reactive node that adjusts the size of the next data batch to be sent to an adjacent downstream node. The nodes of the data pipeline are configured to support a request-response based handshaking protocol whereby the nodes that send data to downstream nodes maintain up-to-date performance level information from adjacent downstream nodes. With this performance information, together with pipeline priorities, the sending node (or reactive node) adjusts the transmission rate and intermediate buffering of data. In this way, the nodes of the pipeline can dynamically regulate interim data storage to avoid overwhelming the pipeline system with too much data during periods of high latency.

A first correspondence table in a terminal device stores a correspondence between an identifier of a process running on the terminal device and an identifier of a data stream created by the process, a second correspondence table stores a second correspondence between an identifier of an application and an identifier of a process created by the application. The terminal device receives an identifier, sent by a network security device, of a first data stream. The terminal device can find, in the first correspondence table, a first record storing the identifier of the first data stream to obtain an identifier of a process. The terminal device can find in the second correspondence table, a second record storing the identifier of the process in the first record to obtain an identifier of an application from the second record. The identifier of the application is then sent to the network security device.