696 results about "Node clustering" patented technology

An active cluster is dynamically formed to perform a specific task. The active cluster includes one or more data owning nodes of at least one data owning cluster and one or more data using nodes of at least one data using cluster that are to access data of the data owning cluster. The active cluster is dynamic in that the nodes of the cluster are not statically defined. Instead, the active cluster is formed, when a need for such a cluster arises to satisfy a particular task.

A system and method for permitting bi-directional failover in two node clusters utilizing quorum-based data replication. In response to detecting an error in its partner the surviving node establishes itself as the primary of the cluster and sets a first persistent state in its local unit. A temporary epsilon value for quorum voting purposes is then assigned to the surviving node, which causes it to be in quorum. A second persistent state is stored in the local unit and the surviving node comes online as a result of being in quorum.

The invention is a method for operating a file server system in a cluster mode that provides for relatively rapid and reliable takeover of a failed file server in the cluster by a partner file server when the failed file server has detected a fault that will cause it to shut down. This is done by the failed file server requesting the one file server to take over its file services after detecting the fault in its operations, the one file server letting the failed file server complete existing file service requests from clients, refusing further file service requests addressed to the failed file server, and the one file server taking over by transferring file service requests to the one file server. As part of this takeover the one file server takes on the identity of the failed filer and activates network interfaces and network addresses that replicate the failed server's network addresses.

The invention discloses a method and a system for detecting large-scale malicious web pages by using a three-layer parallel architecture and a layered control guarantee method: in the first layer, a plurality of detection servers interconnected via networks are arranged in parallel, so as to construct a detection server cluster, and a task set to be analyzed is set up on one detection server; in the second layer, a plurality of analysis nodes are arranged in parallel in each detection server, and a node cluster monitoring module is arranged so as to monitor and analyze the operating condition of the nodes; and in the third layer, a sandbox environment is constructed in parallel in each analysis node, so as to achieve the paralleled detection of the task to be analyzed. The architecture of the invention ensures the mutual independence and self-maintenance among the detection servers and among the analysis nodes, the overall operation of the system is free from the dynamic expansion of physical hosts and node numbers, and the overall function thereof is not affected by the invalidity of the single analysis node; and various tasks can be detected in a multi-channel and paralleled manner at the same time in the same node, thereby improving the analysis efficiency of the system.

In the area of network provisioning, there is a problem of selecting a suitable traffic-provisioning model for large networks due to the high management complexity of the resource-efficient trunk model and the poor bandwidth efficiency of the easy-to-configure hose model. The invention is based on the idea of partitioning at least part of the network into multi-node clusters, and defining traffic limitations on at least two levels, including the intra-cluster level and the inter-cluster level, where the traffic limitations include one or more node-to-cluster traffic limitations for inter-cluster traffic. Subsequently, cluster-based provisioning of the network is performed based on the traffic limitations. The novel node-to-cluster limitations proposed by the invention are preferably applied in a cluster-based trunk or hose model on the inter-cluster level. In other words, for the description of the inter-cluster traffic (traffic between the clusters) cluster-based trunk or hose models can be used, preferably depending on the available information about the traffic. The cluster-based provisioning makes it possible to find a trade-off between management complexity and overprovisioning.

Some embodiments provide novel inline switches that distribute data messages from source compute nodes (SCNs) to different groups of destination service compute nodes (DSCNs). In some embodiments, the inline switches are deployed in the source compute nodes datapaths (e.g., egress datapath). The inline switches in some embodiments are service switches that (1) receive data messages from the SCNs, (2) identify service nodes in a service-node cluster for processing the data messages based on service policies that the switches implement, and (3) use tunnels to send the received data messages to their identified service nodes. Alternatively, or conjunctively, the inline service switches of some embodiments (1) identify service-nodes cluster for processing the data messages based on service policies that the switches implement, and (2) use tunnels to send the received data messages to the identified service-node clusters. The service-node clusters can perform the same service or can perform different services in some embodiments. This tunnel-based approach for distributing data messages to service nodes/clusters is advantageous for seamlessly implementing in a datacenter a cloud-based XaaS model (where XaaS stands for X as a service, and X stands for anything), in which any number of services are provided by service providers in the cloud.

A high availability computing system includes a plurality of computer nodes (for example, a server system) connected by a first and a second network, wherein the computer nodes communicate with each other to detect server failure and transfer applications to other computer nodes on detecting server failure. The system incorporates methods of maintaining high availability in a server cluster having a plurality of nodes. A group communications service, a membership service and a system resource manager are instantiated on each node and the group communications service, the membership service and the system resource manager on each node communicate with other nodes to detect node failures and to transfer applications to other nodes on detecting node failure.

A method for providing an application cluster service (APCS) with fault-detection and failure-recovery capabilities. This method is composed of the steps of nodes clustering, invoking and detecting applications, fault-recovery of applications, detection of nodes, and node replacement. This method is applicable in a clustered environment to detect if a slave node is failed by sending a heartbeat periodically from a master node; and to detect if the master node still exists by checking if the master node stops sending the heartbeat (i.e. the master node may be failed).

A method, a device, and a system for backup are disclosed. The method includes: receiving a backup packet; analyzing the backup packet to obtain a serial number of an active data packet, where the serial number is carried in the backup packet; calculating a sum of the serial number of the active data packet and a specific increment value to obtain a serial number of a standby data packet; and backing up the serial number of the standby data packet. Therefore, after the service is switched over from the active device to the standby device, the active device still regards the data packet sent by the former standby device as a new data packet and receives the data packet, which prevents service interruption caused by the switchover and improves continuity of service processing in the process of two-node cluster hot backup.

The invention is a method for operating a file server system in a cluster mode that provides for relatively rapid and reliable takeover by one file server of another. This is done by a system operator requesting takeover of file services of a file server, letting the first file server complete existing file service requests from clients, refusing further file service requests addressed to the first file server, and the one file server taking over by transferring file service requests to the one file server. As part of this takeover the one file server takes on the identity of the first filer and activates network interfaces and network addresses that replicate the first server's network addresses.

The invention provides a task allocation method and system in a node cluster, and a node. The node cluster comprises a plurality of computing nodes, the plurality of computing nodes comprise GPU nodes and CPU nodes, a plurality of GPU nodes constitute a GPU node cluster, and a plurality of CPU nodes constitute a CPU node cluster. The method comprises the following steps: a center node receives a user request, wherein the user request carries a to-be-executed task and a user-defined parameter; the center node controls any computing node to determine a server resource type and the service magnitude necessary for executing the task; and the center node allocates the task to the corresponding computing node according to the server resource type and the service magnitude necessary for executing the task and the state information of the current computing node. By adoption of the method provided by the embodiment of the invention, unified management and mixed use of the CPU node cluster and the GPU node cluster can be realized.

A method, system, and apparatus for a management station to manage a node cluster in a computer network. Regardless which node in the node cluster receives a management command from the management station to the master node, the management command is sent to the master node. The master node prepares a command response and sends the response back to the original node that received the management command. The original node, in turn, forwards the command response to the management station. The invention utilizes management agents executing on a master node and servant nodes to create and process the command response.

The invention provides a distributed file system data volume deployment method based on a virtual address pool. A node cluster or a sub-cluster is built according to different node roles of metadata nodes, data storage nodes and client side nodes in a distributed file system; a data storage volume is deployed in a mode based on the virtual IP address pool on a data node cluster to separate the deployment of a distributed file system data storage volume from physical addresses of data nodes so as to combine the deployment of the data storage volume with virtual addresses of the data node cluster; a monitoring module is deployed on an operating node of the distributed file system so as to realize real-time monitoring of the operating conditions of the node and a load; according to the conditions of the node and the load, a virtual IP borne by any node and the data storage volume mounted on one virtual address are transferred in real time in the data node cluster; meanwhile, a failure of a physical node is also isolated, so that the effect that data services of the data storage volume are not interrupted when the physical node is maintained is ensured.

The invention discloses an energy priority node clustering method for a wireless sensor network. The method comprises the following steps that: after network deployment is finished, a base station starts running all nodes in a network by transmitting a broadcast signal; each started node in the network computes own threshold value for becoming a cluster head; the nodes of which rest energy is more than or equal to the average energy of the network and which generate random numbers lower than the threshold values in the network are selected to be the cluster heads; the cluster heads broadcast own cluster head messages to the whole network, and each ordinary node computes own distances away from the cluster heads according to received signal strength after receiving the cluster head messages, and is added into the closest cluster as a cluster member; and the cluster heads allocate time division multiple access (TDMA) timeslots to each cluster member, so that each cluster member performs communication according to the allocated timeslots. By the method provided by the invention, the time to live of the network can be remarkably prolonged, and performance remarkably higher than that of a low energy adaptive clustering hierarchy (LEACH) protocol is ensured.

A system and method of detecting a source of a rumor in a social media network is disclosed. The social media network includes a plurality of node clusters, each of the plurality of nodes therein having at least one edge connection to a corresponding number of different nodes in the same cluster. The system identifies a plurality of gateway nodes, each having at least one weak tie connection with a corresponding gateway node from a different node cluster; selects a subset of gateway nodes as sensors to measure arrival times of a rumor; and selects a candidate node cluster based on these arrival times. From there, the system selects a set of nodes in the candidate cluster to measure arrival times of a rumor from a source node, and selects a candidate node from the candidate cluster as having a high probability of being the source node.

The invention discloses a wireless sensor network and constructing method and communication method capable of self-adapting the web knot according to network structure variation, and variation of service data transferring demand and variation of network management command. The wireless sensor network is isomorphism grouping network structure of node cluster management. Make the knobs which can directly communicate into a cluster, constructing a topological structure of cluster network linking. The communication dispatching of the network nodes can be divided into intra-cluster nodes communication dispatching and inter-cluster nodes communication dispatching. According to the network structure design, set the intra-cluster network nodes constructing cluster network work periods. A cluster network working period comprises cluster resting period, inter-cluster interchanging nodes communicating work period and intra-cluster nodes communication work period. The network nodes is used for self-adapting each working period and the communication time of cluster nodes of each working period, and communication time width to reach the network optimization.