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.

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.

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.

A system and method of executing a deep neural network (DNN) in a local area network (LAN) may include executing a partitioned deep neural network in multiple computational nodes (CPs) in devices operating on the LAN. An image frame may be captured by a device. The image frame may be processed by a first layer of the partitioned neural network by a CP operating on the device. In response to the device that captured the image frame determining to request processing assistance from another CP, a request using a peer-to-peer protocol to other CPs on the LAN may be performed. A feature map may be communicated to another CP selected using the peer-to-peer protocol to process the feature map by a next layer of the DNN.

The present disclosure provides a method for managing resource state information and a system for downloading a resource, which belongs to network communication technologies. According to the method, a target super node receives a file identification of at least one target resource file sent by a Tracker server (204); the target super node configures a download service of each of the at least one target resource file according to the file identification and a local resource storage state (205); and the target super node feeds back service configuration information of each of the at least one target resource file to the Tracker server (206).

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.

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.

Container orchestration system (COS) service discovery across multiple COS clusters based on COS cluster domain name system (DNS) is described. An indication that a first COS service and first COS endpoints are created in a first COS cluster is received. In response to the receipt of the indication, a request to create, in a second COS cluster, a second COS service and second COS endpoints is transmitted. The second COS service and the second COS endpoints correspond to the first COS service and the first COS endpoints. The creation of the second COS service and the second COS endpoints causes insertion of first DNS records in a first DNS server that is local to the second COS cluster enabling COS pods of the second COS cluster to communicate with the COS pods of the first COS cluster through a network.

A method and apparatus for generating a profile page. A computer system identifies a group of potential profiles images from an image. The computer system identifies a group of features in the image. The computer system generates the profile page based on a potential profile image selected from the group of potential profile images and the group of features in the image. The computer system displays the profile page on a display system, enabling generating the profile page.

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.