A scheduling method for dnc data storage server based on industrial control network
A storage server and server scheduling technology, which is applied in the direction of data exchange network, digital transmission system, electrical components, etc., can solve the problem of DNC data loss, etc., and achieve the effect of avoiding resource waste, high data integrity, and rational use of network resources
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0057] The present invention is realized through the following technical scheme, a kind of DNC data storage server scheduling method based on industrial control network, specifically
[0058] Include the following steps:
[0059] Step S1: Construct the state table between the server and the machine tool client, and select the remaining storage space as M according to the state table i server as the primary storage server;
[0060] Step S2: delete the combination in the state table that does not meet the requirements of the storage server, and obtain a new state table between the server and the machine tool client;
[0061] Step S3: Calculate the transmission priority between each server and each node, and select the optimal storage server and the optimal backup server;
[0062] Step S4: When the storage server fails, reselect the storage server;
[0063] When the backup server fails, select the storage server again.
[0064] It should be noted that through the above improv...
Embodiment 2
[0070] This embodiment is further optimized on the basis of the above embodiments. Further, in order to better realize the present invention, the step S1 specifically includes the following steps:
[0071] Step S11: Construct the state table Z of the server and the machine tool client through the server network delay, the size of the remaining disk space in the server, and the maximum amount of data collected by the machine tool client every day k,i ;
[0072] Z k,i (M k , T k ,C max,i ); i=(0,1,2...n-1,n),k=(0,1,2...m-1,m); (1)
[0073] Among them, M k The remaining disk space of the server;
[0074] T k Delay for machine tool server network;
[0075] C max Collect data for the maximum day of a single client;
[0076] n is the number of the client;
[0077] m is the label of the storage server;
[0078] It should be noted that, through the above improvements, if there are n machine tool clients and m servers, the state table is represented as:
[0079] {Z 1,1 (M...
Embodiment 3
[0082] This embodiment is further optimized on the basis of the above embodiments. Further, in order to better realize the present invention, the step S2 includes the following steps:
[0083] Step S21: When the machine tool client requests data storage from the Master server, the Master first selects an available server in the status table;
[0084] The selection rule is: all servers M ss The choice meets the requirement that the size of the remaining storage space is greater than the maximum daily data collected by a single client C max plus 10GB;
[0085]
[0086] Step S22: Delete the data that does not meet the requirements in the state table to obtain a new state table Z' k,i ;
[0087] Z' k,i (M k , T k ,C max,i ); i=(0,1,2...n-1,n),k=(0,1,2...m-1,m); (3)
[0088] where C max，i is the maximum storage space of the i-th client;
[0089] m k is the remaining storage space of the kth machine tool server.
[0090] It should be noted that, through the above impr...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More