Methods, systems, and devices are provided herein for a mechanism to identify link down reasons. As described herein, a first port of a first peer device may be determined to have unexpectedly changed to a port down state. Subsequently, a topology file may be referenced to identify a second port of a second peer device with which the first peer device is intended to have a link if not for the first port being in a port down state. In some examples, port settings of the first port may be compared with port settings of the second port. If a port setting for the first port mismatches an associated port setting for the second port, an alert message may be transmitted to a network administrator indicating this mismatch as a possible reason for the first port being in the port down state.

A computer-implemented method for a node of a blockchain network comprising receiving or generating data for distribution in the blockchain network, said node having a plurality of interfaces, said data corresponding to an object such as a transaction or a block. The transaction can be a Bitcoin transaction for recordal in a blockchain. The method determines a correlation matrix having correlation coefficients representing the correlation between data processed at each interface of said node. From the correlation matrix a correlation index for each interface is determined. A threshold or indicator is calculated and data or objects such as Bitcoin transactions are relayed from nodes via interfaces according to a set of correlation coefficients of interface receiving the data. An indicator or threshold can derived from the correlation matrix and data is relayed if the correlation between the receiving interface and the other interface is lower than the indicator.

A system, method, and computer readable medium for managing service mesh for container instances. The method includes generating a service mesh that includes a plurality of computing resources. The method further includes obtaining, from an instantiated computing resource, a request to associate the computing resource with another computing resource in the service mesh, where the request comprising a set of constraints that allows the other computing resource to be identified. Based on the set of constraints, the computing resources in the service mesh are connected in which the computing resources communicate with each other through a dedicated proxy.

The invention relates to method for adjusting the minimum and maximum number of peer nodes that a node on the blockchain network will connect with. The adjustment takes in to account the bandwidth and processing capability of the node. Bandwidth capacity of a node is determined based on a maximum data amount processable by the node over a time period. Data is monitored passing through interfaces of the node, to and from peer nodes, and a profile factor of the node is determined from the difference between the input data to output data. Over a plurality of time periods monitoring said data the data analysed is used to set a minimum number of peer nodes and a maximum number of peer nodes connectable to the node according to said monitored data and the maximum number of peers connectable to the node. The method enables a node to adjust the number of connections according to performance limitation factors, such as bandwidth availability and processing performance. With the number of peer node connections determined, the node can further determine a correlation matrix between the interfaces and peer nodes to which it is connected. The matrix can be compiled with correlation coefficients representing the correlation between data processed at each interface of said node. The invention also resides in a corresponding computer readable storage medium, electronic device, node of a blockchain network or blockchain network having such a node.

The embodiment herein provides a system and method for providing a novel leader election mechanism in distributed systems that is randomized in twin dimensions of space and time using the concept of a colliding random walk (CRW). Leader election is randomized in space in terms of the node identified as the leader and the time taken to identify the leader. A source node is enabled to generate left and right coupons in a quantum resistant manner for random walks. A novel fault tolerance mechanism is provided to identify several leaders for same set of coupons. In this system and method, the source vertex generates multiple CRWs for each piece of work that needs to be done. The fault tolerance mechanism reduces the time to collision, increases the number of leaders and also offers increased resilience and tolerance to faults.

A method for transferring digital content items in a peer-to-peer network in which a plurality of nodes participate includes receiving requests for receipt of one or more digital content items from a plurality of requesting nodes belonging to the peer-to-peer network. A capacity of the requesting nodes to upload data is assessed. Network resources available to the peer-to-peer network for delivering the digital content items or chunks thereof to the receiving nodes are allocated based at least in part on the capacity of the requesting nodes to upload data. The digital content items or chunks thereof are sent to the requesting nodes over the peer-to-peer network in accordance with the network resources that are allocated to each of the requesting nodes.

An example operation may include one or more of dividing a data object into a plurality of parts, hashing the data object to generate a hashed data object and hashing the plurality of parts to generate a plurality of hashed parts, generating a plurality of slices where each slice includes the hashed data object and a different respective hashed part, and distributing the plurality of slices across a plurality of blockchain peers, respectively.

The invention relates to method for adjusting the minimum and maximum number of peer nodes that a node on the blockchain network will connect with. The adjustment takes in to account the bandwidth and processing capability of the node. Bandwidth capacity of a node is determined based on a maximum data amount processable by the node over a time period. Data is monitored passing through interfaces of the node, to and from peer nodes, and a profile factor of the node is determined from the difference between the input data to output data. Over a plurality of time periods monitoring said data the data analysed is used to set a minimum number of peer nodes and a maximum number of peer nodes connectable to the node according to said monitored data and the maximum number of peers connectable to the node. The method enables a node to adjust the number of connections according to performance limitation factors, such as bandwidth availability and processing performance. With the number of peer node connections determined, the node can further determine a correlation matrix between the interfaces and peer nodes to which it is connected. The matrix can be compiled with correlation coefficients representing the correlation between data processed at each interface of said node. The invention also resides in a corresponding computer readable storage medium, electronic device, node of a blockchain network or blockchain network having such a node.

The invention relates to method for a node of a blockchain network, the computer-implemented method comprising receiving or generating, at a node, data for distribution in the blockchain network, said node having a plurality of interfaces, said data corresponding to an object such as a transaction or a block. The transaction can be a Bitcoin transaction for recordal in a blockchain. The method determines a correlation matrix having correlation coefficients representing the correlation between data processed at each interface of said node. From the correlation matrix a correlation index for each interface is determined. A threshold or indicator is calculated and data or objects such as Bitcoin transactions are relayed from nodes via interfaces according to a set of correlation coefficients of interface receiving the data. An indicator or threshold can derived from the correlation matrix and data is relayed if the correlation between the receiving interface and the other interface is lower than the indicator. The invention also resides in a corresponding computer readable storage medium, electronic device, node of a blockchain network, super-node of a blockchain network or blockchain network.

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.