This disclosure describes techniques for scaling resources that handle, participate, and/or control routing protocol sessions. In one example, this disclosure describes a method that includes instantiating a plurality of containerized routing protocol modules, each capable of storing routing information about a network having a plurality of routers; performing network address translation to enable each of the containerized routing protocol modules to communicate with each of the plurality of routers using a public address associated with the computing system; configuring each of the containerized routing protocol modules to peer with a different subset of the plurality of routers so that each of the containerized routing protocol modules share routing information with a respective different subset of the plurality of routers; and configuring each of the containerized routing protocol modules to peer with each other to share routing information received from the different subsets of the plurality of routers.

A request to present digital content at a client machine associated with a designated network identifier may be received. For each of a plurality of preference characteristics, a respective characteristic query message may be transmitted via a network to a respective plurality of identity nodes via a gossip communication protocol defining a peer-to-peer procedure for transmitting information among the plurality of identity nodes. For each of the plurality of preference characteristics, a respective preference identification response message that includes a respective preference value corresponding with the respective preference characteristic may be received. The designated network identifier may be stored in a trust ledger shared among the plurality of identity nodes. A digital content item may be selected based at least in part on the preference values.

A request to present digital content at a client machine associated with a designated network identifier may be received. For each of a plurality of preference characteristics, a respective characteristic query message may be transmitted via a network to a respective plurality of identity nodes via a gossip communication protocol defining a peer-to-peer procedure for transmitting information among the plurality of identity nodes. For each of the plurality of preference characteristics, a respective preference identification response message that includes a respective preference value corresponding with the respective preference characteristic may be received. The designated network identifier may be stored in a trust ledger shared among the plurality of identity nodes. A digital content item may be selected based at least in part on the preference values.

Embodiments of the present specification provide a method, an apparatus, a client terminal, and a server for data processing. The method includes: selecting, based on a data attribute of to-be-processed data, a target coordinating server from a plurality of coordinating servers, the plurality of coordinating servers belonging to a plurality of server clusters respectively; and sending a data processing request to the target coordinating server, such that a server cluster to which the target coordinating server belongs processes the data processing request preferentially, the data processing request directing to the to-be-processed data.

A method of controlling and coordinating of processing steps in a distributed system can be implemented by an initiator node of a cyclically-ordered set of nodes participating in a blockchain network (e.g., Bitcoin blockchain). The method includes generating a private key and cryptographic shares thereof for the nodes of the set and distributing them. A locking value is determined based on the shares and a transaction is arranged to transmit control of a resource responsive to supply of a corresponding unlocking value. A circuit of transactions amongst the nodes each arranged to transmit control of a resource responsive to supply of an unlocking value corresponding to a locking value determined based on the share distributed to a first node of one of two adjacent nodes and a value received from another node immediately previous to it is prepared. The initiator node may belong to a cyclically-ordered set of initiator nodes.

System and methods are provided for implementing a Unified Integration Pattern (UIP) protocol for centralized handling of data feeds between client systems. In embodiments, a method includes: receiving an authentication Application Program Interface (API) message and data file transfer request for a data transfer event from a sending client system in a network of distinct client systems; authenticating the sending client system based on the authentication API message; uploading a data file from the sending client system based on the authenticating; receiving a notification API message from the sending client system indicating that that uploading of the data file to the computer system is complete; sending the data file to a receiving client system in the network of distinct client systems based on API message and data file request and the notification API message; and sending a notification message to the sending client system regarding the data transfer event.

System and methods are provided for implementing a Unified Integration Pattern (UIP) protocol for centralized handling of data feeds between client systems. In embodiments, a method includes: receiving an authentication Application Program Interface (API) message and data file transfer request for a data transfer event from a sending client system in a network of distinct client systems; authenticating the sending client system based on the authentication API message; uploading a data file from the sending client system based on the authenticating; receiving a notification API message from the sending client system indicating that that uploading of the data file to the computer system is complete; sending the data file to a receiving client system in the network of distinct client systems based on API message and data file request and the notification API message; and sending a notification message to the sending client system regarding the data transfer event.

A system designed for increasing network communication speed for users, while lowering network congestion for content owners and ISPs. The system employs network elements including an acceleration server, clients, agents, and peers, where communication requests generated by applications are intercepted by the client on the same machine. The IP address of the server in the communication request is transmitted to the acceleration server, which provides a list of agents to use for this IP address. The communication request is sent to the agents. One or more of the agents respond with a list of peers that have previously seen some or all of the content which is the response to this request (after checking whether this data is still valid). The client then downloads the data from these peers in parts and in parallel, thereby speeding up the Web transfer, releasing congestion from the Web by fetching the information from multiple sources, and relieving traffic from Web servers by offloading the data transfers from them to nearby peers.

The predictive overlay network architecture of the present invention improves the performance of applications distributing digital content among nodes of an underlying network such as the Internet by establishing and reconfiguring overlay network topologies over which associated content items are distributed. The present invention addresses not only frequently changing network congestion, but also interdependencies among nodes and links of prospective overlay network topologies. The present invention provides a prediction engine that monitors metrics and predicts the relay capacity of individual nodes and links (as well as demand of destination nodes) over time to reflect the extent to which the relaying of content among the nodes of an overlay network will be impacted by (current or future) underlying network congestion. The present invention further provides a topology selector that addresses node and link interdependencies while redistributing excess capacity to determine an overlay network topology that satisfies application-specific performance criteria.

Synchronization metadata is read from non-volatile storage. The synchronization metadata comprises indications of one or more synchronization targets. A synchronization target is a node of a clustered storage system. A synchronization cache is populated with the synchronization metadata. After populating the synchronization cache with at least a portion of the synchronization metadata, a connection to a network is established. After the connection to the network is established, a connection to a first of the one or more synchronization targets is established.