CN115543585A

CN115543585A - Enterprise number card data synchronization method, server and storage medium

Info

Publication number: CN115543585A
Application number: CN202211495727.2A
Authority: CN
Inventors: 王亮; 林锋; 董芸; 付朝印; 刘广达
Original assignee: Beijing Capitek Co ltd
Current assignee: Beijing Capitek Co ltd
Priority date: 2022-11-28
Filing date: 2022-11-28
Publication date: 2022-12-30
Anticipated expiration: 2042-11-28
Also published as: CN115543585B

Abstract

The application discloses an enterprise number card data synchronization method, a server and a storage medium, which belong to the field of computer data processing and comprise the following steps: step 1: grouping the enterprise number cards according to the enterprise identification numbers, and dividing the number card data in each group of enterprise number cards into a plurality of task fragments; step 2: the task service instance acquires the task fragments needing to be processed by adopting a timing polling mode, and performs step 3 after judging that the processing conditions are met, wherein the data synchronization task of each group is performed in a serial synchronization mode; and step 3: sequentially acquiring the valid period of the number card data in the task fragment, and judging whether synchronization is needed; if the synchronization is not needed, new card number data is continuously acquired; if the synchronization is needed, executing step 4: and calling a plurality of operator core network interfaces to acquire data for carrying out card numbering data synchronization, and continuing to carry out the step 3 after the synchronization task is completed until the card numbering data in the task fragment is completely completed. The method can achieve the effects of parallel processing and load balancing.

Description

Enterprise number card data synchronization method, server and storage medium

Technical Field

The application belongs to the field of mobile network data processing, and particularly relates to an enterprise number card data synchronization method, a server and a storage medium.

Background

In the field of computer data management and data synchronization technology for mobile networks, different data contents determine the way data is stored, managed and synchronized. The traditional data synchronization mode is generally based on a C/S or B/S architecture, a client is deployed to pull data from a server sequentially, and the mode has the advantages of simplicity and convenience, but has the defects of flexibility, high efficiency, stability and the like.

Currently, 5G industry private networks are rapidly developed, enterprise clients also put forward urgent requirements for self-management and self-service for the 5G industry private networks, and the 5G industry private network enterprise client self-management system provides a means for the enterprise clients to visualize, manage and control the 5G industry private networks. In the process of researching and developing a 5G industry private network enterprise customer self-management system, the problem of enterprise number card data synchronization is faced, a client needs to be created, a timing task is started, and data of enterprise number cards of data platforms such as a mobile network operator core network, a group data center, a local data center, an Internet of things platform and the like are collected periodically, but the method encounters many practical problems in the process of docking results, for example, a calling failure occurs in some cases of an interface provided by a core network side, the number of calling times or time interval of the interface on the core network side is limited, the enterprise number card data synchronization is not timely, and meanwhile, the method considers future expansion and highly available use scenes under different scenes, needs to design a method with reliable performance, high stability and high efficiency according to the characteristics of the enterprise number card data in a targeted manner, and effectively solves the practical problem of enterprise number card data synchronization in the mobile network.

Disclosure of Invention

The problems that in the prior art, when enterprise number card data in a mobile network are synchronized, a traditional timing data acquisition mode is executed at one time in a timing mode, a task which is abnormal midway or is limited in access is terminated, data acquisition in the current period fails, data is permanently lost, distributed multi-instance parallel processing and load balancing cannot be supported, high availability cannot be achieved and the like are solved.

The application solves the problems by the following scheme:

according to a first aspect of the present invention, there is provided an enterprise number card data synchronization method, including the steps of:

step 1: grouping the enterprise number cards according to the enterprise identification numbers, dividing the number card data in each group of enterprise number cards into a plurality of task fragments, wherein each task fragment comprises number card data synchronization tasks of a plurality of enterprises;

and 2, step: the task service instance acquires task fragments needing to be processed by adopting a timing polling mode, and performs step 3 after judging that processing conditions are met, wherein the data synchronization task of each group is performed in a serial synchronization mode;

and step 3: sequentially acquiring number card data in the task fragment, checking the validity period of the number card data, and judging whether synchronization is needed;

if the synchronization is not needed, continuing to execute the step 3 again to obtain new card number data;

if the synchronization is needed, executing the step 4;

and 4, step 4: and calling a plurality of operator core network interfaces to acquire data for carrying out card numbering data synchronization, and continuing to carry out the step 3 after the synchronization task is completed until the card numbering data in the task fragment is completely completed.

Preferably, in step 2, the task service instance acquires the task fragment by using a hash consistency algorithm, so as to implement a timed polling manner.

Preferably, the specific method of the hash consistency algorithm is as follows:

forming 2^32 points into a circle clockwise to form a Hash ring;

mapping the task service instance and the task fragment to a hash ring;

starting from the position of the fragment on the hash ring, the first service instance encountered in the clockwise direction is the task service instance that processes the fragment.

Preferably, in step 2, the judgment that the processing condition is satisfied is specifically: and judging whether other task service instances are processed in the current task fragment, and if not, meeting the processing condition.

Preferably, in step 3, if synchronization is needed, first, the last progress of the synchronization task of the current number card data is obtained, if the progress is completed, a new synchronization task is started, and if the last progress is not completed, the last synchronization task is continued.

Preferably, the starting of the new synchronization task is specifically:

first, whether the dependent data has the condition or not is judged,

if the condition is not met, exiting the polling processing;

and if the condition is met, acquiring the dependent data, judging whether the dependent data is updated or not, updating the task data according to the change condition of the dependent data, and then performing the synchronization task.

Preferably, the progress of the number card data synchronization task is stored in the database every time, and if the previous progress is not completed, the progress of the synchronization task is read through the database and is continued.

Preferably, in step 4, if the calling of the plurality of operator core network interfaces fails or is limited, the currently processed synchronous task progress data information needs to be stored, and the current polling processing is exited.

According to a second aspect of the present invention, there is provided a server comprising: a memory and at least one processor;

the memory stores computer programs, and the at least one processor executes the computer programs stored in the memory to implement the enterprise number card data synchronization method in any one of the above technical solutions.

According to a third aspect of the present invention, there is provided a computer-readable storage medium, in which a computer program is stored, and the computer program, when executed, implements the enterprise number card data synchronization method according to any one of the above technical solutions.

Compared with the traditional timing data acquisition mode mentioned in the background art, the timing data acquisition method has the advantages that the timing is executed at one time, the midway abnormal or access limited task is terminated, the data acquisition in the current period fails, the data is permanently lost, the distributed multi-instance parallel processing and load balancing cannot be supported, and the high availability cannot be realized, so the method has the following remarkable advantages and effects:

1. the distributed multi-service instance parallel cooperative processing task is supported by adopting the task fragmentation according to the enterprise, high availability and load balance can be realized, and dynamic expansion and contraction capacity of the service instance is supported.

2. The task segmentation processing can be realized by adopting a timing polling mechanism, the task progress is gradually promoted, and the fault-tolerant capability is strong when the task is abnormal or limited.

3. The task data period can be dynamically adjusted, the service instance does not need to be restarted, and the configuration is supported to be dynamically effective.

Drawings

In order to more clearly illustrate the embodiments or prior art solutions of the present application, the drawings needed for describing the embodiments or prior art will be briefly described below, and it is obvious that the drawings in the following description are only some embodiments described in the present application, and that other drawings can be obtained by those skilled in the art without inventive exercise.

Fig. 1 is a flowchart illustrating an enterprise number card data synchronization method according to an embodiment of the present application;

fig. 2 is a schematic structural diagram of a server according to an embodiment of the present application.

Detailed Description

In order to make the objects, technical solutions and advantages of the present application more apparent, the technical solutions of the present application will be described in detail and completely with reference to the following embodiments and accompanying drawings. It should be apparent that the described embodiments are only a few embodiments of the present application, and not all embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present application.

As shown in fig. 1, in an embodiment of the present application, a method for synchronizing data of an enterprise number card in a mobile network includes the following steps:

s110: grouping the enterprise number cards according to the enterprise identification numbers, dividing the number card data in each group of enterprise number cards into a plurality of task fragments, wherein each task fragment comprises number card data synchronization tasks of a plurality of enterprises;

in this step, a synchronization task is divided into different task fragments, which are completed by different task service instances.

S120: the task service instance acquires the task fragments needing to be processed by adopting a timing polling mode, and S130 is carried out after the task service instance judges that the processing conditions are met, wherein the data synchronization task of each group is carried out in a serial synchronization mode;

in this step, a server in which a task service instance is a distributed running timed task service is called a task service instance, and a plurality of task service instances cooperatively complete the same timed task.

The timing task processes the synchronous task by adopting a polling mode, if the task processing meets interface limitation or other abnormity to cause interruption, the task processing can be continued when polling next time, and the problem of the traditional timing data acquisition mode in the prior art is solved, namely: the method is executed at one time at regular time, the task with abnormal midway or limited access is terminated, the data acquisition in the current period fails, and the data is permanently lost.

The time interval between two polling is called task polling period, and the initial default value of the polling period can be set to 5 minutes and can be adjusted through a configuration file.

In this embodiment, the specific step of determining that the processing condition is satisfied is: and judging whether other task service instances are processed in the current task fragment, and if not, meeting the processing condition.

In an embodiment of the present application, a task service instance obtains task fragments by using a hash consistency algorithm, so as to implement a timing polling manner. The method specifically comprises the following steps:

2^32 points are clockwise combined into a circle to form a hash ring, the point right above the circle represents 0, the first point on the right side of the point 0 represents 1, and the like, 2, 3, 4, 5, 6 ^ 8230 \\ 8230, and the steps are up to 2^32-1, namely the first point on the left side of the point 0 represents 2^32-1;

mapping the task service instance to a hash ring by a formula hash (IP)% 2^32 to determine the position of the task service instance in the hash ring;

mapping the task fragments to a hash ring by a formula hash (task fragment identification)% 2^ 32;

The task fragmentation can enable the task service instances to cooperatively process tasks in parallel, and the task fragmentation is distributed by using a Hash consistency distribution algorithm, so that only a small number of task fragmentation can be influenced when the task service instances dynamically expand and contract the capacity.

S130: sequentially acquiring number card data in the task fragment, and checking the validity period of the number card data; the data acquired by each timing task has different validity periods, and the timing tasks do not need to be newly synchronized if the data are in the validity periods. The time interval of two new synchronizations is called a data synchronization period, and the data synchronization period of the task can be configured through the database.

Then, S131: judging whether synchronization is needed or not, checking the validity period of data, and judging whether the task of the current data period is completed or not;

if the synchronization is not needed, the step S130 is continuously executed again to obtain new card number data;

if the synchronization is required, executing S140;

s140: and calling a plurality of operator core network interfaces to acquire data for card numbering data synchronization, and continuing to perform S130 after the synchronization task is completed until all the card numbering data in the task fragment are completed.

In this step, first, the last progress of the current number card data synchronization task needs to be acquired, if the progress is completed, a new synchronization task is started, and if the last progress is not completed, the last synchronization task is continued, and the synchronization tasks are: and calling a plurality of operator core network interfaces to acquire data to synchronize number card data. And storing the progress of the number card data synchronization task into the database every time, and reading the progress of the synchronization task through the database and continuing if the previous progress is not completed.

In an embodiment of the present application, starting a new synchronization task specifically includes:

first, whether the dependent data has the condition or not is judged,

if the condition is not met, exiting the polling processing;

The dependent data in the step refers to that the input of some tasks can relate to the output of other tasks, so that whether the dependent tasks are finished or not and whether the required data have conditions or not are judged before the tasks are performed, and the expandability of the method is improved.

In this step, if the calling of the core network interfaces of the operators fails or is limited, the currently processed synchronous task progress data information needs to be stored, and the current polling processing is exited.

In an embodiment of the present application, the enterprise list, that is, the enterprise number card data, the validity period of the number card data, the synchronization task progress data, the dependency data, and the number of failure times of the synchronization task, is stored in the database, and during the execution of the above steps, the database is accessed at any time to complete the synchronization task.

Compared with the traditional timing data acquisition mode in the prior art, the method has the advantages that the timing is executed at one time, the midway abnormal or access limited task is terminated, the data acquisition in the current period fails, the data is permanently lost, the distributed multi-instance parallel processing and load balancing cannot be supported, and the high availability cannot be realized, and the method has the remarkable advantages and effects that:

As shown in fig. 2, an embodiment of the present application provides a server, including: a memory 201 and at least one processor 202;

the memory 201 stores a computer program, and the at least one processor 202 executes the computer program stored in the memory 201 to implement the enterprise number card data synchronization method of any one of the above-described methods.

According to a third aspect of the present invention, there is provided a computer-readable storage medium having stored therein a computer program which, when executed, implements the enterprise number card data synchronization method of any one of the above methods.

It should be noted that the above detailed description is exemplary and is intended to provide further explanation of the disclosure. Unless defined otherwise, all technical and scientific terms used herein have the same meaning as commonly understood by one of ordinary skill in the art to which this application belongs.

It is noted that the terminology used herein is for the purpose of describing particular embodiments only and is not intended to be limiting of example embodiments according to the present application. As used herein, the singular is intended to include the plural unless the context clearly dictates otherwise. Furthermore, it will be further understood that the terms "comprises" and/or "comprising," when used in this specification, specify the presence of stated features, steps, operations, devices, components, and/or combinations thereof.

It should be noted that the terms "first," "second," and the like in the description and claims of this application and in the drawings described above are used for distinguishing between similar elements and not necessarily for describing a particular sequential or chronological order. It is to be understood that the terms so used are interchangeable under appropriate circumstances such that the embodiments of the application described herein are capable of operation in other sequences than those illustrated or otherwise described herein.

Furthermore, the terms "comprising" and "having," as well as any variations thereof, are intended to cover non-exclusive inclusions. For example, a process, method, system, article, or apparatus that comprises a list of steps or elements is not necessarily limited to those steps or elements explicitly listed, but may include other steps or elements not explicitly listed or inherent to such process, method, article, or apparatus.

For ease of description, spatially relative terms such as "over 8230 \ 8230;,"' over 8230;, \8230; upper surface "," above ", etc. may be used herein to describe the spatial relationship of one device or feature to another device or feature as shown in the figures. It will be understood that the spatially relative terms are intended to encompass different orientations of the device in use or operation in addition to the orientation depicted in the figures. For example, if a device in the figures is turned over, devices described as "above" or "on" other devices or configurations would then be oriented "below" or "under" the other devices or configurations. Thus, the exemplary terms "at 8230; \8230; 'above" may include both orientations "at 8230; \8230;' above 8230; 'at 8230;' below 8230;" above ". The device may also be oriented in other different ways, such as by rotating it 90 degrees or at other orientations, and the spatially relative descriptors used herein interpreted accordingly.

In the foregoing detailed description, reference is made to the accompanying drawings, which form a part hereof. In the drawings, like numerals typically identify like components, unless context dictates otherwise. The illustrated embodiments described in the detailed description, drawings, and claims are not meant to be limiting. Other embodiments may be utilized, and other changes may be made, without departing from the spirit or scope of the subject matter presented here.

The present invention has been described in terms of the preferred embodiment, and it is not intended to be limited to the embodiment. Any modification, equivalent replacement, or improvement made within the spirit and principle of the present invention should be included in the protection scope of the present invention.

Claims

1. An enterprise number card data synchronization method is characterized by comprising the following steps:

if the synchronization is not needed, continuously executing the step 3 again to obtain new card number data;

if the synchronization is needed, executing the step 4;

and 4, step 4: and calling a plurality of operator core network interfaces to acquire data for number card data synchronization, and continuing to perform the step 3 after the synchronization task is completed until the number card data in the task fragment is completely completed.

2. The enterprise number card data synchronization method according to claim 1, wherein in step 2, the task service instance uses a hash consistency algorithm to obtain the task fragments, thereby implementing a timed polling manner.

3. The enterprise number card data synchronization method according to claim 2, wherein the hash consistency algorithm is specifically implemented by:

forming 2^32 points into a circle clockwise to form a Hash ring;

mapping the task service instance and the task fragment to a hash ring;

4. The method for synchronizing the data of the enterprise number card according to claim 1, wherein in the step 2, the judging that the processing condition is satisfied is specifically: and judging whether other task service instances are processed in the current task fragment, and if not, meeting the processing condition.

5. The enterprise number card data synchronization method according to claim 1, wherein in step 3, if synchronization is needed, the last progress of the current number card data synchronization task is obtained first, if the progress is completed, a new synchronization task is started, and if the last progress is not completed, the last synchronization task is continued.

6. The enterprise number card data synchronization method according to claim 5, wherein the starting of the new synchronization task is specifically:

first, whether the dependent data has the condition or not is judged,

if the condition is not met, exiting the polling processing;

7. The enterprise number card data synchronization method of claim 5, wherein the progress of the number card data synchronization task is stored in the database each time, and if the previous progress is not completed, the progress of the synchronization task is read through the database and is continued.

8. The enterprise number card data synchronization method of claim 1, wherein in step 4, if the calling of the plurality of operator core network interfaces fails or is limited, the currently processed synchronization task progress data information needs to be saved, and the current polling process is exited.

9. A server, comprising: a memory and at least one processor;

the memory stores a computer program, and the at least one processor executes the computer program stored by the memory to implement the enterprise number card data synchronization method of any one of claims 1 to 8.

10. A computer-readable storage medium, wherein a computer program is stored in the computer-readable storage medium, and when the computer program is executed, the method for synchronizing the enterprise number card data according to any one of claims 1 to 8 is implemented.