Detailed Description
The following description of the embodiments of the present invention will be made clearly and fully with reference to the accompanying drawings, in which it is evident that the embodiments described are some, but not all embodiments of the invention. All other embodiments, which can be made by those skilled in the art based on the embodiments of the invention without making any inventive effort, are intended to be within the scope of the invention.
It should be understood that the terms "comprises" and "comprising," when used in this specification and the appended claims, specify the presence of stated features, integers, steps, operations, elements, and/or components, but do not preclude the presence or addition of one or more other features, integers, steps, operations, elements, components, and/or groups thereof.
It is also to be understood that the terminology used in the description of the invention herein is for the purpose of describing particular embodiments only and is not intended to be limiting of the invention. As used in this specification and the appended claims, the singular forms "a," "an," and "the" are intended to include the plural forms as well, unless the context clearly indicates otherwise.
It should be further understood that the term "and/or" as used in the present specification and the appended claims refers to any and all possible combinations of one or more of the associated listed items, and includes such combinations.
As used in this specification and the appended claims, the term "if" may be interpreted as "when..once" or "in response to a determination" or "in response to detection" depending on the context. Similarly, the phrase "if a determination" or "if a [ described condition or event ] is detected" may be interpreted in the context of meaning "upon determination" or "in response to determination" or "upon detection of a [ described condition or event ]" or "in response to detection of a [ described condition or event ]".
Referring to fig. 1, fig. 1 is a schematic diagram of a Token-based access authentication system according to an embodiment of the present invention. The Token-based access verification system comprises a client, a server and a plurality of distributed nodes, wherein the server comprises an authentication center module and a health management module. It should be noted that in this embodiment, the client communicates with the server to receive the authentication information sent by the authentication center module, the client communicates with the distributed node to submit the user information to the distributed node, and the distributed node communicates with the server to send the user information and the node identifier to the authentication center module. In this embodiment, the authentication center module newly added on the server authenticates the user information, and then generates the authentication Token dynamically in real time according to the request content and the authentication information in the client, and verifies the authentication Token through the distributed nodes, so that the resource access performed when the authentication Token is leaked and stolen is avoided, the security of access verification is improved, and the problem that the server is maliciously accessed is solved.
Fig. 2 is a schematic flow chart of a Token-based access verification method according to an embodiment of the present invention. The Token-based access verification method of the embodiment of the invention can be applied to a Token-based access verification system, for example, the Token-based access verification method can be realized through a software program configured on the Token-based access verification system, so as to improve the security of access verification. As shown in fig. 2, the method includes the following steps S100 to S140.
And S100, the authentication center module distributes node identification IDs and generates keys to the registered distributed nodes and sends a key mapping table containing the node identification IDs and the keys to each distributed node.
In the embodiment of the invention, the server is started to initialize, the authentication center module performs automatic service registration on a plurality of distributed nodes, accesses the plurality of distributed nodes to the health check management module, distributes unique node identification ID for each distributed node, generates a secret key S1 i for all the distributed nodes, and sends a secret key mapping table containing the node identification ID and the secret key S1 i to each distributed node after each secret key S1 i is unique. Specifically, for example, assuming that the total number of distributed nodes is N, the node identification ID allocated to each distributed node is denoted as a i, the key map is denoted as Table, and each node a i and the corresponding S1 i are recorded in the key map Table. It should be noted that, in this embodiment, for the third party system platform single sign-on, an API interface is provided for performing subsequent updating of the key S1 i. It should be further noted that, in this embodiment, after each distributed node receives a Table, it needs to return receipt success information to the authentication center module, for example, the receipt success information is ok, and each distributed node stores the Table.
The server further comprises a health management module, wherein if a preset updating time T is reached, the authentication center module re-issues the secret key to obtain an updated secret key S i and sends updated messages to all the distributed nodes, the authentication center module updates the secret key mapping table according to the updated secret key to obtain an updated secret key mapping table Tablenew, the health management module inquires the health degree of all the distributed nodes and determines a target distributed node according to whether the health degree is in an available state, specifically, if the health degree is in an available state, the distributed node is determined to be the target distributed node, otherwise, if the health degree is in an unavailable state, the distributed node is shielded from updating the secret key mapping table and is not used as the target distributed node, the authentication center module sends the updated secret key mapping table to any distributed node in the target distributed nodes, and if the preset distributed node is not subjected to the retry time, the authentication center module returns information indicating that the preset distributed node is not in the preset retry time, the health degree is not successfully sent to the distributed nodes, and the health management module can be successfully sent the distributed nodes for a plurality of times. It should be noted that, in this embodiment, the reconnection of the preset retry number is required to check whether the distributed node encounters a fault or a network problem, and the preset retry number is understandably set according to the actual requirement. It should be noted that, in this embodiment, only when the health of the distributed node is set to be in the available state, the key mapping table of the distributed node may be updated, and the preset update time T may be defined by the user, but may not be less than twice the preset allowable expiration time T1 by T1 x 2, and the default value is 30 minutes.
Further, after the step of sending the updated key mapping table to the target distributed node, the authentication center module further includes deleting a second key mapping table by the distributed node, and using the updated key mapping table and the first key mapping table as the first key mapping table and the second key mapping table, respectively, where an initial value of the first key mapping table is the key mapping table, and an initial value of the second key mapping table is null. It is understood that the first key mapping table is Tablenew, and the second key mapping table is Tableold, that is, each distributed node a i holds two key mapping tables Tableold and Tablenew.
And S110, if any distributed node receives the user information submitted by the client, the user information and the node identification ID are sent to an authentication center module.
In the embodiment of the invention, the user information comprises a user name and a password, the client submits the user name and the password to any distributed node A i, any distributed node A i redirects the request to a unified authentication center module, a unique node identification ID of the distributed node A i is attached to the authentication center module, and the user information and the node identification ID are sent to the authentication center module.
And S120, the authentication center module checks the user information, and if the user information passes the check, authentication information is generated according to the node identification ID and the key mapping table, and the authentication information is sent to the client.
In the embodiment of the present invention, as shown in fig. 3, the step S120 may include steps S121 to S122, where the authentication center module checks the user name and the password according to a preset user information table, and if the user name and the password pass the check, generates a user ID, and queries the key from the key mapping table through the node identification ID, and S122, the authentication center module generates an access key according to the node identification ID, the key, and the user ID through a preset encryption algorithm, and sends the access key, the node identification ID, and the user ID to the client as the authentication information. It should be noted that, the preset encryption algorithm is a SHA256 encryption algorithm. The authentication center module checks the user name and the password, if any information in the user name and the password is wrong, error prompt information is returned to the client so that the client resubmits, if the user name and the password are verified, the access verification system login is successful, and the authentication center module generates a unique user IDuserId for the user. Meanwhile, after the corresponding S1 i is found in the key mapping Table through the A i information, the authentication center module performs SHA256 irreversible encryption calculation on the A i、S1i and the userid to obtain an access key S2 i as shown in a formula (1).
S2i=SHA256(Ai,S1i,userid) (1)
Finally, the authentication center module sends A i、S2i and userid to the client for the client to automatically generate an authentication Token in the subsequent request. Understandably, the client would save a i、S2i, userid.
S130, the client generates an authentication Token according to the request content and the authentication information, and sends the authentication Token and the request content to any distributed node.
In the embodiment of the present invention, the client may further obtain a current Timestamp before sending the request content to any one of the distributed nodes. As shown in fig. 4, the step S130 may include steps S131 to S132, where the client generates a target access key according to a current time stamp, the request content, a random encryption parameter, the access key, and the user ID through the preset encryption algorithm, and S132, the client generates the authentication Token according to the target access key, the user ID, the current time stamp, the random encryption parameter, and the node ID. Specifically, after the client logs in successfully, the client needs to generate a target access key S3 T when requesting each time, and the calculation of the target access key S3 T is specifically shown in formula (2), wherein in formula (2), C is the requested content, and R is a random encryption parameter.
S3T=SHA256(C,S2i,Timestamp,userid,R) (2)
Finally, after the target access key S3 T is generated, there are two main ways to generate the authentication Token according to a i、R、Timestamp、userid、S3T, in the first way, a i, R, timestamp, userid and S3 T are spliced and combined to generate the authentication Token (not encrypted), specifically as shown in formula (3). In the second mode, after A i, R, timestamp, userid and S3 T are spliced and then encrypted by a reversible encryption algorithm such as symmetric or asymmetric encryption, token (encryption) is obtained
Token=Ai+R+Timestamp+userid+S3T (3)
It should be noted that, according to the actual security requirement, the components a i, R, timestamp, userid and S3 T may be spliced and then selected to be unencrypted or encrypted. The purpose of using asymmetric encryption or symmetric encryption is to enable the server to reversely decrypt Token to restore the a i、R、Timestamp、userid、S3T parameter. In this embodiment, the client needs to send the authentication Token when sending the request content.
And S140, if the distributed node verifies that the authentication Token is legal, the request content is processed.
In the embodiment of the present invention, as shown in fig. 5, step S140 specifically includes the following steps S141 to S148:
S141, processing the authentication Token by the distributed node to obtain the target access key, the user ID, the current timestamp, the random encryption parameter and the node identification ID, S142, acquiring a first key from the first key mapping table by the distributed node through the node identification ID, S143, calculating the first verification key by the distributed node through a preset encryption algorithm according to the first key, the node identification ID and the user ID, generating a first target verification key according to the first verification key, the current timestamp, the request content, the random encryption parameter and the user ID, S144, comparing the first target verification key with the target access key by the distributed node, S145, judging that the authentication Token is processed by the distributed node according to the first key, the node identification ID and the user ID within a preset expiration time range when the current timestamp of the previous transmission request is within a preset expiration time range, S146, calculating the second verification key from the second key, and the second verification key according to the second verification key, and the second verification key is obtained by the distributed node ID, and the second verification key is obtained by the distributed node, if the second target verification key is the same as the target access key and the difference value between the current time stamp and the current time stamp of the last transmitted request is within a preset allowable expiration time range, the authentication Token is judged to be legal, the request content is processed, and the access key is retransmitted to the client.
Specifically, after the distributed node receives the request content and the authentication Token, the distributed node first disassembles the a i、R、Timestamp、userid、S3T parameter from the authentication Token. If the authentication Token is an encrypted version, decryption is performed using a pre-defined symmetric or asymmetric encryption algorithm. After decryption, the node refers to the key table Tablenew by the value a i to obtain the corresponding first key S1 i. The node then calculates a first verification key S2 i using a i、S1i, userid by SHA256 encryption algorithm.
S2i=SHA256(Ai,S1i,userid)
Next, the distributed node calculates a first target verification key S3 T according to the request content C, S2 i, timestamp, R, userid by SHA256 encryption algorithm.
S3T=SHA256(C,S2i,Timestamp,userid,R)
It is appreciated that at this point, the distributed nodes share a total of two S3 T. One is S3 T disassembled from the user Token, and the other is S3 T calculated by the node by disassembling the parameters of the authentication Token. then, the distributed node compares the values of the two S3 T, if the values of the two S3 T are the same and the difference T1 (also called the allowed expiration time) between the current Timestamp and the current Timestamp of the last transmitted request is within the preset allowed expiration time range T2, the authentication Token is determined to be legal, which indicates that the request authentication is successful, and the distributed node starts to process the request content. If either of a i, userid, C, timestamp, R is tampered with, the resulting S3 T will be illegal. T1 defaults to 15 minutes (which can be modified by itself according to different scenarios). Meanwhile, S1 i is updated periodically by the authentication center. Thus if the two S3 T values are not identical but T1 is within T2, then the distributed node a i believes that it is possible that the S1 i value has been updated or that the requested content C has been tampered with, resulting in illegal authentication. At this time, the distributed node verifies whether the key value S1 i is updated and the value S3 T is different, finds the second key (old S1 i) from the old key table Tableold, recalculates the old S3 i (second verification key), and calculates the old S3 T (second target verification key) from the second verification key. If the old S3 T is the same as the user' S S3 T, the request is valid as it is, i.e. the Token is validated, and the validation failure caused by the update of the S1 i value is considered to be a problem. Meanwhile, the client is redirected to the authentication center module, and the updated S2 i is directly issued to the client. if the old S3 T is different from the S3 T of the user, the request content is tampered, the request is illegal, and the user is required to log in again. If the two S3 T values are the same but the operating time T1 exceeds the allowed expiration time T2, the user is considered to be not operating for a long time and the user is required to log in again, and it is understood that if the two S3 T values are different and the operating time T1 exceeds the allowed expiration time T2, the user is considered to be required to log in again.
For ease of understanding, the Token-based access authentication method will now be described by way of the following specific examples:
s1, starting a server;
S2, assuming that 3 distributed nodes are all used, the authentication center module performs service registration and discovery on each registered distributed node, and endows each distributed node with unique node identification ID, for example, the node identification ID of a distributed node A is a, the node identification ID of a distributed node B is B, and the node identification ID of a distributed node C is C;
And S3, the authentication center module generates a key mapping Table for the first time, and each node corresponds to a key value S1. As shown in table 1, a has a key S1A, B, S1B, and C has a key S1C;
TABLE 1
| Node identification ID |
Key(s) |
| a |
S1A |
| b |
S1B |
| c |
S1C |
After generating the key mapping Table, the authentication center module sends the key mapping Table to all the distributed nodes, and the distributed nodes return a successful message after receiving the key mapping Table, so that the distributed nodes can formally start to provide services to the outside;
S4, the client logs in and inputs a correct user name and a correct password;
And S5, after the distributed node A receives the user name and the password for the first time, redirecting the information to the authentication center module. After the authentication center module verifies that the account and the password are successful, a user IDuserid, for example, 01, is generated for the client, meanwhile, a key of the distributed node A is obtained by inquiring a key mapping Table, namely S1A, an access key S2A is calculated through a formula (1), and a, 01 and S2A are sent to the client for storage, and the access key S2A is a character string;
S6, the client makes a request, such as sending a Json request, accessing a page, and the like. When submitting the request content, the client needs to generate a current time stamp, and the random number R generates a real-time authentication Token. Assuming that the request content is C, calculating a target access key S3 T by a formula (2), and then generating an authentication Token according to a formula (3), wherein symmetric encryption or asymmetric encryption can be added on the basis of the formula (3) to generate the authentication Token, and according to actual requirements, after the client calculates the authentication Token, the request content C and the authentication Token are sent together to be submitted to a server, and the load balance of the server can submit the request to any distributed node for processing, such as a distributed node B;
S7, when the distributed node B receives the transmitted request content with userid of 01 and the authentication Token, authentication Token verification is performed. Firstly, the authentication Token is disassembled according to a preset mode (a user can disassemble by adding a separator or a preset character bit) so as to disassemble a node identification ID, a random number R, timestamp, userid and an S3T from the authentication Token;
S8, the distributed node B inquires a key mapping Table, and the key value S1A of a is inquired through the node identification ID. Then, S2A is calculated by a formula (1), S3T is calculated by a formula (2), the calculated S3T is compared with S3T after the authentication Token is disassembled, and the difference between the current request time Timestamp and the last request time Timestamp is not more than 15 minutes (default time), the request is considered legal, the authentication Token is authenticated legal, and the request content C is processed;
Assuming that 30 minutes (default key mapping Table update time) have elapsed during the use process, the authentication center module updates and transmits a new key Table (new), as shown in Table 2, that is, table (new) is the first key mapping Table;
TABLE 2
| Node identification ID |
Key value |
| a |
s1a |
| b |
s1b |
| c |
s1c |
The previous key Table is changed to the old key Table (old), as shown in Table 3, that is, table (old) is the second key map Table.
TABLE 3 Table 3
| Node identification ID |
Key value |
| a |
S1A |
| b |
S1B |
| c |
S1C |
At this time, if the S2A value of the client is not updated, and the distributed node authentication Token is judged according to the key value of the Table (new), it is not legal. At this time, the distributed node can take the value from the Table (old) to verify again, so that the legal verification can be verified.
It should be noted that in this embodiment, support for distributed multi-node is added on the basis of JWT (Json web Token) verification mechanism, so that skip authentication between different platforms can be supported, the problem that other personnel can bypass the verification access system to perform illegal access to the server after the authentication Token is leaked can be solved, the security of access verification is improved, the problem that keys of all users are expired and need to be logged in again after the key table is updated is avoided, the security is enhanced, the risk that key parameters are leaked is reduced, and the access verification system has strong expansibility and decoupling property, and distributed nodes can be newly added.
Fig. 6 is a schematic block diagram of a Token-based access authentication system 200 provided in an embodiment of the present invention. As shown in fig. 6, the Token-based access authentication system 200 includes means for performing the Token-based access authentication method described above, corresponding to the Token-based access authentication method applied to the client, the server, and the plurality of distributed nodes above. Specifically, referring to fig. 6, the Token-based access verification system 200 includes a transmitting unit 101 and a verification unit 102 configured in an authentication center module of a server, a receiving and transmitting unit 201 and a verification processing unit 202 configured in all distributed nodes, and a generating unit 301 configured in a client.
The sending unit 101 is configured to distribute a node identifier ID and generate a key to a plurality of registered distributed nodes by using the authentication center module, and send a key mapping table including the node identifier ID and the key to each of the distributed nodes, the receiving and sending unit 201 is configured to send the user information and the node identifier ID to the authentication center module if any of the distributed nodes receives user information submitted by the client, the verification unit 102 is configured to verify the user information by using the authentication center module, and if the verification passes, generate authentication information according to the node identifier ID and the key mapping table, and send the authentication information to the client, the generating unit 301 is configured to generate an authentication Token by using the client according to request content and the authentication information, and send the authentication Token and the request content to any of the distributed nodes, and the verification processing unit 202 processes the request content if the user verifies that the authentication Token is legal by using the distributed nodes.
In some embodiments, for example, the verification unit 102 includes a verification generation unit and a first generation subunit.
The verification generating unit is used for verifying the user name and the password according to a preset user information table by the authentication center module, generating a user ID if the user name and the password pass the verification, and inquiring the key from the key mapping table through the node identification ID; the first generation subunit is configured to generate an access key by using the authentication center module according to the node identifier ID, the key, and the user ID through a preset encryption algorithm, and send the access key, the node identifier ID, and the user ID to the client as the authentication information.
In some embodiments, for example, the generating unit 301 includes a second generating subunit and a third generating subunit.
The second generation subunit is configured to generate a target access key according to a current timestamp, the request content, a random encryption parameter, the access key and the user ID by using the preset encryption algorithm, and the third generation subunit is configured to generate the authentication Token according to the target access key, the user ID, the current timestamp, the random encryption parameter and the node identifier ID by using the client.
In some embodiments, for example, in this embodiment, the Token-based access verification system 200 further includes an issue unit, an update unit, a sending subunit, a setting unit, and a query unit in the health management module, which are configured in the authentication center module of the server, and a deletion update unit configured in the distributed node.
The method comprises the steps that when a preset updating time is reached, an issuing unit is used for issuing the secret key again by an authentication center module to obtain updated secret keys and sending updated messages to all distributed nodes, the updating unit is used for enabling the authentication center module to update the secret key mapping table according to the updated secret keys to obtain an updated secret key mapping table, a query unit is used for enabling the health management module to query the health of all the distributed nodes and determining a target distributed node according to whether the health is available, a sending subunit is used for enabling the authentication center module to send the updated secret key mapping table to the target distributed node, the setting unit is used for setting the health of the distributed nodes to be unavailable and forwarding the distributed nodes to the health management module for management if the preset message information replied by the distributed nodes is not received within preset retry times, and the deleting unit is used for deleting the first secret key mapping table and the second secret key mapping table, and the first secret key mapping table and the second secret key mapping table are used as initial values.
In some embodiments, for example, in this embodiment, the verification processing unit 202 includes a processing unit, a first acquisition unit, a first calculation generation unit, a comparison unit, a processing unit, a second acquisition unit, a second calculation generation unit, and a processing transmission unit.
The processing unit is configured to process the authentication Token by using the distributed node to obtain the target access key, the user ID, the current timestamp, the random encryption parameter, and the node identifier ID; the first obtaining unit is used for obtaining a first key from the first key mapping table through the node identification ID by the distributed node, the first calculation generating unit is used for obtaining a first check key through calculation of the distributed node according to the first key, the node identification ID and the user ID through a preset encryption algorithm and generating a first target check key according to the first check key, the current timestamp, request content, random encryption parameters and the user ID, the comparing unit is used for comparing the first target check key with the target access key through the distributed node, the processing unit is used for judging that the authentication Token is legal if the first target check key is identical to the target access key and the difference value between the current timestamp and the current timestamp of the last transmitted request is within a preset allowable expiration time range, the second obtaining unit is used for obtaining a second key from the distributed node according to the second check key through calculation according to the second verification unit and the second verification ID and the preset expiration time table, the second obtaining unit is used for obtaining the second key from the distributed node according to the second verification key, the processing and transmitting unit is used for processing the request content and retransmitting the access key to the client if the second target check key is the same as the target access key and the difference between the current time stamp and the current time stamp of the last request for transmission is within a preset allowable expiration time range and the authentication Token is judged to be legal.
It should be noted that, as will be clearly understood by those skilled in the art, the specific implementation process of the Token-based access authentication system 200 and each unit may refer to the corresponding description in the foregoing method embodiments, and for convenience and brevity of description, the description is omitted here.
The Token-based access verification system described above may be implemented in the form of a computer program that is executable on a computer device as shown in fig. 7.
Referring to fig. 7, fig. 7 is a schematic block diagram of a computer device according to an embodiment of the present application. The computer device 900 is a device built with a Token-based access authentication system.
With reference to fig. 7, the computer device 900 includes a processor 902, a memory and an interface 907 connected by a system bus 901, wherein the memory may include a storage medium 903 and an internal memory 904.
The storage medium 903 may store an operating system 9031 and a computer program 9032. The computer program 9032, when executed, may cause the processor 902 to perform a Token-based access authentication method.
The processor 902 is operable to provide computing and control capabilities to support the operation of the overall computer device 900.
The internal memory 904 provides an environment for the execution of a computer program 9032 in a storage medium 903, which computer program 9032, when executed by the processor 902, causes the processor 902 to perform a Token-based access authentication method.
The interface 905 is used to communicate with other devices. It will be appreciated by those skilled in the art that the architecture shown in fig. 7 is merely a block diagram of some of the architecture relevant to the present inventive arrangements and is not limiting of the computer device 900 to which the present inventive arrangements may be implemented, and that a particular computer device 900 may include more or less components than those shown, or may combine some components, or have a different arrangement of components.
Wherein the processor 902 of each of the client, server, and plurality of distributed nodes is configured to execute the computer program 9032 stored in the memory to implement any of the embodiments of Token-based access authentication methods described above.
It should be appreciated that in an embodiment of the application, the Processor 902 may be a central processing unit (Central Processing Unit, CPU), the Processor 902 may also be other general purpose processors, digital signal processors (DIGITAL SIGNAL processors, DSPs), application Specific Integrated Circuits (ASICs), off-the-shelf Programmable gate arrays (Field-Programmable GATE ARRAY, FPGA) or other Programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, etc. Wherein the general purpose processor may be a microprocessor or the processor may be any conventional processor or the like.
Those skilled in the art will appreciate that all or part of the flow in a method embodying the above described embodiments may be accomplished by computer programs instructing the relevant hardware. The computer program may be stored in a storage medium that is a computer readable storage medium. The computer program is executed by at least one processor in the wireless communication system to implement the flow steps of the embodiments of the method described above.
Accordingly, the present invention also provides a storage medium. The storage medium may be a computer readable storage medium. The storage medium stores a computer program. The computer program, when executed by a processor, causes the processor to perform any of the embodiments of the Token-based access authentication method described above.
The storage medium may be a U-disk, a removable hard disk, a Read-Only Memory (ROM), a magnetic disk, or an optical disk, or other various computer-readable storage media that can store program codes.
Those of ordinary skill in the art will appreciate that the various illustrative elements and algorithm steps described in connection with the embodiments disclosed herein may be implemented as electronic hardware, wireless communication software, or combinations of both, and that the various illustrative elements and steps have been described above generally in terms of functionality in order to clearly illustrate the interchangeability of hardware and software. Whether such functionality is implemented as hardware or software depends upon the particular application and design constraints imposed on the solution. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present invention.
In the several embodiments provided by the present invention, it should be understood that the disclosed systems and methods may be implemented in other ways. For example, the system embodiments described above are merely illustrative. For example, the division of each unit is only one logic function division, and there may be another division manner in actual implementation. For example, multiple units or components may be combined or may be integrated into another system, or some features may be omitted, or not performed.
The steps in the method of the embodiment of the invention can be sequentially adjusted, combined and deleted according to actual needs. The units in the system of the embodiment of the invention can be combined, divided and deleted according to actual needs. In addition, each functional unit in the embodiments of the present invention may be integrated in one processing unit, or each unit may exist alone physically, or two or more units may be integrated in one unit.
The integrated unit may be stored in a storage medium if implemented in the form of a software functional unit and sold or used as a stand-alone product. Based on such understanding, the technical solution of the present invention is essentially or a part contributing to the prior art, or all or part of the technical solution may be embodied in the form of a software product stored in a storage medium, comprising several instructions for causing a computer device (which may be a personal wireless communication, a terminal, or a network device, etc.) to perform all or part of the steps of the method according to the embodiments of the present invention.
In the foregoing embodiments, the descriptions of the embodiments are focused on, and for those portions of one embodiment that are not described in detail, reference may be made to the related descriptions of other embodiments.
It will be apparent to those skilled in the art that various modifications and variations can be made to the present invention without departing from the spirit or scope of the invention. Thus, it is intended that the present invention also include such modifications and alterations insofar as they come within the scope of the appended claims or the equivalents thereof.
While the invention has been described with reference to certain preferred embodiments, it will be understood by those skilled in the art that various changes and substitutions of equivalents may be made and equivalents will be apparent to those skilled in the art without departing from the scope of the invention. Therefore, the protection scope of the invention is subject to the protection scope of the claims.