CN112260952A

CN112260952A - Wifi6 router rapid data access protection method

Info

Publication number: CN112260952A
Application number: CN202011135139.9A
Authority: CN
Inventors: 李俊画; 白云波; 马剑
Original assignee: Sichuan Tianyi Comheart Telecom Co Ltd
Current assignee: Sichuan Tianyi Comheart Telecom Co Ltd
Priority date: 2020-10-20
Filing date: 2020-10-20
Publication date: 2021-01-22

Abstract

The invention discloses a wifi6 router fast data access protection method, which relates to the technical field of router data access and comprises the following steps: s1, the data flow enters a data module; s2, judging whether the data module to be operated in the step S1 is idle, if not, executing the step S3, if so, executing the step S4; s3, according to the priority of each process in the data flow, performing chain queuing, and executing the step S4; s4, processing the data stream, and executing the step S5; s5, outputting the result, the invention can well prevent the situation of data confusion caused by competition due to the simultaneous operation of multiple processes on the same data block in the program, and in addition, the blocking phenomenon of the data due to the processing of the attribution block is well processed due to the modularization of the data block.

Description

Wifi6 router rapid data access protection method

Technical Field

The invention relates to the technical field of router data access, in particular to a wifi6 router rapid data access protection method.

Background

With the development of technology, routers have evolved from the fifth generation to the sixth generation. The number of functions included in the router is increasing, and the shared data is also very frequently processed and used. However, most of the technologies use a single-lock method to protect data, so as to prevent multiple processes from operating on data, which results in confusion when data is used. The method can well ensure data security. However, the data protection of this method results in slow running of part of the program. If the program calls improperly, the program may be deadlock, and the program is troublesome to maintain. And this approach becomes complicated for data sharing and inconvenient for data maintenance.

Disclosure of Invention

The invention aims to overcome the defects of the prior art and provides a wifi6 router fast data access protection method.

The purpose of the invention is realized by the following technical scheme:

a wifi6 router fast data access protection method includes the following steps:

s1, the data flow enters a data module;

s2, judging whether the data module to be operated in the step S1 is idle, if not, executing the step S3, if so, executing the step S4;

s3, according to the priority of each process in the data flow, performing chain queuing, and executing the step S4;

s4, processing the data stream, and executing the step S5;

and S5, outputting the result.

Preferably, the step S3 is to determine that the priority of each process in the data stream includes the following:

and judging whether to perform insertion priority processing according to the priority of the program in the determined process priority. If the queue has a higher priority than the process, the sequence of the operations is arranged behind the queue. When it is judged that the operations in the entire chain are higher than this, the operations are inserted from the end in order. For processes of equal priority, the initial level is assumed to be the lowest priority level for unregistered processes according to who comes first and performs processing actions.

Preferably, for each data flow entering the linked list, there are two initial states, one is a wait state and one is a process state. In order to prevent the data from being processed for too long time, when the processing time is reached, the return value is waited for a certain time, if the processing time is over, the return value returns to a state, and when the processing time is over, the return value returns to a state, so that the program can normally proceed, and the program is prevented from entering a long waiting state.

Preferably, in step S4, the data stream is partitioned into blocks by the required data and functions, and each block of data is marked with a key.

Preferably, the key value has uniqueness and cannot be the same as other key values.

Preferably, for a data block of a key value, the data block is in an idle state when no process performs any operation on the data block, and when a process operates on the data of the block, the data block is converted into a busy state. And the process times out as it begins processing the data, processes the data over time and returns the results. When the data is still occupied within the specified time, the occupied process is released in time, and a state is returned to the process.

The invention has the beneficial effects that:

the data is modularized, and the combination of data chains is utilized to realize the rapid application of the data, so that the operation of reading and writing corresponding data in the existing data protection mechanism can be efficiently solved, and the condition that the data is disordered due to competition caused by simultaneously operating the same data block by multiple processes in a program can be well prevented. In addition, due to the modularization of the data blocks, the congestion phenomenon caused by processing the data belonging to one block is well processed, and the method has the advantages of preventing competition and quickly and efficiently realizing the reading and writing of the data.

Drawings

FIG. 1 is a diagram illustrating a data block and key value mapping according to the present invention;

FIG. 2 is a process read flow diagram of the present invention;

fig. 3 is a flow chart of data flow processing according to the present invention.

Detailed Description

The technical solutions of the present invention are further described in detail below with reference to the accompanying drawings, but the scope of the present invention is not limited to the following.

Therefore, the invention provides a wifi6 router fast data access protection method, which mainly considers that the data are processed in a blocking mode, so that the flexible processing of the data is increased, the situation of mutual competition on data reading and writing of multiple processes is avoided, the data processing speed is increased, and the problem of data abnormity caused by improper data processing is prevented.

As shown in fig. 1, a two-dimensional modeling manner is adopted to modularize data, and block processing is performed on the entire data, where data of each block is usually targeted for a specific function, and it is considered that key value marking is performed on commonly used data blocks, and since the data amount in a router is moderate, only the simplest

key value

1,2,3 is used here. Simple key value distinction is performed.

As shown in fig. 2, when a process reads data, if the process operates on the data out of order, the data may be confused, here, a chain structure is used to ensure that only one member operates on the data each time, and the process processes the data according to the priority level of the process, and the process may wait for the subsequent process to process the data. Here, the chain structure is constructed according to the priority of the process carrying.

As shown in fig. 3, when a data flow enters, it is first determined whether a data module to be operated currently is idle, and when it is detected that the module to be operated does not have any data to be operated, the data module can be directly processed. If the current data is being processed, the action to be operated is queued, the queuing is performed according to the priority of the program to be operated, and whether to perform insertion priority processing is judged according to the priority of the program in the determined process priority. If the queue has a higher priority than the process, the sequence of the operations is arranged behind the queue. When it is judged that the operations in the entire chain are higher than this, the operations are inserted from the end in order. For equal priority processes, the process action is based on who comes first and then goes. For unregistered processes, the initial level is generally assumed to be the lowest priority.

It should be noted that, in order to ensure fast processing of data in a device, especially some core processes cannot postpone the real-time effect of their returned results. The priorities of all processes must be reasonably arranged, and the processes are reasonably arranged according to the priorities of the processes. For each data flow entering the linked list, there are two initial states, one is a wait state and one is a process state. In order to prevent the data from being processed for too long time, when the processing time is reached, the return value is waited for a certain time, if the processing time is over, the return value returns to a state, when the processing time is over, the return value returns to a state, so that the program can normally proceed, and the program is prevented from entering a long waiting state.

The data processing process comprises the following steps:

for the modularized data, there may be many processes to operate on the data of the same block at any time, but in a state of operating the data at the same time, the data is easily confused. The invention adopts the blocking processing for the data processing. The data of each block is marked with a key value, and the key value has uniqueness and can not be the same as other key values, so that data errors in operation caused by the fact that the key values are the same are prevented.

Basic attribute parameter table necessary for data of data block:

name (R)	Properties
		Key value	Unique identification of data block
Time of day	Data processing timeout
		Status of state	Corresponding data block status

For data processing, the above table is the most basic parameter, on which other parameters can be added as appropriate if desired. For a data block of a certain key value, the data block is in an idle state when no process performs any operation on the data block, and when a process operates the data of the block, the data block is required to be converted into a busy state. And the process times out as it begins processing the data, processes the data over time and returns the results. When the data is still occupied within the specified time, the occupied process is released in time, and a state is returned to the process. This operation is to prevent the data from being occupied by one process for a long time and being unable to exit in time, so that other processes are always in a waiting state.

The two main applications of the invention are in the priority of the process to operate on data, and by this, it is determined which processes must be processed with priority and which processes can wait for processing. The other point is that for the same processed data block, when the same processed data block is in a busy state, the processing time is recorded to prevent the data block from being occupied for a long time and being incapable of being released due to the problem of the process, so that time timing is added, and when the time timing is exceeded, the data block returns to an overtime state immediately, so that other processes can process the data in time, and the process which gives the problem is also released in time to perform subsequent other event feedback.

The foregoing is merely a preferred embodiment of the invention, it being understood that the embodiments described are part of the invention, and not all of it. 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 invention. The invention is not intended to be limited to the forms disclosed herein, but is to be accorded the widest scope consistent with the principles and novel features disclosed herein. And that modifications and variations may be effected by those skilled in the art without departing from the spirit and scope of the invention as defined by the appended claims.

Claims

1. A wifi6 router fast data access protection method is characterized by comprising the following steps:

s1, the data flow enters a data module;

s4, processing the data stream, and executing the step S5;

and S5, outputting the result.

2. The wifi6 router fast data access protection method according to claim 1, wherein the determining the priority of each process in the data stream in step S3 includes the following:

in the process priority already fixed, judge whether to insert the priority to process according to the priority of the procedure, if have priority higher than this process in the team, arrange the course order of the operation behind it, when judging the operation in the whole chain is higher than it, insert from the end in order, for the process of the equal priority, according to who comes first and who carries on the processing action, for the process not registered, presume the initial rank is the lowest priority altogether.

3. The wifi6 router fast data access protection method of claim 1, wherein there are two initial states for each data flow entering the linked list, one is a waiting state and the other is a processing state, where in order to prevent the data from being processed too long, when the processing time is reached, the return value is waited for a certain time, if the certain time is exceeded, the return state is returned, when the time is exceeded, the return state is returned, so that the program can proceed normally, preventing the program from entering the long waiting state.

4. The wifi6 router fast data access protection method of claim 1, wherein in step S4, the data stream is partitioned into blocks by the required data and functions, and each block of data is marked with a key.

5. The wifi6 router fast data access protection method according to claim 4, wherein the key value has uniqueness and cannot be the same as other key values.

6. The wifi6 router fast data access protection method of claim 5, wherein for a key-value data block, when no process performs any operation on it, it is idle, when a process operates on the data of this block, it will change its status to busy, and when the process starts to process the data, it will count time, process the data within the time and return the result, when the data is still occupied within the specified time, it will timely release the occupied process and return a status to it.