H04L67/1048

Secure data dissemination

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.

Signaling a planned off-lining, such as for maintenance, of a node or node component supporting a label switched path (LSP), and using such signaling
11032192 · 2021-06-08 · ·

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.

Data-interoperability-oriented trusted processing method and system

A data-interoperability-oriented trusted processing method and system applied to a P2P network system are provided. The P2P network system includes a plurality of nodes. The trusted processing method includes a storage method and a query method. Firstly, a directed acyclic graph ledger structure is employed to be matched with an nRW consensus mechanism during a storage process, so that a supervision problem in a large-scale sharing exchange process is solved. Secondly, in a query process, a P2P network system is optimized by maintaining a tree structure with high fault tolerance and load balance through a hop optimization method to construct the P2P network system with a relatively balanced network, so that a query delay is not greatly influenced on the premise of ensuring the load balance, and an expandability of the system is ensured.

DATA-INTEROPERABILITY-ORIENTED TRUSTED PROCESSING METHOD AND SYSTEM

A data-interoperability-oriented trusted processing method and system applied to a P2P network system are provided. The P2P network system includes a plurality of nodes. The trusted processing method includes a storage method and a query method. Firstly, a directed acyclic graph ledger structure is employed to be matched with an nRW consensus mechanism during a storage process, so that a supervision problem in a large-scale sharing exchange process is solved. Secondly, in a query process, a P2P network system is optimized by maintaining a tree structure with high fault tolerance and load balance through a hop optimization method to construct the P2P network system with a relatively balanced network, so that a query delay is not greatly influenced on the premise of ensuring the load balance, and an expandability of the system is ensured.

Method for Changing Member in Distributed System and Distributed System
20210136145 · 2021-05-06 ·

A method for changing a member in a distributed system, includes requesting, by a first target node, a node address set from a management server, where the node address set includes first addresses of all nodes in the distributed system, sending, by the first target node, a join request to a master node in the distributed system when the node address set does not comprise a second address of the first target node, adding, by the master node, the second address to the node address set, and instructing all slave nodes in the distributed system to add the second address to a corresponding local member list.

Complex computing network for handling dropping of users during an audio conversation on a mobile application

Systems, methods, and computer program products are provided for handling dropping of users during audio conversations. For example, a method comprises: establishing on a mobile application, an audio conversation between a first user and a second user; broadcasting the audio conversation to a third user who accesses the mobile application on a mobile device; transmitting to the mobile device for visual display, during the audio conversation, on the user interface of the mobile application on the mobile device, a visual representation of the second user; determining the second user is no longer present in the audio conversation, wherein the second visual representation of the second user is removed from the user interface of the mobile application on the mobile device when the second user is no longer present in the audio conversation; and searching for a new user to add to the audio conversation.

Asset management block chain
11057462 · 2021-07-06 · ·

Apparatus and methods for establishing a permissioned blockchain on an Internet of Things (IoT) system. The method may be performed by a central IoT hub. The method may include identifying a IoT nodes associated with the IoT system. The method may also include running an authentication routine on the identified IoT nodes. The method may further include identifying a subset of the IoT nodes that have been authenticated by the authentication routine. The method may further include grouping the subset of IoT nodes into a first group of IoT nodes and a second group of IoT nodes, the grouping being based at least in part on available storage space and processing speed of each of the subset of IoT nodes.

METHOD AND FIRST NODE FOR MANAGING TRANSMISSION OF PROBE MESSAGES
20210014145 · 2021-01-14 ·

A method and a first node for managing transmission of at least one probe message for detection of failure of a second node are disclosed. A network comprises the first and second nodes. The first node receives a message about an event related to the second node. The message comprises an identifier of the second node and an event type of the event. The first node retrieves at least one policy for failure detection based on the event type. The first node modifies a probe list based on said at least one policy with respect to the second node. The probe list indicates an order in which nodes, neighbouring to the first node, are to be probed by transmission of the probe messages thereto. The second node is one of the nodes neighbouring to the first node. The first node transmits the probe messages according to the probe list.

REBALANCE METHOD FOR BLOCKCHAIN-BASED DECENTRALIZED FILE SYSTEM
20240004842 · 2024-01-04 ·

A rebalance method for blockchain-based decentralized file system is provided, and the method includes an encoded data rebalance method of a deleted node, and the encoded data rebalance method of the deleted node includes: broadcasting a codeword of the deleted node to all remaining nodes when one node of a node set is deleted; and decoding based on a current storage content and the codeword transmitted from the deleted node by each remaining node using a decoding function to obtain a data packet of each remaining node, and storing the data packet into each remaining node, to thereby generating a distributed target file storage system. The method can correct data skew and reduce replication factors while reducing a communication load of transmission codes during a rebalance phase, thereby ensuring optimal performance of the decentralized file system.

Decentralized Random Number Generator
20200401377 · 2020-12-24 ·

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.