CN108132855A - A kind of full service data backup policy in mobile ad-hoc network - Google Patents
A kind of full service data backup policy in mobile ad-hoc network Download PDFInfo
- Publication number
- CN108132855A CN108132855A CN201711287683.3A CN201711287683A CN108132855A CN 108132855 A CN108132855 A CN 108132855A CN 201711287683 A CN201711287683 A CN 201711287683A CN 108132855 A CN108132855 A CN 108132855A
- Authority
- CN
- China
- Prior art keywords
- backup
- data
- node
- storage
- business datum
- 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
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F11/00—Error detection; Error correction; Monitoring
- G06F11/07—Responding to the occurrence of a fault, e.g. fault tolerance
- G06F11/14—Error detection or correction of the data by redundancy in operation
- G06F11/1402—Saving, restoring, recovering or retrying
- G06F11/1446—Point-in-time backing up or restoration of persistent data
- G06F11/1458—Management of the backup or restore process
- G06F11/1464—Management of the backup or restore process for networked environments
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/90—Details of database functions independent of the retrieved data types
- G06F16/901—Indexing; Data structures therefor; Storage structures
- G06F16/9024—Graphs; Linked lists
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Databases & Information Systems (AREA)
- Quality & Reliability (AREA)
- Software Systems (AREA)
- Data Mining & Analysis (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The present invention relates to a kind of full service data backup policy in mobile ad-hoc network, which mainly includes the following steps that：1) business datum dispersion storage, 2) acquisition of service backup data, 3) service backup data acquisition.The strategy is equipped with the business datum backup center with high-performance mass data storage and transceiving data packet function for mobile ad-hoc network；The strategy has the function of that backup endpoint resumes, and when network blocks, backup can be interrupted；When network recovery is normal, backup can restart and continue automatically at interruption；Algorithm is stored using multiple index.The strategy realizes the recovery of little particle data, and the influence to system is minimized, and resume speed greatly improves, while improves the backup success rate and storage efficiency of Backup Data.
Description
Technical field
The invention belongs to technical field of memory, are related to a kind of full service data backup plan in mobile ad-hoc network
Slightly.
Background technology
Current information age, data and information are increasingly becoming the service basic and economic lifeline of all trades and professions.In business
The data restoring force that complete business datum backup and service data loss are obtained in the transmission process of data is even more important.
With the fast development of computer technology, more and more enterprises handle daily industry using computer system now
Business.It is believed that all once there was such experience at the information management system center of many enterprises, spends and worked laboriously to be established for a long time
The data information risen, suddenly because of disasters such as unpredictable system failure, hard disk corruptions or virus infractions, is destroyed overnight.It prevents
These disasters, best solution are to carry out data backup in advance, data backup be in system administration one it is particularly significant
Work, be the important leverage for dealing with catastrophic failure.One good data backup scenario, can be such that we are collapsed in the system of encountering
Burst, hacker attack situations such as and when causing loss of data, destroyed system and right is restored with most fast speed, shortest time
Outer service reduces the various data degradations that may be brought to the maximum extent.
The generation of data failure is prevented, there are many approach, such as：Strengthen sales department safety measure, improve operator it is horizontal,
Buy soft hardware equipment best in quality etc., but most basic method or the backup system of Erecting and improving.
The back-up arrangement used at present generally has disk mirroring, disk array, dual computer fault-tolerant etc., but these measures belong to
Hardware level backs up, and is said from logical perspective, and data are actually only a, so system failure and mathematical logic are damaged in these measures
Bad is helpless, if mistake occurs for data, these mistakes can be copied to institute's some places quickly.These back-up arrangements
Fault-tolerant measure should be more referred to as, they and system backup are the system protection means on two levels.
In fact, ideal standby system is comprehensive, multi-level.First, using hardware backup come prevent hardware fault,
The unremitting operation of guarantee business；Secondly, it is often more important that protect computer system data comprehensively using software backup means.Such as
Fruit causes the logic damage of data due to software fault or artificial maloperation, then is combined using software mode and manual mode
Method recovery system, this combination constitute the multistage protection to system, can not only effectively prevent physical damage, also
Logic damage can thoroughly be prevented.
The strategy of backup is to come determining, the data volume to be backed up depending on user, Backup Data according to the demand of user
Retain how long, when can be backed up, the BACKUP TIME that can bear etc..Therefore, a kind of complete business number how is designed
Become the emphasis studied at present according to backup policy.
Invention content
In view of this, the purpose of the present invention is to provide a kind of backups of the full service data in mobile ad-hoc network
Strategy, the strategy are equipped with business datum backup center for mobile ad-hoc network, and the data for a high-performance large capacity are deposited
Reservoir, and there is transceiving data packet；This back mechanism is simple and practical, can be good at improving backup success rate,
Have the function of that backup endpoint resumes, when network blocks, backup can also be interrupted；Once network recovery is normal, standby
Part can restart and continue automatically at interruption；Algorithm is stored using multiple index, improves backup data store efficiency；
Fine backup data index when user wishes to restore data, does not need to restore whole system in most cases, only
Need recovered part data.Multiple index is conducive to the data restored required for quickly searching and position when restoring, realizes
Little particle data are restored, while the influence of system will be minimized, and resume speed greatly improves.
In order to achieve the above objectives, the present invention provides following technical solution：
The backup policy of business datum, specifically includes following steps in a kind of mobile ad-hoc network：
Step 1)：Business datum dispersion storage；
Step 2)：Service backup data acquire；
Step 3)：Service backup data acquisition；
Further, in the step 1), business datum dispersion storage specifically includes following steps：
Step 1-1)：Business datum is in transmission process, each data packet that backup node receives, and storage is to local slow
It deposits, is then forwarded to next node；
Step 12)：When local node detects the reception confirmation packet received from next node within a certain period of time, it is determined that
Next node has been received by the data packet, then empties the local node data pack buffer；Otherwise step 13) is performed；
Step 13)：If the reception for confiscating next node confirms packet, local node is just stored, is deposited until to data always
It stores up server and shifts all Backup Datas.
Further, in the step 2), the acquisition of service backup data specifically includes following steps：
Step 21)：When the business datum backup table length of each node reaches certain limit, just open and business datum
The Backup Data stored in business datum backup table is all sent to business datum backup center by the communication of backup center node
Node；
Step 22)：The storage chained list that business datum backup center node is safeguarded when initial is sky, when receiving Backup Data
Bao Shi, the backup data package received using multiple index storage algorithm process.
Further, in the step 22), multiple index storage algorithm specifically includes following steps：
Step 221)：When backup data package reaches business datum backup center node, since the gauge outfit of storage chained list,
Traversal storage chained list, if source address is identical, omparison purpose address；If source address is different, it is directly inserted into storage chained list table
Tail；
Step 222)：Service identification if destination address is identical, is just compared in omparison purpose address；If destination address is different,
It is inserted into before the source address variation node of storage chained list；
Step 223)：Compare service identification, if service identification is consistent, packet sequence is sequentially inserted into, if service identification is not
Before consistent then storage to destination address variation node, so far algorithm terminates.
Further, in the step 3), the storage chained list after multiple index stores algorithm process is inquired, according to data packet
Mark takes out all service backup data.
The beneficial effects of the present invention are：The backup policy can be good at improving backup success rate and backup data store
Efficiency；Fine backup data index can realize a demand for recovered part data；Multiple index is conducive to when restoring
The data restored required for quickly searching and positioning realize that little particle data are restored, while the influence of system will be dropped to most
Small, resume speed greatly improves.
Description of the drawings
In order to make the purpose of the present invention, technical solution and advantageous effect clearer, the present invention provides drawings described below and carries out
Explanation：
Fig. 1 receives datagram for backup node；
Fig. 2 receives data validation packet figure for backup node；
Fig. 3 receives data validation packet failure map for backup node；
Fig. 4 stores algorithm flow chart for multiple index；
Fig. 5 is processing data packets flow chart.
Specific embodiment
Below in conjunction with attached drawing, the preferred embodiment of the present invention is described in detail.
It is to move in the strategy the present invention provides a kind of backup policy of the full service data in mobile ad-hoc network
Dynamic self-organizing network is equipped with business datum backup center, is the data storage of a high-performance large capacity, and with transmitting-receiving
The function of data packet；This back mechanism is simple and practical, can be good at improving backup success rate, be resumed with backup endpoint
Function, when network blocks, backup can also interrupt；Once network recovery is normal, backup can be at interruption certainly
It is dynamic to restart and continue；Algorithm is stored using multiple index, improves backup data store efficiency；Fine Backup Data rope
Draw, when user wishes to restore data, do not need to restore whole system in most cases, it is only necessary to recovered part data.
Multiple index is conducive to the data restored required for quickly searching and position when restoring, and realizes that little particle data are restored, together
When the influence of system will be minimized, resume speed greatly improves.It, will be to IP data in order to preferably realize the backup policy
Packet form is modified.Modified IP packets form is as shown in table 1：
1 modified IP packets form of table
Step 1-1)：As shown in Figure 1, business datum is in transmission process, each data packet that backup node receives, storage
To local cache, it is then forwarded to next node；
It is described in detail below：Backup node S receives the backup data package Pk1 from other nodes, data packet format such as table 2
It is shown, data packet is stored to local cache, is subsequently sent to next node B.
2 data packet format of table
| Raw address | Destination address | Service identification | Packet sequence | Business datum |
| S | D | F | N | Data |
Step 1-2)：As shown in Fig. 2, when the node detects that receive the reception from next node true within a certain period of time
Recognize packet, can confirm that next node has been received by the data packet, just empty caching of the data packet in local node；Otherwise it performs
Step 1-3)；
It is described in detail below：
When backup node D has received the data packet Pk1 of backup node S, then reply one to node S and confirm packet Pdr,
Confirm that packet form is as shown in table 3, after node receives confirmation packet Pdr, while emptying the data packet in local caching Pk1.
Table 3 confirms packet form
| Raw address | Destination address | Service identification | Packet sequence | Data reception acknowledgement packet identifies |
| S | D | F | N | T |
Step 1-3) if as shown in figure 3, do not receive the packet of accepting confirmation of next node, it just stores always, until to number
All Backup Datas are shifted according to storage server；
It is described in detail below：
When backup node D has received the data packet Pk1 of backup node S, then reply one to node S and confirm packet Pdr,
Due to the link down between BC, S can not receive confirmation packet, and backup node D preserves local caching Pk1, Zhi Daoxiang always
Data storage server shifts all Backup Datas；
Further, node received data packet process flow is as shown in Figure 5.
Step 2-1) when the business datum backup table length of each node reaches certain limit, just open and business datum
The Backup Data stored in business datum backup table is all sent to business datum backup center by the communication of backup center node
Node；
Step 2-2) business datum backup center node it is initial when the storage chained list safeguarded be sky, when data is received,
Using multiple index storage algorithm (Muti-Level Index Storage Algorithm, MDISA)；
Further algorithm performs are described as follows：
Step 2-3) backup data package reach when, since storage chained list gauge outfit, traversal storage chained list, if source address phase
Together, then omparison purpose address；Table tail is directly inserted into if source address difference；
Step 2-4) omparison purpose address, if destination address is identical, just compare service identification；It is inserted if destination address difference
Enter to before source address variation node；
Step 2-5) compare service identification, if service identification is consistent, packet sequence is sequentially inserted into, if service identification differs
It causes before then storage to destination address variation node, so far algorithm terminates；
It is described in detail below：
When backup node is subsequently received data packet (P1, P2, P3, P4, P5, P6, packet content are as shown in table 4), initially
When storage chained list for sky, then using multiple index storage algorithm stored, detailed algorithm flow as shown in figure 4, storage
The change procedure of chained list is as shown in table 5；
4 packet content of table
Table 5 stores the variation of chained list
Step 3-1) the storage chained list is inquired, restore Backup Data, all service backups are taken out according to data packet mark
Data；Packet mark is a shaping variable (1 represents business data packet, and 2 represent Hello packets, and 3 represent data reception acknowledgement packet)；
Algorithm detailed process is as follows：
Step 3-2) traversal storage chained list, filters the packet that all packets are identified as 1, is denoted as raw data packets, otherwise, restore number
According to failure；
Step 3-3) traversal raw data packets, the packet that service identification is x is filtered out, is denoted as business packet, restores data failure；
Step 3-4) all business packets of traversal, data packet is arranged by packet sequence descending, then restores data successively；
So far a complete business datum backup performs completion.
Finally illustrate, preferred embodiment above is merely illustrative of the technical solution of the present invention and unrestricted, although logical
It crosses above preferred embodiment the present invention is described in detail, however, those skilled in the art should understand that, can be
Various changes are made to it in form and in details, without departing from claims of the present invention limited range.
Claims (5)
1. a kind of full service data backup policy in mobile ad-hoc network, it is characterised in that：The strategy is moves certainly
Network arrangement business datum backup center is organized, is the data storage of a high-performance large capacity, and with transceiving data
The function of packet；The strategy has the function of that backup endpoint resumes, and when network blocks, backup can be interrupted；Work as network
When restoring normal, backup can restart and continue automatically at interruption；Using multiple index storage algorithm (Muti-Level
Index Storage Algorithm, MDISA)；
The strategy specifically includes following steps：
S1：Business datum dispersion storage；
S2：Service backup data acquire；
S3：Service backup data acquisition.
2. a kind of full service data backup policy in mobile ad-hoc network as described in claim 1, feature exist
In in the step S1, business datum dispersion storage specifically includes following steps：
S11：Business datum is in transmission process, each data packet that backup node receives, then storage to local cache is sent
To next node；
S12：When local node detects the reception confirmation packet received from next node within a certain period of time, it is determined that next node
The data packet is had been received by, then empties the local node data pack buffer；Otherwise step S13 is performed；
S13：If the reception for confiscating next node confirms packet, local node just stores always, until to data storage server
Shift all Backup Datas.
3. a kind of full service data backup policy in mobile ad-hoc network as described in claim 1, feature exist
In in the step S2, the acquisition of service backup data specifically includes following steps：
S21：When the business datum backup table length of each node reaches certain limit, just open and business datum backup center
The Backup Data stored in business datum backup table is all sent to business datum backup center node by the communication of node；
S22：The storage chained list that business datum backup center node is safeguarded when initial is sky, when receiving backup data package, is adopted
The backup data package received with multiple index storage algorithm process.
4. a kind of full service data backup policy in mobile ad-hoc network as claimed in claim 3, feature exist
In in the step S22, multiple index storage algorithm specifically includes following steps：
S221：When backup data package reaches business datum backup center node, since the gauge outfit of storage chained list, traversal storage
Chained list, if source address is identical, omparison purpose address；If source address is different, it is directly inserted into storage chained list table tail；
S222：Service identification if destination address is identical, is just compared in omparison purpose address；If destination address is different, it is inserted into and deposits
It stores up before the source address variation node of chained list；
S223：Compare service identification, if service identification is consistent, packet sequence is sequentially inserted into, is deposited if service identification is inconsistent
It stores up before destination address variation node, so far algorithm terminates.
5. a kind of full service data backup policy in mobile ad-hoc network as claimed in claim 4, feature exist
In, in the step S3, the storage chained list after multiple index stores algorithm process is inquired, it is all according to data packet mark taking-up
Service backup data.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201711287683.3A CN108132855B (en) | 2017-12-07 | 2017-12-07 | Method for backing up complete service data in mobile self-organizing network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201711287683.3A CN108132855B (en) | 2017-12-07 | 2017-12-07 | Method for backing up complete service data in mobile self-organizing network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN108132855A true CN108132855A (en) | 2018-06-08 |
| CN108132855B CN108132855B (en) | 2021-08-06 |
Family
ID=62390075
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201711287683.3A Active CN108132855B (en) | 2017-12-07 | 2017-12-07 | Method for backing up complete service data in mobile self-organizing network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108132855B (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110635927A (en) * | 2018-06-21 | 2019-12-31 | 中兴通讯股份有限公司 | Node switching method, network node and network system |
| CN110837439A (en) * | 2019-09-30 | 2020-02-25 | 华为终端有限公司 | File backup method, terminal and communication system |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101707793A (en) * | 2009-11-13 | 2010-05-12 | 华南理工大学 | Flooding control method of on-demand route maintenance of multi-hop wireless self-organizing network |
| CN102236586A (en) * | 2010-04-21 | 2011-11-09 | 雷州 | Local and network multiple incremental data backup and recovery method of computer |
| CN102857536A (en) * | 2011-07-01 | 2013-01-02 | 中兴通讯股份有限公司 | Method and system capable of achieving data back-up and migration in peer-to-peer (P2P) network |
| CN103813364A (en) * | 2013-11-21 | 2014-05-21 | 重庆邮电大学 | Mobile self-organizing network interrupt data recovery method based on area perception |
| CN103856399A (en) * | 2014-03-17 | 2014-06-11 | 山东大学 | Ad Hoc backup route algorithm based on stability |
| US20140337590A1 (en) * | 2013-05-07 | 2014-11-13 | Verizon Patent And Licensing Inc. | Smart digital message archival |
-
2017
- 2017-12-07 CN CN201711287683.3A patent/CN108132855B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101707793A (en) * | 2009-11-13 | 2010-05-12 | 华南理工大学 | Flooding control method of on-demand route maintenance of multi-hop wireless self-organizing network |
| CN102236586A (en) * | 2010-04-21 | 2011-11-09 | 雷州 | Local and network multiple incremental data backup and recovery method of computer |
| CN102857536A (en) * | 2011-07-01 | 2013-01-02 | 中兴通讯股份有限公司 | Method and system capable of achieving data back-up and migration in peer-to-peer (P2P) network |
| US20140337590A1 (en) * | 2013-05-07 | 2014-11-13 | Verizon Patent And Licensing Inc. | Smart digital message archival |
| CN103813364A (en) * | 2013-11-21 | 2014-05-21 | 重庆邮电大学 | Mobile self-organizing network interrupt data recovery method based on area perception |
| CN103856399A (en) * | 2014-03-17 | 2014-06-11 | 山东大学 | Ad Hoc backup route algorithm based on stability |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110635927A (en) * | 2018-06-21 | 2019-12-31 | 中兴通讯股份有限公司 | Node switching method, network node and network system |
| CN110635927B (en) * | 2018-06-21 | 2022-08-19 | 中兴通讯股份有限公司 | Node switching method, network node and network system |
| CN110837439A (en) * | 2019-09-30 | 2020-02-25 | 华为终端有限公司 | File backup method, terminal and communication system |
Also Published As
| Publication number | Publication date |
|---|---|
| CN108132855B (en) | 2021-08-06 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| KR101852136B1 (en) | A computer implemented method for dynamic sharding | |
| CN104932841B (en) | Economizing type data de-duplication method in a kind of cloud storage system | |
| US8868494B2 (en) | Systems and methods for selective data replication | |
| CN103229487B (en) | Partition balancing method, device and server in distributed memory system | |
| KR101706252B1 (en) | Method, server and computer program stored in computer readable medium for synchronizing query result | |
| US20020055972A1 (en) | Dynamic content distribution and data continuity architecture | |
| CN106572153A (en) | Data storage method and device of cluster | |
| CN101911595A (en) | Failure recovery method in non revertive mode of Ethernet ring network | |
| CN108008918A (en) | Data processing method, memory node and distributed memory system | |
| US10142257B2 (en) | Dynamic scaling of redundancy elimination middleboxes | |
| CN103929454A (en) | Load balancing storage method and system in cloud computing platform | |
| CN107018185A (en) | The synchronous method and device of cloud storage system | |
| CN108132855A (en) | A kind of full service data backup policy in mobile ad-hoc network | |
| CN105959231A (en) | Agent port communication flow control method and redundant device | |
| CN107153644A (en) | A kind of method of data synchronization and device | |
| CN104182182B (en) | Intelligent terminal and data backup method thereof | |
| CN107506265A (en) | A kind of backup of otherness telefile and recovery system based on internet | |
| US7685179B2 (en) | Network flow for constrained replica placement | |
| CN102799659A (en) | Overall repeating data deleting system and method based on non-centre distribution system | |
| CN103650462A (en) | Coding, decoding and data repairing method based on homomorphic self-repairing code and storage system thereof | |
| CN113051428B (en) | Method and device for back-up storage at front end of camera | |
| CN105468733B (en) | A kind of volume clone method deleted again based on source data | |
| CN105159790B (en) | A kind of data rescue method and file server | |
| CN108459926A (en) | Data remote backup method, apparatus and computer-readable medium | |
| CN104461779B (en) | A kind of storage method of distributed data, apparatus and system |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |