CN108132855B

CN108132855B - Method for backing up complete service data in mobile self-organizing network

Info

Publication number: CN108132855B
Application number: CN201711287683.3A
Authority: CN
Inventors: 陶洋; 章思青; 代建建; 梅思梦; 杨飞跃; 邓行; 李朋; 谢金辉; 许湘扬
Original assignee: Chongqing University of Post and Telecommunications
Current assignee: Chongqing University of Post and Telecommunications
Priority date: 2017-12-07
Filing date: 2017-12-07
Publication date: 2021-08-06
Anticipated expiration: 2037-12-07
Also published as: CN108132855A

Abstract

The invention relates to a method for backing up complete service data in a mobile self-organizing network, which mainly comprises the following steps: 1) service data are stored in a scattered mode, 2) service backup data are collected, and 3) service backup data are obtained. The strategy is that a mobile self-organizing network is provided with a service data backup center with high-performance large-capacity data storage and data packet receiving and sending functions; the strategy has the function of backup breakpoint continuous transmission, and when the network is blocked, the backup can be interrupted; when the network returns to normal, the backup can be automatically restarted and continued from the interrupt; a multi-level index storage algorithm is adopted. The strategy realizes the recovery of the small-particle data, minimizes the influence on a system, greatly improves the recovery speed, and simultaneously improves the backup success rate and the storage efficiency of backup data.

Description

Method for backing up complete service data in mobile self-organizing network

Technical Field

The invention belongs to the technical field of storage, and relates to a method for backing up complete service data in a mobile ad hoc network.

Background

In the current information age, data and information gradually become the business foundation and economic life line of every business. It is particularly important to obtain a complete backup of service data and data resilience to service data loss during the transmission of service data.

With the rapid development of computer technology, more and more enterprises now use computer systems to handle daily business. It is believed that many information management system centers of enterprises have experienced that data information created by long-time and hard-going is suddenly destroyed once due to disasters such as unpredictable system downtime, hard disk damage or virus invasion. The best solution to prevent these disasters is to make data backup in advance, which is an important work in system management and an important guarantee for dealing with catastrophic failures. A good data backup scheme can enable a user to recover a damaged system and serve the system to the outside at the fastest speed in the shortest time when the user suffers from data loss caused by system crash, hacking and the like, and various data losses possibly brought about are reduced to the maximum extent.

To prevent data failure, there are various approaches, such as: the method has the advantages of strengthening safety measures of business departments, improving the level of operators, purchasing software and hardware equipment with excellent quality and the like, but the most fundamental method is to establish a perfect backup system.

The backup measures adopted at present generally comprise disk mirror images, disk arrays, dual-computer fault tolerance and the like, but the measures belong to hardware-level backup, and from the logic point of view, only one part of data is actually provided, so the measures cannot do nothing to system damage and data logic damage, and if data has errors, the errors can be copied to all places quickly. These backup measures are more often referred to as fault tolerance measures and are two levels of system protection with system backup.

In fact, the ideal backup system is all-around and multi-level. Firstly, hardware backup is used for preventing hardware faults and ensuring uninterrupted operation of services; secondly, more important is that the data of the computer system is fully protected by using a software backup method. If the logic damage of the data is caused by software failure or manual misoperation, the system is restored by using a method combining a software mode and a manual mode, and the combination mode forms multi-stage protection on the system, so that not only can the physical damage be effectively prevented, but also the logic damage can be thoroughly prevented.

The strategy of backup is determined according to the needs of the user, and depends on the amount of data to be backed up by the user, how long the backup data is to be preserved, when the backup can be performed, the backup time that can be tolerated, etc. Therefore, how to design a complete business data backup strategy becomes the focus of current research.

Disclosure of Invention

In view of the above, an object of the present invention is to provide a method for backing up complete service data in a mobile ad hoc network, the method providing a service data backup center for the mobile ad hoc network, the service data backup center being a high-performance and high-capacity data storage and having a function of transceiving data packets; the backup mechanism is simple and practical, can well improve the backup success rate, has the function of backup breakpoint continuous transmission, and can also interrupt backup when a network is blocked; once the network is recovered to be normal, the backup can be automatically restarted and continued from the interrupt; the multi-level index storage algorithm is adopted, so that the storage efficiency of the backup data is improved; with the fine indexing of backup data, when a user wishes to restore data, the entire system does not need to be restored in most cases, and only part of the data needs to be restored. The multi-level index is beneficial to quickly searching and positioning the data to be recovered when the data is recovered, the small-particle data recovery is realized, meanwhile, the influence on the system is reduced to the minimum, and the recovery speed is greatly improved.

In order to achieve the purpose, the invention provides the following technical scheme:

a backup method for service data in a mobile ad hoc network specifically comprises the following steps:

step 1): service data are stored in a scattered mode;

step 2): acquiring service backup data;

step 3): acquiring service backup data;

further, in step 1), the service data distributed storage specifically includes the following steps:

step 1-1): in the transmission process of the service data, each data packet received by the backup node is stored in a local cache and then is sent to the next node;

step 12): when the local node detects that the receiving confirmation packet from the next node is received within a certain time, determining that the next node receives the data packet, and then clearing the data packet cache of the local node; otherwise, executing step 13);

step 13): if the receiving confirmation packet of the next node is not received, the local node stores the data until all backup data are transferred to the data storage server.

Further, in step 2), the service backup data acquisition specifically includes the following steps:

step 21): when the length of the service data backup table of each node reaches a certain limit, communication with a service data backup central node is started, and all backup data stored in the service data backup table are sent to the service data backup central node;

step 22): and when the backup data packet is received, processing the received backup data packet by adopting a multilevel index storage algorithm.

Further, in the step 22), the multi-level index storage algorithm specifically includes the following steps:

step 221): when the backup data packet reaches the service data backup central node, traversing the storage linked list from the head of the storage linked list, and if the source addresses are the same, comparing the destination addresses; if the source addresses are different, directly inserting the source addresses into the tail of the storage linked list;

step 222): comparing the destination addresses, and if the destination addresses are the same, comparing the service identifiers; if the destination addresses are different, inserting the destination addresses in front of the source address change nodes of the storage linked list;

step 223): and comparing the service identifications, inserting the packet sequence in sequence if the service identifications are consistent, and storing the packet sequence in front of the destination address change node if the service identifications are inconsistent, so that the algorithm is ended.

Further, in step 3), the storage linked list processed by the multi-level index storage algorithm is queried, and all service backup data are taken out according to the data packet identifier.

The invention has the beneficial effects that: the backup strategy can well improve the backup success rate and the backup data storage efficiency; the fine backup data index can meet the requirement of only restoring partial data; the multi-level index is beneficial to quickly searching and positioning the data to be recovered when the data is recovered, the small-particle data recovery is realized, meanwhile, the influence on the system is reduced to the minimum, and the recovery speed is greatly improved.

Drawings

In order to make the object, technical scheme and beneficial effect of the invention more clear, the invention provides the following drawings for explanation:

FIG. 1 is a diagram of a backup node receiving data;

FIG. 2 is a diagram of a backup node receiving a data acknowledgement packet;

FIG. 3 is a diagram illustrating failure of a backup node to receive a data acknowledgement packet;

FIG. 4 is a flow chart of a multi-level index storage algorithm;

fig. 5 is a flow chart of packet processing.

Detailed Description

Preferred embodiments of the present invention will be described in detail below with reference to the accompanying drawings.

The invention provides a backup strategy of complete service data in a mobile self-organizing network, wherein a service data backup center is arranged for the mobile self-organizing network, is a high-performance and large-capacity data memory and has the functions of receiving and transmitting data packets; the backup mechanism is simple and practical, can well improve the backup success rate, has the function of backup breakpoint continuous transmission, and can also interrupt backup when a network is blocked; once the network is recovered to be normal, the backup can be automatically restarted and continued from the interrupt; the multi-level index storage algorithm is adopted, so that the storage efficiency of the backup data is improved; with the fine indexing of backup data, when a user wishes to restore data, the entire system does not need to be restored in most cases, and only part of the data needs to be restored. The multi-level index is beneficial to quickly searching and positioning the data to be recovered when the data is recovered, the small-particle data recovery is realized, meanwhile, the influence on the system is reduced to the minimum, and the recovery speed is greatly improved. To better implement the backup strategy, the IP packet format will be modified. The modified IP packet format is shown in table 1:

table 1 modified IP packet format

Step 1-1): as shown in fig. 1, in the transmission process of service data, each data packet received by a backup node is stored in a local cache and then sent to a next node;

the specific description is as follows: the backup node S receives the backup data packet Pk1 from other nodes, and the format of the data packet is shown in table 2, and the data packet is stored in the local cache and then sent to the next node B.

Table 2 packet format

Original address	Destination address	Service identification	Packet sequence	Service data
					S	D	F	N	Data

Step 1-2): as shown in fig. 2, when the node detects that the next node receives the receiving acknowledgement packet within a certain time, it can confirm that the next node has received the data packet, and then clear the cache of the data packet at the local node; otherwise, executing the step 1-3);

the specific description is as follows:

when the backup node D receives the data packet Pk1 of the backup node S, it replies a confirmation packet Pdr to the node S, where the format of the confirmation packet is shown in table 3, and after receiving the confirmation packet Pdr, the node clears the local cache Pk1 of the data packet.

Table 3 acknowledgement packet format

Original address	Destination address	Service identification	Packet sequence	Data reception acknowledgement packet identification
					S	D	F	N	T

Step 1-3) as shown in fig. 3, if the acceptance confirmation packet of the next node is not received, storing until all backup data are transferred to the data storage server;

the specific description is as follows:

when the backup node D receives the data packet Pk1 of the backup node S, a confirmation packet Pdr is replied to the node S, the S cannot receive the confirmation packet due to the interruption of the link between the BC, and the backup node D keeps a local cache Pk1 until all backup data are transferred to the data storage server;

further, the processing flow of the node receiving data packet is shown in fig. 5.

Step 2-1) when the length of the service data backup table of each node reaches a certain limit, starting communication with a service data backup central node, and sending all backup data stored in the service data backup table to the service data backup central node;

step 2-2) the Storage chain table maintained by the service data backup central node at the initial time is empty, and when the data is received, a multi-Level Index Storage Algorithm (Muti-Level Index Storage Algorithm, MLISA) is adopted;

further algorithm execution is described below:

step 2-3) when the backup data packet arrives, traversing the storage linked list from the head of the storage linked list, and comparing the destination addresses if the source addresses are the same; if the source addresses are different, the source addresses are directly inserted into the tail of the table;

step 2-4) comparing destination addresses, and if the destination addresses are the same, comparing the service identifications; if the destination addresses are different, inserting the destination addresses in front of the source address change node;

step 2-5) comparing the service identifications, if the service identifications are consistent, inserting the packet sequence in sequence, if the service identifications are inconsistent, storing the service identifications in front of the destination address change node, and ending the algorithm;

the specific description is as follows:

when the backup node receives the data packets (P1, P2, P3, P4, P5, P6, and the content of the data packets is shown in table 4) in sequence, the storage linked list is empty initially, and then the data packets are stored by adopting a multi-level index storage algorithm, wherein the detailed algorithm flow is shown in fig. 4, and the change process of the storage linked list is shown in table 5;

table 4 packet contents

TABLE 5 store changes in Linked lists

Step 3-1) inquiring the storage linked list, recovering backup data, and taking out all service backup data according to the data packet marks; the packet identifier is a shaping variable (1 indicates a service data packet, 2 indicates a Hello packet, and 3 indicates a data reception acknowledgement packet);

the specific algorithm process is as follows:

step 3-2) traversing the storage linked list, filtering all packets with packet identifiers of 1, and recording as original data packets, otherwise, failing to recover data;

step 3-3) traversing the original data packet, filtering out a packet with a service identifier x, recording as a service packet, and failing to recover data;

step 3-4) traversing all service packets, arranging data packets in a descending order according to a packet sequence, and then sequentially recovering data;

and completing the backup execution of the complete service data.

Finally, it is noted that the above-mentioned preferred embodiments illustrate rather than limit the invention, and that, although the invention has been described in detail with reference to the above-mentioned preferred embodiments, it will be understood by those skilled in the art that various changes in form and detail may be made therein without departing from the scope of the invention as defined by the appended claims.

Claims

1. A method for backing up complete service data in a mobile ad hoc network is characterized in that: the method is that a mobile self-organizing network is provided with a service data backup center which is a high-performance and large-capacity data memory and has the function of receiving and sending data packets; the method has the function of backup breakpoint continuous transmission, and when the network is blocked, the backup can be interrupted; when the network returns to normal, the backup can be automatically restarted and continued from the interrupt; a multi-Level Index Storage Algorithm (Muti-Level Index Storage Algorithm, MLISA) is adopted;

the method specifically comprises the following steps:

s1: service data are stored in a scattered mode;

s2: acquiring service backup data;

s3: acquiring service backup data;

the multi-level index storage algorithm specifically comprises the following steps:

s221: when the backup data packet reaches the service data backup central node, traversing the storage linked list from the head of the storage linked list, and if the source addresses are the same, comparing the destination addresses; if the source addresses are different, directly inserting the source addresses into the tail of the storage linked list;

s222: comparing the destination addresses, and if the destination addresses are the same, comparing the service identifiers; if the destination addresses are different, inserting the destination addresses in front of the source address change nodes of the storage linked list;

s223: and comparing the service identifications, inserting the packet sequence in sequence if the service identifications are consistent, and storing the packet sequence in front of the destination address change node if the service identifications are inconsistent, so that the algorithm is ended.

2. The method for backing up complete service data in a mobile ad hoc network according to claim 1, wherein in the step S1, the service data distributed storage specifically includes the following steps:

s11: in the transmission process of the service data, each data packet received by the backup node is stored in a local cache and then is sent to the next node;

s12: when the local node detects that the receiving confirmation packet from the next node is received within a certain time, determining that the next node receives the data packet, and then clearing the data packet cache of the local node; otherwise, executing step S13;

s13: if the receiving confirmation packet of the next node is not received, the local node stores the data until all backup data are transferred to the data storage server.

3. The method for backing up complete service data in a mobile ad hoc network as claimed in claim 1, wherein in the step S2, the service backup data collection specifically comprises the steps of:

s21: when the length of the service data backup table of each node reaches a certain limit, communication with a service data backup central node is started, and all backup data stored in the service data backup table are sent to the service data backup central node;

s22: and when the backup data packet is received, processing the received backup data packet by adopting a multilevel index storage algorithm.

4. The method as claimed in claim 3, wherein in step S3, the storage chain table processed by the multi-level index storage algorithm is queried, and all service backup data are retrieved according to the packet identifier.