A method is implemented by a network device where the method performs a trace flow process in a packet processing pipeline of the network device. The packet processing pipeline includes a trace table and a forward table. The method encompasses forwarding a trace packet to the trace table, forwarding a copy of the trace packet to a trace analyzer in response to determining that a trace bit is set in the trace packet, forwarding the trace packet to the forward table, and determining a next stage of the packet processing pipeline based on trace packet meta data and a value stored in a trace register.

A computation is divided into computation tasks that are sent to worker nodes and distributed results are received in response. A redundant subtask is sent to each of the worker nodes, the redundant subtask being a random linear combination of the computation tasks sent to others of the worker nodes. The worker nodes perform the redundant subtasks to produce redundant results. The redundant result of each worker node is combined with distributed results of others of the worker nodes to determine whether one or more of the worker nodes are acting maliciously. Optionally, the worker nodes can be initially evaluated for trustworthiness using a homomorphic hash function applied to an initial computation task and applied to results of the initial tasks. If the results of both hash functions match, then the worker nodes are considered trustworthy and can be used for subsequent computations with redundant subtasks as described above.

In one embodiment, a method selects a percentage of a plurality hosts that are coupled together via a network fabric and calculates a number of workloads needed for the percentage of hosts based on a benchmark test to run. A plurality of data compute nodes are configured on one or more host pairs in the percentage of the plurality of hosts to send and receive the number of workloads through the network fabric to perform the benchmark test. A set of measurements is received for sending and receiving the workloads through the network fabric using the plurality of data compute nodes. The method increases the percentage of the plurality of hosts until the set of measurements fails a criteria or the percentage of the plurality of hosts is all of the plurality of hosts.

Instantiating a Network Service described by a Forwarding Graph comprising Virtual Network Functions, VNF instances, which are interconnected via communication links. This includes splitting the Forwarding Graph into n VNF Elementary Graphs, VNF EGs. Each of the VNF EGs for a VNF Instance includes routing information for forwarding, by that VNF instance and to another VNF instance, packets output by that VNF instance based on a packet class identifier included in the packet. Each of the VNF EGs is transmitted to the corresponding VNF instance for that VNF EG. Each of the VNF instances, when outputting a packet handled by it, then transmits the packet to a next VNF instance based on the packet class identifier included in the packet.

There is provided mechanisms for discovering, for data collection, which NEF or AF is serving a UE. A method is performed by an NWDAF entity. The method comprises providing, to a 5GC network function entity, a query of which NEF or AF is serving the UE. The method comprises receiving, from the 5GC network function entity, a response comprising an ID of the NEF or the AF when there is a NEF or AF instance stored in the 5GC network function entity for the UE.

There is provided mechanisms for discovering, for data collection, which NEF or AF is serving a UE. A method is performed by an NWDAF entity. The method comprises providing, to a 5GC network function entity, a query of which NEF or AF is serving the UE. The method comprises receiving, from the 5GC network function entity, a response comprising an ID of the NEF or the AF when there is a NEF or AF instance stored in the 5GC network function entity for the UE.

Method and system are provided for scoring events as likely cause events in a resource network. The method processes incoming events relating to resources in a resource network to correlate related events as a related group and maps the events of the related group onto nodes of a sub-topology representing resources of the resource network and having edges representing relationships between the resources. The method scores each event by discovering one or more paths between the node event and other node events of the related group, with the scoring based on a combination of an event classification weight and a discovered path score of aggregated relationship scores of edges of a discovered path.

Agentless method to automatically detect low latency groups in containerized infrastructures includes obtaining information about communication across workloads within a cluster of containers implemented by an operating environment. The information identifies multiple pairs of containers. Each pair includes a network source container and a corresponding network destination container. The information includes, for each pair of containers, a corresponding latency associated with a network call between the network source container and the corresponding network destination container. An undirected graph is generated using the obtained information. The undirected graph represents a node-wide latency within the cluster. Using the undirected graph, nodes within the cluster with a latency less than a threshold latency level are grouped. Grouped nodes with latencies less than the threshold latency level are provided

A method includes obtaining, by a management device, sub-interface information that includes a correspondence between an identifier of a first sub-interface of a first device and a first network slice identifier, a correspondence between an identifier of a second sub-interface of a second device and a second network slice identifier, and information indicating that the first sub-interface is directly connected to the second sub-interface, and determining, by the management device, a network slice topology based on the obtained sub-interface information.

Systems and methods of cloud deployment optimization are disclosed. In some example embodiments, a method comprises running original instances of an application concurrently on original servers to implement an online service, receiving, by the original instances of the application original requests for one or more functions of the online service, receiving a command to deploy a number of additional instances of the application, transmitting synthetic requests for the function(s) of the online service to one of the original servers according to a predetermined optimization criteria, deploying the number of additional instances of the application on additional servers using a copy of the original instance of the application, and running the deployed additional instances of the application on their corresponding additional servers concurrently with the original instances of the application being run on their corresponding original servers.