A method is disclosed for autonomously routing data using in a peer-to-peer computer network includes identifying a destination node to receive a data transfer, storing IDs of neighbor nodes sorted into orbital bins according to round-trip times (RTTs) between a source node and the neighbor nodes, sending one or more path packages from the source node to the destination node in a first direct data path from the source node to the destination node, sending path packages from the source node to the neighbor nodes, sending one or more path packages comprising updated hop information from a first hop node to the destination node, calculating total one-way latencies and performance metrics respectively for the path packages received by the destination node, and selecting a relayed data path for the data transfer from the source node to the destination node.

A message-limiting mechanism for enabling computing devices to self-organize into groups based on network proximity can entail the transmission of values based on hierarchical evaluation such that only a computing device having a most extreme value continues to transmit. The values utilized can be randomly generated and their broadcast can facilitate the identification of computing devices that are proximate, by network distance. Each computing device can retain a most extreme value received, unless a value generated by that computing device itself is more extreme, in which case the computing device can continue periodic broadcasts of its value. Each computing device can report its retained values, or its own value if no values were retained, and groupings can be generated based on the values reported by the computing devices. The grouping of computing devices can then facilitate the identification of peers, including for purposes of downloading content from such peers.

A processor may analyze one or more microservice chains based on one or more user profiles. The processor may generate, based on the analyzing, a health status associated with the one or more microservice chains. The processor may determine, based on the health status, whether a microservice in the one or more microservice chains is unhealthy. The processor may implement, automatically, a select microservice chain.

According to one aspect disclosed herein, a system can include a set of node peers, including a first subset implemented in software and a second subset implemented in hardware. The first subset can include a software node. The second subset can include a hardware node that includes a hardware cache, a processor, and a memory that stores computer-executable instructions. The hardware node can receive, from a network, a packet, and can determine if data that identifies a path associated with the packet is stored in the hardware cache. If not, the hardware node can query the software node to identify the path associated with the packet, and can receive, in response from the software node, the data that identifies the path, which then can be stored in the hardware cache. The hardware node can forward, along the path, the packet to a network element.

One or more embodiments of this specification provide message transmission methods and apparatuses. A method includes: registering each of a plurality of blockchain nodes in a blockchain relay communication network to a blockchain node set indicated in a registration request submitted by a corresponding blockchain node of the plurality of blockchain nodes; generating a routing policy corresponding to each of the plurality of blockchain nodes, the routing policy comprising a blockchain node set that the corresponding blockchain node belongs and a relay node that connects to the corresponding blockchain node; receiving a blockchain message for a target blockchain node in a target blockchain node set; determining a target relay node connected to the target blockchain node according to a tree-structured routing table obtained by organizing routing policies in a tree structure; and transmitting the blockchain message to the target blockchain node.

Systems and methods of the present invention for maintaining network data distribution are provided. Network data may be distributed in such as manner as to allow a network session to weather interrupted communications between host and clients without significant loss of data. Embodiments of the present invention provide for one or more clients to serve as backup host(s) for the network session. When the other clients transmit data to the host, they may also transmit the data to one or more backup hosts if there are any indications of interrupted communication.

A device may receive application information of an application to be deployed in a cloud computing environment. The application information may include requirement information including information defining a compute requirement of the application, a storage requirement of the application, and a network connectivity requirement of the application, and first capability information identifying requested capabilities of the first set of devices. The device may receive second capability information identifying actual capabilities of the second set of devices. The device may compare the first capability information and the second capability information to determine a measure of similarity between the first capability information and the second capability information. The device may generate deployment information for deploying the application on a device, of the second set of devices, based on the measure of similarity.

A method is disclosed for autonomously routing data using in a peer-to-peer computer network includes automatically updating a peer-to-peer computer network. The method includes automatically sending pulse messages from a first node to neighbor nodes and candidate nodes, receiving return pulses by the first node from at least some of the neighbor nodes and the candidate nodes, calculating round-trip times (RTTs) between the first node and the neighbor nodes or the candidate nodes based on the pulse messages and the return pulses, sorting the nodes in the neighbor nodes and the candidate nodes into orbital bins based on RTTs, and automatically selecting and adding a node from one of the orbital bins based on the RTTs to updated neighbor nodes for the first node, and routing data from the first node to a second node via a relay node in the peer-to-peer computer network.

Systems, methods, and techniques for supporting feature customization based on data source capability. A first request is received from an external entity to provision an instance of an application. An application service of a plurality of application services is identified to be implemented to fulfill the first request. A configuration of the application corresponding to the application service is determined. Customization information regarding states of a set of features of the application instance is obtained as a result of determining that a customization is associated with the external entity. A modified configuration is generated for the application based on the customization information and the configuration. An application instance is provisioned to the external entity over the one or more networks having the modified configuration.

Systems, methods, and techniques for supporting feature customization based on data source capability. A first request is received from an external entity to provision an instance of an application. An application service of a plurality of application services is identified to be implemented to fulfill the first request. A configuration of the application corresponding to the application service is determined. Customization information regarding states of a set of features of the application instance is obtained as a result of determining that a customization is associated with the external entity. A modified configuration is generated for the application based on the customization information and the configuration. An application instance is provisioned to the external entity over the one or more networks having the modified configuration.