Embodiments herein relate to e.g. a method performed by a network node (10) for handling communication of data in a Bluetooth Low Energy (BLE) mesh network (1). The network node obtains a neighbor table, wherein the neighbor table is based on messages received from different network nodes; and selects an association between network nodes in the BLE mesh network (1) taking the neighbor table into account.

Embodiments herein relate to e.g. a method performed by a network node (10) for handling communication of data in a Bluetooth Low Energy (BLE) mesh network (1). The network node obtains a neighbor table, wherein the neighbor table is based on messages received from different network nodes; and selects an association between network nodes in the BLE mesh network (1) taking the neighbor table into account.

Systems and methods for blockchain ledger growth management using separation of a blockchain ledger into multiple blockchain ledgers (each ledger having a state that can be tracked and used). The systems and methods also include linking the separated ledgers by utilizing a linking application and smart contracts added to the separated ledgers.

Systems and methods for blockchain ledger growth management using separation of a blockchain ledger into multiple blockchain ledgers (each ledger having a state that can be tracked and used). The systems and methods also include linking the separated ledgers by utilizing a linking application and smart contracts added to the separated ledgers.

Systems and methods are described for performing peer-to-peer software distribution in a Unified Endpoint Management environment. In an example, an unenrolled user device can request enrollment from an enrollment server. The enrollment server can send a list of resources to the unenrolled user device that the unenrolled user device needs based on a group that the unenrolled user device is assigned to. The unenrolled user device can send an identifier of the group to a notification server, and the notification server can respond with an ordered list of enrolled user devices that the unenrolled user device can retrieve the resources from. The unenrolled user device can request the resources from the enrolled user devices on the list until the unenrolled user device receives all the resources from the resource list. The unenrolled user device can then install the resources to complete enrollment.

An operation method of a device for constructing a neural block rapid-propagation protocol (NBRP)-based blockchain according to an embodiment of the present invention comprises: a routing acquisition step of obtaining routing information for one or more participant node terminals participating in a blockchain network; a topology configuration step of activating an NBRP as a scheme of data transmission or reception, and identifying a peer node terminal among the participant node terminals on the basis of the routing information; a communication mode determination step of determining a communication process by determining whether the NBRP is activated for the peer node terminal; and a data processing step of processing synchronization and session data communication for transaction data or block data with the peer node terminal according to the communication process.

An operation method of a device for constructing a neural block rapid-propagation protocol (NBRP)-based blockchain according to an embodiment of the present invention comprises: a routing acquisition step of obtaining routing information for one or more participant node terminals participating in a blockchain network; a topology configuration step of activating an NBRP as a scheme of data transmission or reception, and identifying a peer node terminal among the participant node terminals on the basis of the routing information; a communication mode determination step of determining a communication process by determining whether the NBRP is activated for the peer node terminal; and a data processing step of processing synchronization and session data communication for transaction data or block data with the peer node terminal according to the communication process.

In a storage system, a failover time is shortened while avoiding erroneous detection of a node failure according to network quality. The storage system includes a plurality of storage nodes having processors; a data storage device; the plurality of storage nodes having the processors for processing data to be input to and output from the storage device; and a network for connecting the plurality of storage nodes, wherein the plurality of storage nodes monitors the operation status of each other to perform node failure detection for determining the occurrence of a failure of the storage node on the basis of a time-out value, performs a failover process in which one of the other storage nodes takes over the process of the storage node when the failure occurs in the storage node, and adjusts the time-out value on the basis of the status of the network between the storage nodes.

A method performed by a computing device for controlling a P2P connection according to an embodiment of the present disclosure includes obtaining network information of a current path for transmitting and receiving data, calculating requested data quality of the current path by using the network information, and changing a network path to an alternative path by using previously stored data quality history information of the alternative path when a difference between a predetermined highest data quality and the requested data quality of the current path is equal to or greater than a reference value.

A method performed by a computing device for controlling a P2P connection according to an embodiment of the present disclosure includes obtaining network information of a current path for transmitting and receiving data, calculating requested data quality of the current path by using the network information, and changing a network path to an alternative path by using previously stored data quality history information of the alternative path when a difference between a predetermined highest data quality and the requested data quality of the current path is equal to or greater than a reference value.