Various systems and methods may be used to implement a software defined industrial system. For example, an orchestrated system of distributed nodes may run an application, including modules implemented on the distributed nodes. The orchestrated system may include an orchestration server, a first node executing a first module, and a second node executing a second module. In response to the second node failing, the second module may be redeployed to a replacement node (e.g., the first node or a different node). The replacement mode may be determined by the first node or another node, for example based on connections to or from the second node.

An example operation may include one or more of receiving, by a lead peer, a new block from an orderer node over a blockchain network that includes a plurality of peers, acquiring, by the lead peer, a shared memory handler for a channel of the blockchain network from an anchor peer, appending, by the lead peer, the new block to a shared memory buffer based on the handler, and notifying the plurality of the peers that the new block is available on the shared memory buffer.

A node of an LSP may inform the ingress node of the LSP, for example via RSVP signaling, about its temporary unavailability for a certain time. In response, the ingress node can stop using any affected LSP(s) and divert the traffic to other LSPs. This provides a faster mechanism to signal traffic shift then traditional IGP overload which causes considerable churn into the network as all the nodes need to compute the SPF. It is sufficient for ingress node to be aware of this node maintenance and it can use information to divert the traffic to other equal cost multipath (ECMP) LSP(s), or other available LSP(s). If no alternative LSP path exists when the ingress node receives such a message, a new LSP can be built during this time and traffic diverted smoothly (e.g., in a make-before-break manner) before the node goes offline for maintenance. Since only the ingress node is responsible to push the traffic to the LSP, there is no need to tear down the LSP for such node maintenance (especially when they are for a short duration). This can be used with a controller responsible for the LSP as well.

Systems and methods are provided to process an event stream using nodes arranged as a cluster in which the nodes are in a leader-follower relationship with one node being the leader at any given time. Tracking of node membership and leadership status can be conducted in a manager node for a variety of applications. Each node of the cluster can register in the manager node and can receive the same set of event streams as the other nodes of the cluster. The leader node can process an event of an event stream with the follower nodes tracking the processing by the leader node, where the leader node can publish the processed event. Leadership can be changed from the leader node to another node of the cluster based on a performance criterion of the leader node. Additional systems and methods can be implemented in a variety of applications.

Various embodiments relate to a wired local area network (WLAN) including a shared transmission medium (e.g., a 10SPE network). A method may include detecting an event in a WLAN including physical level collision avoidance (PLCA). The method may also include disabling a beacon of a first node operating as a master of the WLAN in response to the event. Further, the method may include enabling a second node to operate as the master of the WLAN.

The current disclosure is directed towards efficiently generating random sequences on a large-scale peer-to-peer network. In one example, the disclosure provides for selecting a first node based on a block generation order, where the first node is selected to generate a current block, adding a first signature share of the first node to the current block, adding at least a second signature share from a previously selected node to the current block, generating a random sequence based on the first signature share and the second signature share, adding the random sequence to the current block, and publishing the current block to a blockchain maintained by a node pool. In this way, a random sequence may be generated on-chain, with linear messaging complexity, without relying on a single trusted party/apparatus, which may thereby decrease a probability of any single party controlling the random sequence produced.

Various systems and methods for implementing a software defined industrial system are described herein. For example, an orchestrated system of distributed nodes may run an application, including modules implemented on the distributed nodes. In response to a node failing, a module may be redeployed to a replacement node. In an example, self-descriptive control applications and software modules are provided in the context of orchestratable distributed systems. The self-descriptive control applications may be executed by an orchestrator or like control device and use a module manifest to generate a control system application. For example, an edge control node of the industrial system may include a system on a chip including a microcontroller (MCU) to convert IO data. The system on a chip includes a central processing unit (CPU) in an initial inactive state, which may be changed to an activated state in response an activation signal.

Various systems and methods may be used to implement a software defined industrial system. For example, an edge control node of the industrial system may include a system on a chip including a microcontroller (MCU) to convert IO data. The system on a chip includes a central processing unit (CPU) in an initial inactive state to receive an activation signal from, for example, an orchestration server, and change to an activated state in response to receiving the activation signal.

Provided is a method of synchronizing a plurality of user terminals based on peer-to-peer (P2P) communication, the method including occurring a first state change in a first user terminal, generating first action information corresponding to the first state change in the first user terminal, transmitting the first action information from the first user terminal to a second user terminal, receiving the first action information in the second user terminal, adding the first action information to an application ready queue in the second user terminal, detecting whether a divergence or a causality violation occurs in the second user terminal, and applying a state change based on the first action information in the second user terminal.

The current disclosure is directed towards efficiently generating random sequences on a large-scale peer-to-peer network. In one example, the disclosure provides for selecting a first node based on a block generation order, where the first node is selected to generate a current block, adding a first signature share of the first node to the current block, adding at least a second signature share from a previously selected node to the current block, generating a random sequence based on the first signature share and the second signature share, adding the random sequence to the current block, and publishing the current block to a blockchain maintained by a node pool. In this way, a random sequence may be generated on-chain, with linear messaging complexity, without relying on a single trusted party/apparatus, which may thereby decrease a probability of any single party controlling the random sequence produced.