A method is provided of managing a non-static collection of machines. A first client machine runs a first communication protocol. The non-static collection of machines includes a first linear communication orbit, the first linear communication orbit comprising a sequence of machines that run the first communication protocol, and a second linear communication orbit, the second linear communication orbit comprising a sequence of machines that run a second communication protocol distinct from the first communication protocol. The first client machine receives an instruction from a server to install the second communication protocol, installs the second communication protocol, and then submits a registration request to the server. The first client machine receives, from the server, contact information of a list of potential neighbors. The first client machine then, proactively constructs and maintains a respective local segment of the second linear communication orbit.

A new host is detected being added to a network cluster, wherein each of a plurality of hosts are on the network cluster. Available interfaces on each of the plurality of hosts on the network cluster are detected responsive to detecting the new host being added. A classless inter-domain routing (CIDR) range is calculated for hosts and interfaces on the network cluster using the available interfaces. Pod routes with interface range and L3 host routes are set for each host.

A new host is detected being added to a network cluster, wherein each of a plurality of hosts are on the network cluster. Available interfaces on each of the plurality of hosts on the network cluster are detected responsive to detecting the new host being added. A classless inter-domain routing (CIDR) range is calculated for hosts and interfaces on the network cluster using the available interfaces. Pod routes with interface range and L3 host routes are set for each host.

The present invention relates to the field of communications technologies, and in particular, to a method and an apparatus for determining a to-be-uploaded NSD, so as to resolve a technical problem of a relatively low network service generation efficiency. In embodiments of the present invention, multiple NSDs are pre-stored, and when an NSD needs to be uploaded, it is only required to select an appropriate NSD from the stored NSDs for uploading; and when there is a service requirement, an NSD does not need to be generated before being uploaded. Therefore, a time required for uploading an NSD is reduced, and network service generation efficiency is improved.

Computer systems and methods for replicating a portion of a data set to a local repository associated with a subnetwork are disclosed. In one implementation, a method for a device associated with a subnetwork may include obtaining a portion of a data set from a central repository. The data set may be associated with one or more subnetworks, and the portion of the data set may be associated with the subnetwork. The method may further include obtaining a request for data originating from a node in the subnetwork. The requested data may include at least one of (i) the portion of the data set, and (ii) data generated based on the portion of the data set, and the request may be destined for the central repository. In addition, the method may include determining whether the central repository is unavailable to provide the requested data, and providing the requested data to the node after the central repository is determined as being unavailable.

A communication method executed by a communication system, the communication method includes determining, by a first node that requests to execute an application, a policy for selecting a node to execute the application from the plurality of relay nodes based on an amount of an output data which is an execution result of the application and an amount of an input data for executing the application; transmitting a request message including identification information indicating the policy and requesting to execute the application via the path; receiving, by a third node, the request message; acquiring data for executing the application from a second node, when it is determined that the third node is able to execute the application based on the identification information; executing the application using at least the acquired data; and transmitting a response message including the execution result of the application to the first node.

A system and method are provided that automatically update a customer-support ticket in an online customer-support system. When the customer-support ticket is created or updated, the system applies a set of triggers, which modify the ticket based on business rules, wherein each trigger performs actions that modify the ticket when conditions for parameters associated with the ticket are satisfied. When applying a trigger to the ticket, the system evaluates the conditions for the trigger by evaluating an associated condition graph, which is a directed graph comprised of condition nodes, wherein each condition node specifies conditions on parameters associated with the ticket. During this evaluation, if a valid path through the condition graph is discovered, which comprises a sequence of satisfied condition nodes from the root node to a null node, the system fires the trigger, which involves performing actions associated with the trigger to update the ticket.

A system and method are provided that automatically update a customer-support ticket in an online customer-support system. When the customer-support ticket is created or updated, the system applies a set of triggers, which modify the ticket based on business rules, wherein each trigger performs actions that modify the ticket when conditions for parameters associated with the ticket are satisfied. When applying a trigger to the ticket, the system evaluates the conditions for the trigger by evaluating an associated condition graph, which is a directed graph comprised of condition nodes, wherein each condition node specifies conditions on parameters associated with the ticket. During this evaluation, if a valid path through the condition graph is discovered, which comprises a sequence of satisfied condition nodes from the root node to a null node, the system fires the trigger, which involves performing actions associated with the trigger to update the ticket.

A method is disclosed. The method includes: a) receiving node identifiers from nodes of a plurality of nodes in a computer network; b) determining a plurality of node committees in a sampler graph comprising a plurality of nodes, wherein the node is present in a node committee in the plurality of node committees; c) and i) generating a random string; ii) performing a proof of work process using the random string and a hash function; iii) if the proof of work process yields a solution that is acceptable, then broadcasting the solution to all other nodes in the plurality of nodes, wherein the other nodes verify the solution; and iv) if the other nodes verify the solution, the node is elected to a subcommittee for the node committee, wherein the subcommittee updates the sampler graph; and d) repeating steps b) and c) until a leader committee is determined.

A method is disclosed. The method includes: a) receiving node identifiers from nodes of a plurality of nodes in a computer network; b) determining a plurality of node committees in a sampler graph comprising a plurality of nodes, wherein the node is present in a node committee in the plurality of node committees; c) and i) generating a random string; ii) performing a proof of work process using the random string and a hash function; iii) if the proof of work process yields a solution that is acceptable, then broadcasting the solution to all other nodes in the plurality of nodes, wherein the other nodes verify the solution; and iv) if the other nodes verify the solution, the node is elected to a subcommittee for the node committee, wherein the subcommittee updates the sampler graph; and d) repeating steps b) and c) until a leader committee is determined.