This patent document describes failure recovery technologies for the processing of streaming data, also referred to as pipelined data. The technologies described herein have particular applicability in distributed computing systems that are required to process streams of data and provide at-most-once and/or exactly-once service levels. In a preferred embodiment, a system comprises many nodes configured in a network topology, such as a hierarchical tree structure. Data is generated at leaf nodes. Intermediate nodes process the streaming data in a pipelined fashion, sending towards the root aggregated or otherwise combined data from the source data streams towards. To reduce overhead and provide locally handled failure recovery, system nodes transfer data using a protocol that controls which node owns the data for purposes of failure recovery as it moves through the network.

Systems and techniques to upgrade network objects using security islands are described herein. Security islands of node groupings are created based on trust relationships between nodes in an edge network. An upgrade request may be received to upgrade a target edge node in the edge network. Building blocks may be identified for a package installed on the target edge node to be upgraded. A state backup may be stored for the building blocks. An upgrade command and an upgrade payload may be transmitted to the target edge node. The target edge node may be queried to obtain a status of the target edge node. An upgrade action may be determined based on the status and the upgrade action may be executed.

Methods, apparatus, systems, and articles of manufacture are disclosed to manage a self-adaptive heterogeneous emergency network. An example apparatus to establish recovery nodes includes failure detection circuitry to determine a node initiated a reset procedure, override circuitry to suppress a native recovery procedure of the node, formation circuitry to initiate a heterogeneous recovery procedure, and trust circuitry to measure a root of trust of the node. Further, the example apparatus instantiates the formation circuitry further to broadcast heterogeneous recovery packets, and activate listener ports for responses to the heterogeneous recovery packets.

A method for execution of a Byzantine Fault Tolerant (BFT) protocol among a number of participating nodes of a network includes: receiving, by a primary node of the BFT protocol, a transaction request, applying, by the primary node, a data dissemination protocol for distributing the transaction request among the participating nodes via a data-plane of the network, and generating, by the primary node, a hash of the transaction request and requesting consensus among the participating nodes via a control-plane of the network using the hash of the transaction request.

A method for execution of a Byzantine Fault Tolerant (BFT) protocol among a number of participating nodes of a network includes: receiving, by a primary node of the BFT protocol, a transaction request, applying, by the primary node, a data dissemination protocol for distributing the transaction request among the participating nodes via a data-plane of the network, and generating, by the primary node, a hash of the transaction request and requesting consensus among the participating nodes via a control-plane of the network using the hash of the transaction request.

Systems, methods, and computer-readable media for receiving an indication of an equivalence failure, the equivalence failure corresponding to one or more models of network intents. The indication of the equivalence failure is analyzed and one or more constituent intents that caused the equivalence failure are identified, wherein the one or more constituent intents are associated with a model of the one or more models of network intents. The granularity of the equivalence failure and the identified one or more constituent intents is determined, and an event for external consumption is generated, the event based at least in part on the equivalence failure, the granularity of the equivalence failure, and the identified one or more constituent intents.

Systems, methods, and computer-readable media for receiving an indication of an equivalence failure, the equivalence failure corresponding to one or more models of network intents. The indication of the equivalence failure is analyzed and one or more constituent intents that caused the equivalence failure are identified, wherein the one or more constituent intents are associated with a model of the one or more models of network intents. The granularity of the equivalence failure and the identified one or more constituent intents is determined, and an event for external consumption is generated, the event based at least in part on the equivalence failure, the granularity of the equivalence failure, and the identified one or more constituent intents.

Rapid failure detection and recovery in wireless communication networks is needed in order to meet, among other things, carrier class Ethernet transport channel standards. Thus, resilient wireless packet communications is provided using a hardware-assisted rapid transport channel failure detection algorithm and a Gigabit Ethernet data access card with an engine configured accordingly. In networks with various topologies, this is provided in combination with their existing protocols, such as rapid spanning tree and link aggregation protocols, respectively.

Rapid failure detection and recovery in wireless communication networks is needed in order to meet, among other things, carrier class Ethernet transport channel standards. Thus, resilient wireless packet communications is provided using a hardware-assisted rapid transport channel failure detection algorithm and a Gigabit Ethernet data access card with an engine configured accordingly. In networks with various topologies, this is provided in combination with their existing protocols, such as rapid spanning tree and link aggregation protocols, respectively.

Embodiments may relate to pruning a distributed database for a peer-to-peer (P2P) network. A node may transmit a first multicast beacon over the P2P network. The node may receive a unicast synchronization request in response to the first multicast beacon, the unicast synchronization request comprising a removed list for the distributed database. The node may compare the removed list to a locally stored node list to determine a node removal. The node may determine if there is a failure in a node information call made to a node relating to the node removal. The node may, subsequent to a determination of the failure, update the locally stored node list based on the node removal. The node may transmit a second multicast beacon comprising the node removal. Nodes receiving the second multicast beacon may update a locally stored removed list using the node removal.