Abstract: The present disclosure relates to a method of a device of communicating data states of a Conflict-free Replicated Data Type (CRDT) structure over a plurality of other devices in a network of devices.

Abstract: A method performed by a computer to update a runtime environment of an application of the computer via a communications network, wherein a filesystem of the runtime environment comprises one or more layers, wherein at least one layer of the one or more layers comprises a link layer formed by a plurality of packages and wherein the link layer comprises symbolic links indicative of the packages forming an updated layer. The method comprising receiving, from a user device or from a scheduling unit, a first signal indicative of a command to use the updated layer of the one or more layers, obtaining the updated layer, obtaining packages forming the updated layer, from a local cache or from a shared storage or from an image repository node, and updating the runtime environment by replacing a layer of the one or more layers with the updated layer using the obtained packages.

Abstract: The present disclosure relates to a method performed by a process control node (210) configured to allocate resources shared by a plurality of tenant applications, wherein each tenant application comprises a selection of non real-time processes and real-time processes, the method comprising receiving a first resource request, from a tenant application, indicative of resources requested to be allocated, by the process control node, for one or more real-time processes of the tenant application, evaluating a scheduling test to determine if the set of processing resources can be allocated from the shared resources by determining if resources requested by the first resource request can be allocated, and if it is determined that the requested resources can be allocated from the shared resources, the method further comprises performing the steps starting the one or more real-time processes of the tenant application within a resource partition of the tenant application, calculating updated resource quotas and priorit

Abstract: A processor implemented method for monitoring the performance of a message queue for communication between processes is described. The method includes, by an initiating process, publishing a trigger message to a first topic in the message queue, wherein the trigger message identifies one or more performance metrics and at least two processes that communicate via the message queue. The method further includes, by one or more of the at least two processes, retrieving the trigger message from the first topic in the message queue; performing a measurement on one or more messages exchanged between the processes over the message queue, wherein the measurement determines the one or more performance metrics; and publishing the one or more determined performance metrics to a second topic in the message queue. The method also includes, at a receiving process, retrieving the published performance metrics from the second topic in the message queue.

Abstract: A processor implemented method for monitoring the performance of a message queue for communication between processes is described. The method includes, by an initiating process, publishing a trigger message to a first topic in the message queue, wherein the trigger message identifies one or more performance metrics and at least two processes that communicate via the message queue. The method further includes, by one or more of the at least two processes, retrieving the trigger message from the first topic in the message queue; performing a measurement on one or more messages exchanged between the processes over the message queue, wherein the measurement determines the one or more performance metrics; and publishing the one or more determined performance metrics to a second topic in the message queue. The method also includes, at a receiving process, retrieving the published performance metrics from the second topic in the message queue.

Abstract: Failure detection and traffic redirection are implemented in an OpenFlow switch. Link failure detection packets, such as Bidirectional Forwarding Detection (BFD) packets, are periodically sent out on links to peer OpenFlow switches, such as via the Multi-protocol Label Switching (MPLS) Transport Profile (MPLS-TP). Link failure detection packets are received from the peer OpenFlow switches on the links, and monitored. A link failure is detected if no incoming link failure detection packets are received on a link for a predetermined interval. In the event of a link failure, traffic is redirected from the failed link to a backup link by altering entries on a flow table of the OpenFlow switch.

Abstract: Failure detection and traffic redirection are implemented in an OpenFlow switch. Link failure detection packets, such as Bidirectional Forwarding Detection (BFD) packets, are periodically sent out on links to peer OpenFlow switches, such as via the Multi-protocol Label Switching (MPLS) Transport Profile (MPLS-TP). Link failure detection packets are received from the peer OpenFlow switches on the links, and monitored. A link failure is detected if no incoming link failure detection packets are received on a link for a predetermined interval. In the event of a link failure, traffic is redirected from the failed link to a backup link by altering entries on a flow table of the OpenFlow switch.