1426 results about "Node count" patented technology

A method and system for performing data analysis where multiple, categorical dimensions and statistical measures are used. The method includes preparing multi-dimensional data into nodes and arranging them logically in the form of a partial-order database. The database may then be traversed by a data-mining tool, or queried in an OLAP manner. Queries are answered through a process of associative partial-order search, which includes optional support for “children-of” requests, and optional support for fuzzy pattern-matching. By aggregating measures on-the-fly, this method is able to preform well without requiring a large number of summary nodes, when taken as a percentage of the total node count.

A loop isolation circuit (LIC) to enable subdivision of a single daisy-chained communication loop (e.g., FC-AL) into smaller loops and to enable joining of smaller loops into a single larger loop. An LIC comprises essentially two multiplexors configured so as to permit controlled subdivision or joining of two loop portions. In a first selected state, the LIC subdivides a communication loop in which it is inserted into two loops. This configuration sacrifices accessibility among some devices previously on the larger loop for the benefit of enhanced bandwidth and reduced overhead due to node count. Bandwidth is enhanced by enabling simultaneous operation of two (or more) loop portions for establishing and communicating over logical circuit connections. However, when a failure of a redundant loop precludes access to devices, the LIC may be set to a second state to rejoin previously subdivided loops into a larger loop. This configuration restores access among all devices sharing common access to the larger loop. The LIC of the present invention therefore enables communication loop controllers to dynamically reconfigure a daisy-chained loop communication system to enhance performance in normal operation. The LIC of further enables restoration of the larger loop to restore redundant loop configurations. The LIC of the present invention is applicable in many daisy-chained loop communication environments including, but not limited to, Fiber Channel Arbitrated Loop (FC-AL).

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.

An apparatus or method for minimizing the total accessing cost, such as minimizing repair bandwidth, delay or the number of hops including the steps of minimizing the number of nodes to be engaged for the recovery process using a polynomial-time solution that determines the optimal number of participating nodes and the optimal set of nodes to be engaged for recovering lost data, where in a distributed database storage system, for example a dynamic system, where the accessing cost or even the number of available nodes are subject to change results in different values for the optimal number of participating nodes. An MDS code is included which can be reused when the number of participating nodes varies without having to change the entire code structure and the content of the nodes.

In distributed multinode data processing systems, mechanisms are employed to insure that the nodes are continually informed about the liveness of the other nodes within node groups in the network and across networks. The method of the present invention employs the concept of node stability which it uses to provide indications of membership in a previous stable group as part of messages transmitted in a protocol for forming, maintaining and dissolving node groupings in such a way as to assure that all of the nodes in the group have a consistent indication of liveness status for all of the nodes within any given group of nodes.

The invention relates to a batch processing request-based Microsoft SQL server database cluster. The cluster consists of two parts, wherein a gateway and backups thereof are arranged at the front end of the cluster, and two or more of database server nodes are arranged at the rear end of the cluster; each node is provided with a structured query language (SQL) Server example and a cluster proxy and is not provided with a shared disk structure; and each node has an independent and consistent data set, and the cluster is only provided with a host. The gateway is used for managing the integral cluster; and for each client link, the gateway opens a database link corresponding to each node simultaneously to receive, analyze and optimize all client requests, wherein the client requests are divided into two classes, namely the read-only query requests and the data updating requests; for the read-only query requests, the gateway sends the requests to any one node to execute the requests according to a set load balancing algorithm so as to realize the real database access load balancing and improve the performance of a system; and the updating requests are sent to the host of the cluster to be executed, and are subjected to synchronous data by the host to other nodes to keep the data set of each node real-time and consistent, eliminate a single-point fault source and realize system fault tolerance. The integral cluster can improve the performance, availability and reliability of the system obviously and solve various problematic issues of the performance, single-point faults, zero data loss and the like in the field of databases, and is a comprehensive database cluster scheme.

A system and method for determining node relevancy by proximal weighting and pruning in a layered linked node database, such as that used to represent connections between a set of objects. The weights of connections between nodes in the layered linked node database is used as a distance metric, with propagation semantics determining how the summed relevancy is determined. This is particularly useful for determining, for a given node in a given layer, which nodes in another layer, or on the same layer, are most relevant. In the context of mobile device users, this is particularly useful for dynamically determining which people, places, events etc. are of greatest relevance in a scalable manner.

The invention provides a limited binary tree bloom filter, a redundancy removal file system based on the limited binary tree bloom filter, and a construction method of the redundancy removal file system based on the limited binary tree bloom filter. According to the limited binary tree bloom filter, an upper limit is arranged for the number of nodes of each layer, each node is a two-stage bloom filter, and each two-stage bloom filter comprises a standard bloom filter body and a second portion which contains fingerprints and addresses of data blocks in a stored mode. Firstly, a fingerprint of each data block is searched in the standard bloom filter bodies; when the fingerprint of each data block is not found, a node misses, otherwise, search is continuously carried out in the second portions, the node hits the target when a completely matched fingerprint is found in the second portions, and otherwise the node misses. The redundancy removal file system and the construction method of the redundancy removal file system achieve write-in, reading and deletion of files on the basis of the limited binary tree bloom filter. Misjudgment is reduced through a secondary query, and the limited binary tree bloom filter, the redundancy removal file system based on the limited binary tree bloom filter, and the construction method of the redundancy removal file system based on the limited binary tree bloom filter have the advantages of being low in occupation of the memory, low in usage of a CPU, low in occupation of additional space, high in redundancy removal ratio, and excellent in access performance and extensibility.

The invention provides a construction method of an NAS cluster system based on a modularization design. The modularization design-based NAS cluster system is composed of a control node, a data node, a storage network, a management network and a data network. All the above-mentioned parts work independently but are mutually connected to form an organic integral body, so that the complete NAS cluster system with high reliability, high expandability and high performance can be provided for a user. Functions of all the parts of the NAS cluster system are described as follows: in the aspect of the control node, each set of NAS cluster system contains two control nodes; hardware composition is a rack server or a blade server; and functions of cluster service configuration file system establishment, catalog management, user management, and system monitoring and maintenance and the like are completed.

The invention belongs to the technical field of block chains, and relates to a block chain-based transaction method and a block chain-based transaction system. The method comprises the following steps: each node signs a block chain identifier and a public key of the node by using a private key of the node and broadcasts the block chain identifier and the public key to a block chain; A certain transaction node initiates a transaction, calculates a Hash value of the transaction by adopting a secret key, signs the transaction message and the primary Hash value by using a private key of the transaction node, and broadcasts the transaction message and the primary Hash value to the block chain; The other nodes calculate the Hash value of the transaction again by adopting the shared session key with the transaction node, verify whether the primary Hash value is the same as the secondary Hash value or not, and broadcast the verification result to the block chain after using the own private keyto sign the verification result; And the accounting node counts whether the verification result is passed or not within a preset time threshold range of the transaction initiated by the transaction node, and establishes a consensus mechanism according to the verification result which is the passed accumulated number. The communication burden of the block chain and the size of the block can be reduced, and the transmission efficiency of the block chain is greatly improved.

The present invention provides techniques for assignment and layout of redundant data in data storage system. In one aspect, the data storage system stores a number M of replicas of the data. Nodes that have sufficient resources available to accommodate a requirement of data to be assigned to the system are identified. When the number of nodes is greater than M, the data is assigned to M randomly selected nodes from among those identified. The data to be assigned may include a group of data segments and when the number of nodes is less than M, the group is divided to form a group of data segments having a reduced requirement. Nodes are then identified that have sufficient resources available to accommodate the reduced requirement. In other aspects, techniques are providing for adding a new storage device node to a data storage system having a plurality of existing storage device nodes and for removing data from a storage device node in such a data storage system.

The invention discloses a Byzantine fault tolerance method of a data block chain authorization participation consensus based on reward and punishment and a reward and punishment method thereof, relating to the technology of fault tolerance of a data block chain. A node reward and punishment algorithm is used to ensure that commands sent by nodes in a Byzantine fault tolerant data block chain which is authorized to participate in the consensus are honest. The technical points of the invention are that the method comprises the steps of (1) selecting consensus nodes in the data block chain, wherein the number of the consensus nodes is smaller than a node total number in the data block chain, (2) allowing the consensus nodes to carry out consensus games to reach a consensus on authenticity judgment of the commands sent by the nodes in the data block chain, and (3) carrying out reward and punishment on the nodes in the block chain based on a result that the consensus nodes reach the consensus.

A method for filling the space between two neighboring polyline ribs is disclosed. The method, called ladder triangulation, likens two ribs, which generally outline a complex structure, to the two rails of a ladder. The ladder triangulation is built by adding rungs, each rung connecting a node on one rib to a node on the other rib and thereby (after the first rung) creating one more triangle. In essence the first rung connects node 1 of polyline 1 to node 1 of polyline 2, and the second rung connects either node 1 polyline 1 to node 2 polyline 2 or else node 1 polyline 2 to node 2 polyline 1, whichever rung is shorter. There are (n1+n2)/2 such rungs where n1 and n2 are the respective node counts of the two polylines, and computation is linear with node count. Where there are multiple polylines, the same process is repeated between polylines 2 and 3, 3 and 4, etc. and may also be repeated between the last polyline and the first one (cyclic rib fill). The entire set of ribs is filled in time proportional to the total node count. Moreover, if a single rib is subsequently modified by an editing process, a triangulation can be updated rapidly by recomputation of just the two ladder triangulations involving that rib.

A computing system, method and product comprising a server, a mobile device comprising a client interconnected with the server via a data network, the client identified by a credential which is unavailable to the client and an intermediate node interconnected to the client and the server via the data network wherein the credential is available to the intermediate node. Upon reception of a service request from the client at a first server address the server redirects the client to transmit the service request to a second server address via the intermediate node together with a token, wherein the intermediate node appends a credential identifying the client to the redirected service request and the token and relays the redirected service request, the token and the credential to the second server address.

The invention discloses a method and a device using a vector instruction to process a file index in a parallel mode. The method comprises the following steps of calculating and sorting index key values of data in a data table, distributing needed storing space of all leaf nodes, using an SIMD (single instruction multiple data) instruction to load a plurality of index key values once, sequentially filling the data in all the leaf nodes, distributing the needed storing space of the internal nodes of the upper layer, building the internal nodes, continuously building the internal nodes of the upper layer until the node number of the upper layer is one, regarding the node as a root node, and finishing the building of an index tree; building a buffer pool in internal storage, using an inquiring queue to temporarily store all received inquiring requests, taking the inquiring requests out of the buffering pool when the length of the inquiring queue reaches a preset threshold value, sorting the inquiring requests, and forming a sorted to-be-inquired queue; sequentially obtaining a to-be-inquired term in the sorted inquiring queues, sequentially searching from the root node of the built index tree, and using the SIMD method to search the to-be-inquired term in a parallel mode inside the internal nodes and the leaf nodes.

The invention relates to a verification based blockchain common recognition method. A client sends a request message to a verification initiation node; the verification initiation node organizes a pre-preparation message and broadcasts the message to other verification nodes in the network; the other verification nodes organize signature messages and return the signature messages to the verification initiation node respectively; the verification initiation node counts the signature messages which are received correctly, submission of the present node is executed when the number of the signature messages which are received correctly reaches a given threshold, and a verification message is organized and sent to the other verification nodes; each of the other verification nodes checks digitalsignatures in the message successively, when the number of the digital signature that passing checking reaches a given threshold, submission operation of the present node is executed, and a verification reply message is organized and returned to the verification initiation node; and the verification initiation nodes organizes a response message and back feeds the response message to the client. Compared with a practical Byzantine fault tolerant method, the network communication frequency and communication data bulk are reduced, and the common recognition efficiency is improved.

The invention discloses a cloud data migration method. The cloud data migration method comprises the following specific steps: dividing one file into one or more blocks to store, and distributing and storing on a cluster server by taking the block as a unit, wherein each block is an independent storage unit; taking each block as one partition, and taking the partition as a basic unit for data migration and load monitoring; respectively classifying all storage nodes in an immigration node set and an emigration node set according to the relationship of standardized load values and the total node number of a system; and achieving load balance of the system among various nodes in a cloud environment through a data migration algorithm. Compared with the prior art, the cloud data migration method disclosed by the invention has the advantages that: a data migration strategy is made on the basis of the balance degree; an optimal data migration operation is selected; therefore, the load balance of the system is achieved; the load skew is reduced; and the cloud data migration method is high in practicability and easy to popularize.

The invention belongs to the technical field of block chains. The scheme comprises four kinds of entities including a data user, a block chain, an oracle machine node and a data provider, and the block chain deploys a system management contract, an oracle machine contract, a data storage contract, a data request contract and a user-defined contract; wherein the oracle machine node comprises a request adaptation node, a response adaptation node and a request execution node; according to the scheme, cooperative sharing of the on-chain data and the off-chain data is realized by using the distributed oracle machine, the network bandwidth and the on-chain storage space demand are reduced, and the data integrity can be verified through the on-chain evidence storage; according to the scheme, homomorphic encryption is used for protecting data privacy in the processing process of the oracle machine and realizing basic under-chain computing capacity, better universality and verifiable safety areachieved. Meanwhile, data aggregation operation is set under a chain, and the processing performance is improved compared with on-chain aggregation.

Network monitoring device and method whereby the user can be given an alarm before a guaranteed limit of packet routing is exceeded. Counting section counts the number of nodes based on packets exchanged between the nodes, and comparing section compares the node count with an allowable value. If the node count is larger than the allowable value, alarm output section outputs a message that the node count is excessively large.

The invention is suitable for the technical field of data storage, and provides a distribution-based task scheduling method and system. The method comprises the following steps: setting an accessed datanode threshold value of each rack in a distributed cluster; obtaining an amount of the datanodes accessed in each rack, and judging whether the amount of the datanodes accessed in each rack at present exceeds the threshold value or not; and if the amount of the datanodes accessed in each rack at present exceeds the threshold value, distributing a new distributed task to other racks, or scheduling the new task to a task queue to wait. On the basis of a control algorithm based on IO (Input/Output) access, the single-cabinet power of cold storage data access and the energy consumption of an integral cold data center can be controllable, the relationship between flash memory media service and energy consumption is fully utilized, and the characteristics of data distribution type storage/access are combined to lower cold data backup cluster expense.

The invention discloses a failure data recovery method based on improved erasure codes and aims at designing an efficient failure data recovery method based on data access characteristics. According to the technical scheme, a distributive storage system composed of one control node and N storage nodes is set up, the control node is provided with a data writing management program and a data recovery program. The storage nodes are provided with data writing programs and data reading programs. The data writing program receives data objects submitted by a user and is used for conducting block partition and coding calculation on the data objects and writing obtained data blocks into the storage nodes. The data recovery program receives a failure data sub-block recovery request, reads useable data sub-blocks from the storage nodes, and conducts decoding calculation so as to obtain recovered data blocks. By the adoption of the method, the data usability of the system can be improved, the influence of data block failure on data access can be reduced, the failure data size relevant to data access can be reduced, the network transmission data size can be reduced, and failure data recovery efficiency can be improved.

The invention discloses a minimum competition window adjusting method based on a neighbor node number estimation in a vehicle-mounted network, wherein the minimum competition window adjusting method based on the neighbor node number estimation in the vehicle-mounted network aims to solve the problem of radio expandability of a vehicle-mounted Ad hoc network MAC layer with a faster vehicle density change. Under the premise of an aim of minimizing the radio frame collision probability, the minimum competition window adjusting method based on the neighbor node number estimation in the vehicle-mounted network derivates a relationship between a minimum competition window and the number of competition anodes, a minimum competition window value is dynamically adjusted according to a real-time estimation of the number of vehicle neighbor nodes, the change of the minimum competition window value is made to reflect competition conditions in the network, therefore, waste of channel resources is reduced, and radio performance is improved. The minimum competition window adjusting method based on the neighbor node number estimation in the vehicle-mounted network has the aim of minimizing the collision probability, deviates the relationship between a CWmin and the number of active competition nodes, the minimum competition window is adjusted in a self-adjusting mode according to the real-time estimation of the number of the vehicle neighbor nodes, and the vehicle density change is reflected through adjustment of the minimum competition window, and therefore radio expandability of an IEEE802.11p MAC layer is improved.