As disclosed herein a computer system for secure database backup and recovery in a secure database network has N distributed data nodes. The computer system includes program instructions that include instructions to receive a database backup file, fragment the file using a fragment engine, and associate each fragment with one node, where the fragment is not stored on the associated node. The program instructions further include instructions to encrypt each fragment using a first encryption key, and store, randomly, encrypted fragments on the distributed data nodes. The program instructions further include instructions to retrieve the encrypted fragments, decrypt the encrypted fragments using the first encryption key, re-encrypt the decrypted fragments using a different encryption key, and store, randomly, the re-encrypted fragments on the distributed data nodes. A computer program product and method corresponding to the above computer system are also disclosed herein.

A method is provided of managing a non-static collection of machines. A first client machine runs a first communication protocol. The non-static collection of machines includes a first linear communication orbit, the first linear communication orbit comprising a sequence of machines that run the first communication protocol, and a second linear communication orbit, the second linear communication orbit comprising a sequence of machines that run a second communication protocol distinct from the first communication protocol. The first client machine receives an instruction from a server to install the second communication protocol, installs the second communication protocol, and then submits a registration request to the server. The first client machine receives, from the server, contact information of a list of potential neighbors. The first client machine then, proactively constructs and maintains a respective local segment of the second linear communication orbit.

This disclosure relates to data processing method and apparatus based on a blockchain network. The method may include receiving a data acquisition request transmitted by a target service node. The data acquisition request may carry a data type of data requested by the target service node and a data identifier set. The method may further include determining a target node set from the nodes in the blockchain network according to the data type, the data identifier set, and recorded data storage information of the nodes. The method may further include transmitting feedback information carrying the node information in the target node set to the target service node. The feedback information is for instructing the target service node to acquire the requested data from a node according to the node information in the target node set.

Methods, computer readable media, and devices for securely managing interactions between distributed components are provided. One method may include generating a first interaction identifier based on a first component identifier and data to be shared with a second component, storing the first interaction identifier in an interaction data store of the first component, sending a request to the second component including the first component identifier, the first interaction identifier, and the data to be shared with the second component, creating a graph node in an interaction relationship data store based on the first interaction identifier, receiving a response from the second component including a second component identifier, a second interaction identifier, and response data, and adding a relationship edge in the interaction relationship data store connecting the graph node based on the first interaction identifier with a graph node based on the second interaction identifier.

A method for storing of at least one dataset in a distributed data processing network includes: sending, from a specific network node to all close network nodes, an ADD message for adding a value to a dataset, wherein the ADD message comprises the key of the dataset and the value to be added; based on a close network node receiving the ADD message and the key not being known to the close network node, creating a new dataset in an internal table of the close network node comprising the key and the value; and based on the close network node receiving the ADD message and the key being known to the close network node, adding the value to the one or more values in the dataset of the key in the internal table of the close network.

A specialized network (“merchant”) node to facilitate fast distribution of blockchain transactions over a network of interconnected nodes, as subset of which are merchant nodes interconnected by an overlay network. The merchant node includes a memory storing an assigned portion of a distributed mempool structured as a distributed hash table, the distributed mempool containing pending transactions awaiting confirmation. The merchant node operates by receiving a transaction, including a transaction identifier; hashing the new transaction identifier to obtain a key; determining, using the key, whether the transaction is stored in the distributed mempool or not and, if not, then storing the transaction in the distributed mempool as a pending transaction; and sending the transaction to a set of nodes other than merchant nodes using peer-to-peer connections. The invention may be used in conjunction with the Bitcoin blockchain or an alternative.

A human-cyber-physical resource-oriented adaptive construction method and apparatus for a structured peer-to-peer (P2P) network are provided. The structured P2P network is a point-to-point network with physical perception information and can be effectively used in a human-cyber-physical fusion scenario. The method includes: using a grid aggregation algorithm to calculate the latitude and longitude coordinates of a new node to acquire a position hash value of the new node; determining, according to the position hash value, a registration node of the new node from the existing nodes of the structured P2P network; and completing, according to the information returned by the registration node to the new node, registration of the new node, thereby resulting adding of the registered new node into the structured P2P network.

System and techniques for a hierarchical resource constrained networks are described herein. Device participating in the network are divided into groups. These groups correspond to vertices in a routing graph. A leader is selected amongst the devices in each group to function as a routing node connecting to other vertices of the routing graph. Client devices attach to leaf vertices in the routing graph. To reduce overhead in placing devices into the routing pools, a distributed hash table (DHT) can be used. Here, the routing pools can be given DHT IDs based on, for example, a structure of the routing graph. Device DHT IDs are used to assign them to the routing pools based on a distance metric. Routing, in this arrangement, can use the DHT IDs to efficiently compute routing pool hops when routing messages. This arrangement works well for publication-subscription (pub-sub) services.

Systems and methods for beacon orchestration for concurrent collaboration sessions in peer-to-peer (P2P) or mesh networks are described. In some embodiments, an Information Handling System (IHS) may include a processor and a memory coupled to the processor, the memory having program instructions stored thereon that, upon execution, cause the IHS to: detect a first multicast collaboration beacon (MCB) in a P2P or mesh network comprising two or more IHSs; identify a first collaboration session between the two or more IHSs based upon the first MCB; and transmit a second MCB configured, based at least in part upon the first MCB, to orchestrate a second collaboration session in the P2P or mesh network.

A method and system for accessing a digital object in a Human-Cyber-Physical environment are provided. A P2P network is established based on a distributed hash table (DHT); a Kademlia algorithm is used to establish a forward routing table corresponding to each node; and an index binary tree is established according to a logical distance between each node in the forward routing table and a target node. In a process of transmitting a message from a node of a storage digital object to a root node, all nodes that the message passes establish backward routing tables for the digital object, so that in a data query stage, target data may be found from any node through the forward routing table and the backward routing table, and a data identifier of a data entity in the DHT-based P2P network from a storage location of the data identifier may be decoupled.