CN104142871A - Data backup method and device and distributed file system - Google Patents
Data backup method and device and distributed file system Download PDFInfo
- Publication number
- CN104142871A CN104142871A CN201310170578.7A CN201310170578A CN104142871A CN 104142871 A CN104142871 A CN 104142871A CN 201310170578 A CN201310170578 A CN 201310170578A CN 104142871 A CN104142871 A CN 104142871A
- Authority
- CN
- China
- Prior art keywords
- cost
- back end
- backup
- described back
- node
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Landscapes
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
- Computer And Data Communications (AREA)
Abstract
The invention discloses a data backup method and device and a distributed file system. The data backup method comprises, when a data backup request transmitted by a data node is received, transmitting a query request to a cost server for querying cost matrix information in a distributed system, which is associated with the data node; receiving response information transmitted by the cost server, wherein the cost information comprises the cost matrix information associated with the data node; computing the backup cost between the data node and any other candidate node through the cost matrix information, selecting the candidate node with the lowest backup cost as a target node, and transmitting the information of the target node to the data node so as to back data up to the target node through the data node. According to the data backup method, data backup is performed by selecting the node with the lowest backup cost according to a cost matrix, so that the problem of overhigh backup cost and node load non-uniformity can be effectively avoided.
Description
Technical field
The present invention relates to the communications field, particularly a kind of method for data backup, device and distributed file system.
Background technology
Cloud computing distributed file system utilizes multiple servers to provide large capacity highly reliable file service, and cluster comprises data server and LIST SERVER (meta data server).LIST SERVER is used for maintenance documentation data block in the distribution situation (metadata) of data server, and data server is used for storing concrete file data.Compare other memory technologies now, the advantages such as distributed file system is strong with its extendability, cost performance is high, zmodem have obtained the extensive approval of industry.Yet, how to guarantee the each side requirement of distributed file system, as extendability, availability, reliability, security, efficiency etc., be the problem that we need to solve.
In distributed system, copy mechanism is a kind of important method that improves validity and performance.Copy mechanism refers to when to file system writing data blocks, except data writing on a primary node, can distribute other several nodes and data writing in these nodes simultaneously.Concrete how many nodes that distribute determine according to the reliability requirement of system.Copy has made up the problems such as storage object single point failure, poor fault tolerance, access performance are not high.But introduce copy mechanism and also must bring the problem of the following aspects: copy consistency problem, load balance problem, the various hardware that creates a Copy and communicate by letter on cost problem and cloud computing task to copy access price problem etc.
Although copy mechanism can effectively improve the validity of distributed system, there is following problem in existing distributed file system data trnascription backup scenario:
While 1, creating data trnascription, do not consider the costs such as storage, communication, easily cause the problem of backup cost prohibitive.
2,, due to the random chosen position of data trnascription, when a large amount of copies concentrate on same node, may cause node load uneven.
Summary of the invention
The technical problem to be solved in the present invention is to provide a kind of method for data backup, device and distributed file system.By introducing cost matrix, according to cost matrix, select the minimum node of backup cost to carry out data backup, thereby effectively avoid occurring the problem of backup cost prohibitive and node load inequality.
According to an aspect of the present invention, provide a kind of method for data backup, comprising:
When receiving the data backup requests of back end transmission, to cost server, send inquiry request, the cost matrix information being associated with described back end for Querying Distributed system, wherein said back end is the primary node of data writing, and the cost matrix information being associated with described back end represents the carrying cost between other arbitrary both candidate nodes in described back end and distributed system;
Receive the response message that cost server sends, wherein response message comprises the cost matrix information being associated with described back end;
Utilize cost matrix information to calculate the backup cost between described back end and other arbitrary both candidate nodes;
Select the both candidate nodes of backup cost minimum as destination node;
Destination node information is sent to described back end, so that described back end backs up data on destination node.
Preferably, the step of utilizing cost matrix information to calculate the backup cost between described back end and other arbitrary both candidate nodes comprises:
Backup cost Cost (i, j) between back end i and both candidate nodes j is:
Wherein CM (i, j) [l] is the carrying cost of l dimension between described back end i and both candidate nodes j, W[l] be the cost weight of l dimension, K is dimension sum.
Preferably, the both candidate nodes of selection backup cost minimum comprises as the step of destination node:
To meet the both candidate nodes j of argminCost (i, j) as the destination node of described back end i.
Preferably, with the network state between any two nodes in predetermined time interval detection distributed system;
According to described network state, to cost server, send update request, to upgrade cost matrix information.
Preferably, the step with the network state between any two nodes in predetermined time interval detection distributed system comprises:
With the link congestion degree between any two nodes in predetermined time interval detection distributed system.
According to a further aspect in the invention, provide a kind of method for data backup, comprising:
When back end is during as the primary node of data writing, to host node, send data backup requests, to make host node obtain the cost matrix information being associated with described back end from cost server according to data backup requests, utilize cost matrix information to calculate the backup cost between described back end and other arbitrary both candidate nodes, select the both candidate nodes of backup cost minimum as destination node; The cost matrix information being wherein associated with described back end represents the carrying cost between other arbitrary both candidate nodes in described back end and distributed system;
Receive the destination node information that host node sends;
Back up data on destination node.
According to a further aspect in the invention, provide a kind of host node for data backup, comprising:
The first receiving element, the data backup requests sending for receiving back end, when receiving the data backup requests of back end transmission, indication the first transmitting element sends inquiry request, the primary node that wherein said back end is data writing to cost server;
The first transmitting element, be used for according to the indication of the first receiving element, to cost server, send inquiry request, the cost matrix information being associated with described back end for Querying Distributed system, the cost matrix information being wherein associated with described back end represents the carrying cost between other arbitrary both candidate nodes in described back end and distributed system;
The second receiving element, the response message sending for receiving cost server, wherein response message comprises the cost matrix information being associated with described back end;
Computing unit, for utilizing cost matrix information to calculate the backup cost between described back end and other arbitrary both candidate nodes;
Selected cell, for selecting the both candidate nodes of backup cost minimum as destination node;
The second transmitting element, for destination node information is sent to described back end, so that described back end backs up data on destination node.
Preferably, computing unit specifically utilizes the backup cost Cost (i, j) between following formula computational data node i and both candidate nodes j:
Wherein CM (i, j) [l] is the carrying cost of l dimension between described back end i and both candidate nodes j, W[l] be the cost weight of l dimension, K is dimension sum.
Preferably, selected cell specifically will meet the both candidate nodes j of argminCost (i, j) as the destination node of described back end i.
Preferably, control module also comprises detecting unit, wherein:
Detecting unit, for the network state with between any two nodes of predetermined time interval detection distributed system;
The first transmitting element is also for sending update request according to described network state to cost server, to upgrade cost matrix information.
Preferably, detecting unit is specifically with the link congestion degree between any two nodes in predetermined time interval detection distributed system.
According to a further aspect in the invention, provide a kind of back end for data backup, comprising:
The 3rd transmitting element, for when back end is during as the primary node of data writing, to host node, send data backup requests, to make host node obtain the cost matrix information being associated with described back end from cost server according to data backup requests, utilize cost matrix information to calculate the backup cost between described back end and other arbitrary both candidate nodes, select the both candidate nodes of backup cost minimum as destination node; The cost matrix information being wherein associated with described back end represents the carrying cost between other arbitrary both candidate nodes in described back end and distributed system;
The 3rd receiving element, the destination node information sending for receiving host node;
Backup units, for backing up data to destination node.
According to a further aspect in the invention, provide a kind of distributed file system for data backup, comprise host node and back end, wherein host node is the host node that above-mentioned arbitrary embodiment relates to, and back end is the back end that above-mentioned arbitrary embodiment relates to.
The present invention, by introducing cost matrix, selects the minimum node of backup cost to carry out data backup according to cost matrix, thereby effectively avoids occurring the problem of backup cost prohibitive and node load inequality.
Description of the invention provides for example with for the purpose of describing, and is not exhaustively or limit the invention to disclosed form.Many modifications and variations are obvious for the ordinary skill in the art.Selecting and describing embodiment is for better explanation principle of the present invention and practical application, thereby and makes those of ordinary skill in the art can understand the various embodiment with various modifications that the present invention's design is suitable for special-purpose.
Accompanying drawing explanation
In order to be illustrated more clearly in the embodiment of the present invention or technical scheme of the prior art, to the accompanying drawing of required use in embodiment or description of the Prior Art be briefly described below, apparently, accompanying drawing in the following describes is only some embodiments of the present invention, for those of ordinary skills, do not paying under the prerequisite of creative work, can also obtain according to these accompanying drawings other accompanying drawing.
Fig. 1 is the schematic diagram of an embodiment of data back up method of the present invention.
Fig. 2 is the schematic diagram of another embodiment of data back up method of the present invention.
Fig. 3 is that the present invention is for the schematic diagram of an embodiment of host node of data backup.
Fig. 4 is that the present invention is for the schematic diagram of another embodiment of host node of data backup.
Fig. 5 is that the present invention is for the schematic diagram of an embodiment of back end of data backup.
Fig. 6 is that the present invention is for the schematic diagram of an embodiment of distributed file system of data backup.
Fig. 7 is the network diagram of distributed file system of the present invention.
Embodiment
Below in conjunction with the accompanying drawing in the embodiment of the present invention, the technical scheme in the embodiment of the present invention is clearly and completely described, obviously, described embodiment is only the present invention's part embodiment, rather than whole embodiment.To the description only actually of at least one exemplary embodiment, be illustrative below, never as any restriction to the present invention and application or use.Embodiment based in the present invention, those of ordinary skills, not making the every other embodiment obtaining under creative work prerequisite, belong to the scope of protection of the invention.
Unless illustrate in addition, otherwise the parts of setting forth in these embodiments and positioned opposite, numeral expression formula and the numerical value of step not limited the scope of the invention.
, it should be understood that for convenience of description, the size of the various piece shown in accompanying drawing is not to draw according to actual proportionate relationship meanwhile.
For the known technology of person of ordinary skill in the relevant, method and apparatus, may not discuss in detail, but in suitable situation, described technology, method and apparatus should be regarded as authorizing a part for instructions.
In all examples with discussing shown here, it is exemplary that any occurrence should be construed as merely, rather than as restriction.Therefore, other example of exemplary embodiment can have different values.
It should be noted that: in similar label and letter accompanying drawing below, represent similar terms, therefore, once be defined in an a certain Xiang Yi accompanying drawing, in accompanying drawing subsequently, do not need it to be further discussed.
Fig. 1 is the schematic diagram of an embodiment of data back up method of the present invention.Preferably, the method step of this embodiment can be carried out by the host node (Name Node) in distributed system.
Step 101, when receiving the data backup requests of back end transmission, sends inquiry request, the cost matrix information being associated with described back end for Querying Distributed system to cost server.
Wherein said back end is the primary node of data writing, and the cost matrix information being associated with described back end represents the carrying cost between other arbitrary both candidate nodes in described back end and distributed system.
Step 102, receives the response message that cost server sends, and wherein response message comprises the cost matrix information being associated with described back end.
Step 103, utilizes cost matrix information to calculate the backup cost between described back end and other arbitrary both candidate nodes.
Step 104, selects the both candidate nodes of backup cost minimum as destination node.
Step 105, sends to described back end by destination node information, so that described back end backs up data on destination node.
The data back up method providing based on the above embodiment of the present invention, by introducing cost matrix, selects the minimum node of backup cost to carry out data backup according to cost matrix, thereby effectively avoids occurring the problem of backup cost prohibitive and node load inequality.
Cost matrix design can design according to the actual conditions of distributed system.As shown in table 1, be the sample of a cost matrix.Cost matrix roughly can be divided into two parts: node serial number and various cost amount.Node serial number has comprised source node (first node that data write) and destination node number information; Cost amount comprises storage cost (consistency maintenance cost, loading condition, handling capacity etc.), communication cost (geographic distance, transmission bandwidth, leap interstitial content, link load situation etc.) and other.Be a simplified example herein, concrete scheme be not limited in any way, keeper can be by the self-defined included cost information of demand.
Table 1
Preferably, the above-mentioned step of utilizing cost matrix information to calculate the backup cost between described back end and other arbitrary both candidate nodes comprises:
Backup cost Cost (i, j) between back end i and both candidate nodes j is:
Wherein CM (i, j) [l] is the carrying cost of l dimension between described back end i and both candidate nodes j, W[l] be the cost weight of l dimension, K is dimension sum.
Wherein, concrete dimension can be determined according to actual requirement, the most simply can directly for example, with one dimension (degree of Congestion), weigh.
Preferably, the both candidate nodes of above-mentioned selection backup cost minimum comprises as the step of destination node:
To meet the both candidate nodes j of argminCost (i, j) as the destination node of described back end i.
In addition, due to the change along with data backup operation and resource situation, can there is dynamic change in cost matrix, therefore need to detect the cost matrix that upgrades in time to network state.Preferably, can predetermined time interval detect the network state between any two nodes in distributed system, according to described network state, to cost server, send update request, to upgrade cost matrix information.
Preferably, the above-mentioned step with the network state between any two nodes in predetermined time interval detection distributed system comprises:
With the link congestion degree between any two nodes in predetermined time interval detection distributed system.
That is to say, concrete update strategy can be realized by state and the network link loads of monitor server node.Simple method is the link congestion degree between each back end of monitoring, uses Congestion Level SPCC as matrix cost value.Monitoring method can be utilized the SNMP(Simple Network Management Protocol of standard, Simple Network Management Protocol) management interface obtained the present flow rate of link every 5 minutes, degree of Congestion is just further defined as the bandwidth ratio of present flow rate and link, and the Congestion Level SPCC of the larger representative of numerical value is higher.Thereby in distributed file system inside, can automatically set up the storage backup scheduling mechanism of a fair relatively.
In addition, the introducing of cost matrix, except data backup scheduling mechanism and cloud computing subtask load mechanism, also can play important reference role to other scheduling mechanisms, such as recovery mechanism, copy consistency maintenance mechanism etc.
Fig. 2 is the schematic diagram of another embodiment of data back up method of the present invention.Preferably, this embodiment method step can be carried out by the primary node as data writing.
Step 201, when back end is during as the primary node of data writing, to host node, send data backup requests, to make host node obtain the cost matrix information being associated with described back end from cost server according to data backup requests, utilize cost matrix information to calculate the backup cost between described back end and other arbitrary both candidate nodes, select the both candidate nodes of backup cost minimum as destination node; The cost matrix information being wherein associated with described back end represents the carrying cost between other arbitrary both candidate nodes in described back end and distributed system.
Step 202, receives the destination node information that host node sends.
Step 203, backs up data on destination node.
The data back up method providing based on the above embodiment of the present invention, by introducing cost matrix, selects the minimum node of backup cost to carry out data backup according to cost matrix, thereby effectively avoids occurring the problem of backup cost prohibitive and node load inequality.
Fig. 3 is that the present invention is for the schematic diagram of an embodiment of host node of data backup.As shown in Figure 3, host node comprises:
The first receiving element 301, the data backup requests sending for receiving back end, when receiving the data backup requests of back end transmission, indication the first transmitting element 302 sends inquiry request, the primary node that wherein said back end is data writing to cost server.
The first transmitting element 302, be used for according to the indication of the first receiving element 301, to cost server, send inquiry request, the cost matrix information being associated with described back end for Querying Distributed system, the cost matrix information being wherein associated with described back end represents the carrying cost between other arbitrary both candidate nodes in described back end and distributed system.
The second receiving element 303, the response message sending for receiving cost server, wherein response message comprises the cost matrix information being associated with described back end.
Computing unit 304, for utilizing cost matrix information to calculate the backup cost between described back end and other arbitrary both candidate nodes.
Selected cell 305, for selecting the both candidate nodes of backup cost minimum as destination node.
The second transmitting element 306, for destination node information is sent to described back end, so that described back end backs up data on destination node.
The host node providing based on the above embodiment of the present invention, by introducing cost matrix, selects the minimum node of backup cost to carry out data backup according to cost matrix, thereby effectively avoids occurring the problem of backup cost prohibitive and node load inequality.
Preferably, computing unit 304 specifically utilizes the backup cost Cost (i, j) between following formula computational data node i and both candidate nodes j:
Wherein CM (i, j) [l] is the carrying cost of l dimension between described back end i and both candidate nodes j, W[l] be the cost weight of l dimension, K is dimension sum.
Preferably, selected cell 305 specifically will meet the both candidate nodes j of argminCost (i, j) as the destination node of described back end i.
Fig. 4 is that the present invention is for the schematic diagram of another embodiment of host node of data backup.Compare with embodiment illustrated in fig. 3, in the embodiment shown in fig. 4, control module also comprises detecting unit 401.Wherein:
Detecting unit 401, for the network state with between any two nodes of predetermined time interval detection distributed system.
The first transmitting element 302 is also for sending update request according to described network state to cost server, to upgrade cost matrix information.
Preferably, detecting unit is specifically with the link congestion degree between any two nodes in predetermined time interval detection distributed system.
Fig. 5 is that the present invention is for the schematic diagram of an embodiment of back end of data backup.As shown in Figure 5, this back end comprises:
The 3rd transmitting element 501, for when back end is during as the primary node of data writing, to host node, send data backup requests, to make host node obtain the cost matrix information being associated with described back end from cost server according to data backup requests, utilize cost matrix information to calculate the backup cost between described back end and other arbitrary both candidate nodes, select the both candidate nodes of backup cost minimum as destination node; The cost matrix information being wherein associated with described back end represents the carrying cost between other arbitrary both candidate nodes in described back end and distributed system.
The 3rd receiving element 502, the destination node information sending for receiving host node.
Backup units 503, for backing up data to destination node.
The back end providing based on the above embodiment of the present invention, by introducing cost matrix, selects the minimum node of backup cost to carry out data backup according to cost matrix, thereby effectively avoids occurring the problem of backup cost prohibitive and node load inequality.
Fig. 6 is that the present invention is for the schematic diagram of an embodiment of distributed file system of data backup.Wherein, in embodiment described in Fig. 6, distributed file system comprises host node 601 and back end 602.Wherein:
Host node is the host node that in accompanying drawing 3-4, arbitrary embodiment relates to, and back end is the back end that in accompanying drawing 5, arbitrary embodiment relates to.
For brevity, in Fig. 6, only provided a back end.Yet those skilled in the art are scrutable, in this system, can there are a plurality of back end.Fig. 7 is the network diagram of distributed file system of the present invention.
The technical scheme that the present invention proposes, with respect to existing distributed file system data backup scenario, possesses following advantage:
1. perfection has solved above-mentioned backup cost prohibitive, and when node load inequality and execution cloud computing task, copy access price is crossed a Senior Three subject matter.
2. except data backup scheduling mechanism and task load mechanism, the introducing of cost matrix can provide important reference role for other scheduling mechanisms of inside of distributed file system.
3. the distributed file system data backup scenario based on cost matrix that this patent proposes, does not have any special requirement to the soft hardware equipment of distributed file system.User only need to additionally arrange in distributed file system that a cost server can realize described data backup scenario.
One of ordinary skill in the art will appreciate that all or part of step that realizes above-described embodiment can complete by hardware, also can come the hardware that instruction is relevant to complete by program, described program can be stored in a kind of computer-readable recording medium, the above-mentioned storage medium of mentioning can be ROM (read-only memory), disk or CD etc.
Claims (13)
1. for a method for data backup, it is characterized in that, comprising:
When receiving the data backup requests of back end transmission, to cost server, send inquiry request, the cost matrix information being associated with described back end for Querying Distributed system, wherein said back end is the primary node of data writing, and the cost matrix information being associated with described back end represents the carrying cost between other arbitrary both candidate nodes in described back end and distributed system;
Receive the response message that cost server sends, wherein response message comprises the cost matrix information being associated with described back end;
Utilize cost matrix information to calculate the backup cost between described back end and other arbitrary both candidate nodes;
Select the both candidate nodes of backup cost minimum as destination node;
Destination node information is sent to described back end, so that described back end backs up data on destination node.
2. method according to claim 1, is characterized in that,
The step of utilizing cost matrix information to calculate the backup cost between described back end and other arbitrary both candidate nodes comprises:
Backup cost Cost (i, j) between back end i and both candidate nodes j is:
Wherein CM (i, j) [l] is the carrying cost of l dimension between described back end i and both candidate nodes j, W[l] be the cost weight of l dimension, K is dimension sum.
3. method according to claim 2, is characterized in that,
The both candidate nodes of selection backup cost minimum comprises as the step of destination node:
To meet the both candidate nodes j of argminCost (i, j) as the destination node of described back end i.
4. according to the method described in any one in claim 1-3, it is characterized in that,
With the network state between any two nodes in predetermined time interval detection distributed system;
According to described network state, to cost server, send update request, to upgrade cost matrix information.
5. method according to claim 4, is characterized in that,
Step with the network state between any two nodes in predetermined time interval detection distributed system comprises:
With the link congestion degree between any two nodes in predetermined time interval detection distributed system.
6. for a method for data backup, it is characterized in that, comprising:
When back end is during as the primary node of data writing, to host node, send data backup requests, to make host node obtain the cost matrix information being associated with described back end from cost server according to data backup requests, utilize cost matrix information to calculate the backup cost between described back end and other arbitrary both candidate nodes, select the both candidate nodes of backup cost minimum as destination node; The cost matrix information being wherein associated with described back end represents the carrying cost between other arbitrary both candidate nodes in described back end and distributed system;
Receive the destination node information that host node sends;
Back up data on destination node.
7. for a host node for data backup, it is characterized in that, comprising:
The first receiving element, the data backup requests sending for receiving back end, when receiving the data backup requests of back end transmission, indication the first transmitting element sends inquiry request, the primary node that wherein said back end is data writing to cost server;
The first transmitting element, be used for according to the indication of the first receiving element, to cost server, send inquiry request, the cost matrix information being associated with described back end for Querying Distributed system, the cost matrix information being wherein associated with described back end represents the carrying cost between other arbitrary both candidate nodes in described back end and distributed system;
The second receiving element, the response message sending for receiving cost server, wherein response message comprises the cost matrix information being associated with described back end;
Computing unit, for utilizing cost matrix information to calculate the backup cost between described back end and other arbitrary both candidate nodes;
Selected cell, for selecting the both candidate nodes of backup cost minimum as destination node;
The second transmitting element, for destination node information is sent to described back end, so that described back end backs up data on destination node.
8. host node according to claim 7, is characterized in that,
Computing unit specifically utilizes the backup cost Cost (i, j) between following formula computational data node i and both candidate nodes j:
Wherein CM (i, j) [l] is the carrying cost of l dimension between described back end i and both candidate nodes j, W[l] be the cost weight of l dimension, K is dimension sum.
9. host node according to claim 8, is characterized in that,
Selected cell specifically will meet the both candidate nodes j of argminCost (i, j) as the destination node of described back end i.
10. according to the host node described in any one in claim 7-9, it is characterized in that, control module also comprises detecting unit, wherein:
Detecting unit, for the network state with between any two nodes of predetermined time interval detection distributed system;
The first transmitting element is also for sending update request according to described network state to cost server, to upgrade cost matrix information.
11. host nodes according to claim 10, is characterized in that,
Detecting unit is specifically with the link congestion degree between any two nodes in predetermined time interval detection distributed system.
12. 1 kinds of back end for data backup, is characterized in that, comprising:
The 3rd transmitting element, for when back end is during as the primary node of data writing, to host node, send data backup requests, to make host node obtain the cost matrix information being associated with described back end from cost server according to data backup requests, utilize cost matrix information to calculate the backup cost between described back end and other arbitrary both candidate nodes, select the both candidate nodes of backup cost minimum as destination node; The cost matrix information being wherein associated with described back end represents the carrying cost between other arbitrary both candidate nodes in described back end and distributed system;
The 3rd receiving element, the destination node information sending for receiving host node;
Backup units, for backing up data to destination node.
13. 1 kinds of distributed file systems for data backup, is characterized in that, comprising: host node and back end, wherein:
Host node is the host node that in claim 7-11, any one relates to;
Back end is the back end relating in claim 12.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310170578.7A CN104142871B (en) | 2013-05-10 | 2013-05-10 | Data backup method and device and distributed file system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310170578.7A CN104142871B (en) | 2013-05-10 | 2013-05-10 | Data backup method and device and distributed file system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN104142871A true CN104142871A (en) | 2014-11-12 |
| CN104142871B CN104142871B (en) | 2017-05-24 |
Family
ID=51852052
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201310170578.7A Active CN104142871B (en) | 2013-05-10 | 2013-05-10 | Data backup method and device and distributed file system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN104142871B (en) |
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106648970A (en) * | 2016-11-04 | 2017-05-10 | 北京华为数字技术有限公司 | File backup method and distributed file system |
| CN108023967A (en) * | 2017-12-20 | 2018-05-11 | 联想(北京)有限公司 | A kind of management equipment in data balancing method, apparatus and distributed memory system |
| CN108628706A (en) * | 2018-05-02 | 2018-10-09 | 北京新桥信通科技股份有限公司 | Method, apparatus, system and the storage medium of data backup |
| CN108875035A (en) * | 2018-06-25 | 2018-11-23 | 郑州云海信息技术有限公司 | The date storage method and relevant device of distributed file system |
| CN112241319A (en) * | 2019-07-19 | 2021-01-19 | 伊姆西Ip控股有限责任公司 | Method, electronic device and computer program product for balancing load |
| CN112306962A (en) * | 2019-07-26 | 2021-02-02 | 杭州海康威视数字技术股份有限公司 | File copying method and device in computer cluster system and storage medium |
| WO2021036330A1 (en) * | 2019-08-28 | 2021-03-04 | 华为技术有限公司 | Backup processing method and server |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20060020575A1 (en) * | 2002-03-21 | 2006-01-26 | United States Postal Service | Method and system for storing and retrieving data using hash-accessed multiple data stores |
| CN102082830A (en) * | 2011-01-18 | 2011-06-01 | 浙江大学 | Unstable network-oriented distributed file storage method based on quality perception |
| CN102880531A (en) * | 2012-09-27 | 2013-01-16 | 新浪网技术(中国)有限公司 | Database backup system and backup method and slave database server of database backup system |
| CN103078936A (en) * | 2012-12-31 | 2013-05-01 | 网宿科技股份有限公司 | Metadata hierarchical storage method and system for Global file system (GFS)-based distributed file system |
-
2013
- 2013-05-10 CN CN201310170578.7A patent/CN104142871B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20060020575A1 (en) * | 2002-03-21 | 2006-01-26 | United States Postal Service | Method and system for storing and retrieving data using hash-accessed multiple data stores |
| CN102082830A (en) * | 2011-01-18 | 2011-06-01 | 浙江大学 | Unstable network-oriented distributed file storage method based on quality perception |
| CN102880531A (en) * | 2012-09-27 | 2013-01-16 | 新浪网技术(中国)有限公司 | Database backup system and backup method and slave database server of database backup system |
| CN103078936A (en) * | 2012-12-31 | 2013-05-01 | 网宿科技股份有限公司 | Metadata hierarchical storage method and system for Global file system (GFS)-based distributed file system |
Cited By (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106648970A (en) * | 2016-11-04 | 2017-05-10 | 北京华为数字技术有限公司 | File backup method and distributed file system |
| CN108023967A (en) * | 2017-12-20 | 2018-05-11 | 联想(北京)有限公司 | A kind of management equipment in data balancing method, apparatus and distributed memory system |
| CN108023967B (en) * | 2017-12-20 | 2021-05-18 | 联想(北京)有限公司 | Data balancing method and device and management equipment in distributed storage system |
| CN108628706A (en) * | 2018-05-02 | 2018-10-09 | 北京新桥信通科技股份有限公司 | Method, apparatus, system and the storage medium of data backup |
| CN108875035A (en) * | 2018-06-25 | 2018-11-23 | 郑州云海信息技术有限公司 | The date storage method and relevant device of distributed file system |
| CN108875035B (en) * | 2018-06-25 | 2022-02-18 | 郑州云海信息技术有限公司 | Data storage method of distributed file system and related equipment |
| CN112241319A (en) * | 2019-07-19 | 2021-01-19 | 伊姆西Ip控股有限责任公司 | Method, electronic device and computer program product for balancing load |
| CN112306962A (en) * | 2019-07-26 | 2021-02-02 | 杭州海康威视数字技术股份有限公司 | File copying method and device in computer cluster system and storage medium |
| CN112306962B (en) * | 2019-07-26 | 2024-02-23 | 杭州海康威视数字技术股份有限公司 | File copying method, device and storage medium in computer cluster system |
| WO2021036330A1 (en) * | 2019-08-28 | 2021-03-04 | 华为技术有限公司 | Backup processing method and server |
| US11971786B2 (en) | 2019-08-28 | 2024-04-30 | Huawei Technologies Co., Ltd. | Backup processing method and server |
Also Published As
| Publication number | Publication date |
|---|---|
| CN104142871B (en) | 2017-05-24 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN104142871A (en) | Data backup method and device and distributed file system | |
| US11620187B2 (en) | Distributing data on distributed storage systems | |
| CN104937584B (en) | Based on the quality of shared resource to the service quality of virtual machine and application program offer optimization through priority ranking | |
| US9990147B2 (en) | Methods and apparatus for optimizing resource utilization in distributed storage systems | |
| US9542404B2 (en) | Subpartitioning of a namespace region | |
| US9483482B2 (en) | Partitioning file system namespace | |
| US8626936B2 (en) | Protocol independent server replacement and replication in a storage area network | |
| CN106843745A (en) | Capacity expansion method and device | |
| CN107534570A (en) | Virtualize network function monitoring | |
| CN106603692B (en) | Data storage method and device in distributed storage system | |
| CN102088490A (en) | Data storage method, device and system | |
| US10990464B1 (en) | Block-storage service supporting multi-attach and health check failover mechanism | |
| US11922059B2 (en) | Method and device for distributed data storage | |
| CN102025783A (en) | Cluster system, message processing method thereof and protocol forward gateway | |
| CN110825704A (en) | Data reading method, data writing method and server | |
| US8977595B1 (en) | Message-recovery file log locating and monitoring | |
| CN106681656A (en) | Dynamically-adjustable cloud storage system fault tolerance method | |
| CN104537045A (en) | Service distribution method and device based on distributive system | |
| US8032636B2 (en) | Dynamically provisioning clusters of middleware appliances | |
| KR20160097372A (en) | Efficient resource utilization in data centers | |
| CN108366110A (en) | A kind of website data interactive system and method | |
| CN105825332B (en) | Electrical energy measurement monitoring platform and its method based on cloud computing | |
| KR101704928B1 (en) | System and method for distributively storing files using gpu | |
| US11579780B1 (en) | Volume remote copy based on application priority | |
| US20150088826A1 (en) | Enhanced Performance for Data Duplication |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |