CN102624736B - TL1 (transaction language 1) command verification method and TL1 command verification device - Google Patents
TL1 (transaction language 1) command verification method and TL1 command verification device Download PDFInfo
- Publication number
- CN102624736B CN102624736B CN201210074991.9A CN201210074991A CN102624736B CN 102624736 B CN102624736 B CN 102624736B CN 201210074991 A CN201210074991 A CN 201210074991A CN 102624736 B CN102624736 B CN 102624736B
- Authority
- CN
- China
- Prior art keywords
- operator
- field
- binary tree
- parameter
- order
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Abstract
The invention discloses a TL1 (transaction language 1) command verification method, comprising the following steps of: after receiving a TL1 command, determining the corresponding TL1 command format according to a COMMAND CODE field of the TL1 command; obtaining a regular expression of an association tag GTAG field in the TL1 command format, and binary trees corresponding to each field, except for the GTAG field, in the TL1 command format; using the binary trees corresponding to each field, except for the GTAG field, verifying the content of corresponding fields in the TL1 command; using the GTAG regular expression to verify the content of the GTAG field in the TL1 command; and determining that the TL1 command is valid after determining that the verification result is valid, and executing the TL1 command. The binary tree structure used in the method can well express the parameter operation relation specified by the TL1 command format, so that the TL1 command can be verified accurately and quickly.
Description
Technical field
The present invention relates to TL1 (Transaction Language 1, Traditional affair language) technical field, relate in particular to a kind of TL1 command checksum method and device.
Background technology
TL1 is a kind of man-machine language of ASCII text formatting, and the grammer of agreement is followed in TL1 order, has the command format of specification, and this makes developer and operator can both easily understand TL1 order.
In the network management model based on TL1, between upper layer device and lower floor's equipment, transmit TL1 order by TL1 northbound interface, the TL1 proxy module of TL1 northbound interface is specifically designed to verification and explains TL1 order.In the time that upper layer device issues TL1 order to lower floor's equipment, the TL1 northbound interface of lower floor's equipment receives this TL1 order, and by TL1 proxy module wherein, it is carried out to verification, if judge after verification that this TL1 order is legal, TL1 proxy module becomes this TL1 command interpretation the assignment instructions that system can carry out and issues, so that related network elements equipment is carried out corresponding task, after tasks carrying is complete, the response message that TL1 proxy module can meet execution result packing generation TL1 communication protocol reports upper layer device, if the TL1 order that after verification, judgement is received is illegal, the error message that generation is met TL1 communication protocol by TL1 proxy module reports upper layer device, there is mistake in the TL1 order of informing input.Visible, in the network management model based on TL1, the checking procedure of TL1 order is extremely important.
At present in the network management model of TL1, conventionally in advance for the upper layer device and the lower floor's equipment that link together configure multiple TL1 command formats for verification TL1 order, TL1 command format comprises six major parts: command code COMMAND CODE, object identifier TID, access identifier AID, connective marker CTAG, generic block GENERAL BLOCK, parameter block DATA BLOCK, between this six part, separate with colon ": ", and with branch "; " finish, concrete form is: COMMAND CODE:TID:AID:CTAG:GENERAL BLOCK:DATA BLOCK;
Each TL1 command format has specified the form that a set of TL1 order should be followed, and TL1 order also comprises above-mentioned six major parts; Wherein, command code COMMAND CODE is for indicating concrete TL1 command type, for example, in the time that the COMMAND of TL1 order CODE content is ACT, represent that this TL1 order is for ACT (activation) order, and in the time that the COMMAND of TL1 command format CODE content is ACT, this TL1 command format is for the TL1 order of identification verification ACT (activation) type; Object identifier TID is for indicating the network element of carrying out TL1 order, and the TID value of for example TL1 order can be No. ID of object network element device, and the TID value of TL1 order has specified which the legal TID value of corresponding TL1 order is; Access identifier AID is for indicating concrete equipment veneer name or the signal name of carrying out TL1 order; Connective marker CTAG is for associating TL1 order and relative response message, and according to the telecommunication administration agreement of standard, CTAG content must be digital, but actual Zhong Ge manufacturer can be numeral or character according to self carrying out self-defined CTAG content; Generic block GENERAL BLOCK is used to specify the execution option of TL1 order, activates etc. as postponed; Part after generic block GENERAL BLOCK is parameter block DATA BLOCK, for representing the concrete execution parameter of TL1 order, wherein may comprise zero or multi-parameter piece more, between these parameter blocks, is separated by colon ": ".
In above-mentioned six parts, the COMMAND CODE content of the COMMAND CODE content of the TL1 command format TL1 order corresponding with it is consistent, TID, the AID of TL1 command format, CTAG, GENERAL BLOCK, DATA BLOCK content separate provision the form that should follow of TID, AID, CTAG, GENERAL BLOCK, the DATA BLOCK content of corresponding TL1 order, specified the operation relation between various parameters and parameter that TL1 order should have.Wherein, in TL1 command format, use the operator in table 1 to specify the operation relation between the each parameter of TL1 order:
Table 1
| ， | | | [ | ( | ] | ) |
| Comma | Infix operator | Left bracket | Left round bracket | Right bracket | Right round bracket |
Wherein, comma, " represent that order has end or not, after a parameter also; Infix operator " | " is for separating the parameter of both sides, and the wherein parameter of a side can only appear in expression; Left bracket " [" and right bracket "] " forms bracket jointly to " [] ", represents one group of optional parameter of encapsulation, parameter wherein or all occur, or all do not occur; Left round bracket " (" and right round bracket ") " jointly forms round bracket " () " is represented to have encapsulated one group of essential operator or parameter.
Above-mentioned operator only appears in TL1 command format, but do not appear in TL1 order, for example, TL1 command format MELT:::CTAG:m, n, z:a|b; Specified the form that the TL1 order of MELT type should be followed, this TL1 command format is for verification MELT order, and, this TL1 command format has specified that the TID content of MELT order and AID content do not have parameter, regulation CTAG content is numeral, and the parameter of regulation GENERALBLOCK content should be m, n, z, the parameter of regulation DATABLOCK content should be a or b, and for example, the MELT order that this command format is corresponding can be MELT:::01:m, n, z:a; .
The a string character string itself being formed by parameter due to TL1 order, wherein do not comprise the operation relation between each parameter, it is just quite inconvenient when the TL1 command format verification that comprises concrete operation relation in use does not comprise the TL1 order of operation relation, for this reason, lower floor's equipment has been formulated again a corresponding regular expression for each TL1 command format, and this regular expression is a kind ofly can realize easily the formula that TL1 order is carried out to verification.At present, when lower floor's equipment receives TL1 order, the normal TL1 command checksum method adopting is: according to the COMMAND CODE content of the TL1 order of described reception, determine corresponding TL1 command format, and further determine corresponding regular expression, recycle this regular expression it is carried out to verification, if verification succeeds, illustrate that the TL1 order that upper layer device issues is legal, otherwise, illustrate that the TL1 order that upper layer device issues is illegal.
Although it is more convenient to adopt regular expression to carry out verification to TL1 order, but but there is the following shortcoming: in the time of the parameter operation relation more complicated of TL1 command format defined, formulate quite difficulty of corresponding regular expression, and the regular expression of making can not better must be expressed complex calculations relation between parameter; Regular expression has strict requirement to the order of parameter, this just requires upper layer device in the time issuing TL1 order, and parameter order wherein must meet the order of regular expression defined, otherwise, check results will be illegal, in fact, TL1 command format for example, to the not restriction of parameter order in TL1 order,, upper layer device is in the time issuing TL1 order, two orders are considered to the same command below: MELT:::00:m, n, z:a; And MELT:::00:z, n, m:a; .As can be seen here, the existing method of utilizing regular expression verification TL1 order can not be expressed the complex calculation relation between parameter preferably, and has limited to a great extent the flexibility of upper layer device input TL1 order.
Summary of the invention
The invention provides a kind of TL1 command checksum method and device, in order to solve in prior art the simple complex calculation relation that adopts regular expression to specify according to TL1 command format preferably, TL1 order is carried out to verification, and affect upper layer device and can not input flexibly the problem of TL1 command parameter.
The inventive method comprises:
A kind of TL1 command checksum method, comprising:
After the TL1 order that received communication opposite end sends, determine corresponding TL1 command format according to the command code COMMAND CODE field of described TL1 order;
Obtain the regular expression of connective marker CTAG field in described TL1 command format, and in described TL1 command format except CTAG field binary tree corresponding to each field, wherein, described except CTAG field binary tree corresponding to each field in advance according to evaluation of expression method, this field contents is carried out to the binary tree structure that computing obtains;
Use described except CTAG field binary tree corresponding to each field, the content of respective field in described TL1 order is carried out to verification;
Use described CTAG regular expression, the content of CTAG field in described TL1 order is carried out to verification;
When the check results of determining each field in described TL1 order is legal, determine that described TL1 order is legal;
In the time that definite described TL1 order is legal, carry out described TL1 order.
A kind of TL1 command checksum device, comprising:
Form determination module, after the TL1 order sending, determines corresponding TL1 command format according to the command code COMMAND CODE field of described TL1 order for received communication opposite end;
Binary tree acquisition module, for obtaining the regular expression of described TL1 command format connective marker CTAG field, and in described TL1 command format except CTAG field binary tree corresponding to each field, wherein, described except CTAG field binary tree corresponding to each field in advance according to evaluation of expression method, this field contents is carried out to the binary tree structure that computing obtains;
Binary tree correction verification module, for use described except CTAG field binary tree corresponding to each field, the content of respective field in described TL1 order is carried out to verification;
Expression formula correction verification module, for using described CTAG regular expression, carries out verification to the content of CTAG field in described TL1 order;
Result determination module, when determining that the check results of each field of described TL1 order is legal, determines that described TL1 order is legal;
Command execution module, in the time that definite described TL1 order is legal, carries out described TL1 order.
A kind of TL1 command checksum method provided by the invention and device, based on evaluation of expression method, respectively the each field except CTAG field in TL1 command format is carried out to computing and obtain corresponding binary tree, then utilize respectively binary tree corresponding to described each field except CTAG field to carry out verification to the respective field in the TL1 order receiving, because the binary tree structure that the present invention adopts can be expressed the parameter operation relation that TL1 command format specifies preferably, therefore can be accurately, promptly TL1 order is carried out to verification.
Brief description of the drawings
Fig. 1 is a kind of TL1 command checksum method flow diagram provided by the invention;
A kind of binary tree structure schematic diagram that Fig. 2 provides for the embodiment of the present invention;
The schematic diagram of the binary tree checking parameter shown in a kind of Fig. 2 of utilization that Fig. 3 provides for the embodiment of the present invention;
One the first binary tree structure schematic diagram that Fig. 4 provides for the embodiment of the present invention;
In binary tree structure shown in a kind of Fig. 4 of deletion that Fig. 5 provides for the embodiment of the present invention, all nodal values are left bracket " node of [" and the schematic diagram of child node thereof;
One the second binary tree structure schematic diagram that Fig. 6 provides for the embodiment of the present invention;
The structural representation of a kind of TL1 command checksum device that Fig. 7 provides for the embodiment of the present invention.
Embodiment
Below in conjunction with the drawings and specific embodiments, the embodiment of a kind of TL1 command checksum of the present invention method is described in further detail.
It is pointed out that the various operators that relate in the inventive method are just for expressing the symbol of certain operations relation, those skilled in the art can, according to the needs of self, in the situation that expression identical operation is related to, adopt other symbols to replace completely.
The invention provides a kind of TL1 command checksum method, as shown in Figure 1, the method comprises:
Step 101, after the TL1 order that received communication opposite end sends, determines corresponding TL1 command format according to the command code COMMAND CODE field of described TL1 order;
Step 102, obtain the regular expression of connective marker CTAG field in described TL1 command format, and in described TL1 command format except CTAG field binary tree corresponding to each field, wherein, described except CTAG field binary tree corresponding to each field in advance according to evaluation of expression method, this field contents is carried out to the binary tree structure that computing obtains;
Step 103, use described except CTAG field binary tree corresponding to each field, the content of respective field in described TL1 order is carried out to verification;
Step 104, is used described CTAG regular expression, and the content of CTAG field in described TL1 order is carried out to verification;
Step 105, when the check results of determining each field in described TL1 order is legal, determines that described TL1 order is legal;
Step 106, in the time that definite described TL1 order is legal, carries out described TL1 order.
In the inventive method, described each field except CTAG field is respectively: command code COMMAND CODE field, object identifier TID field, access identifier AID field, generic block GENERAL BLOCK field, parameter block DATA BLOCK field.
A kind of TL1 command checksum method provided by the invention, based on evaluation of expression method, respectively the each field except CTAG field in TL1 command format is carried out to computing and obtain corresponding binary tree, then utilize respectively binary tree corresponding to described each field except CTAG field to carry out verification to the respective field in the TL1 order receiving, because the binary tree structure that the present invention adopts can be expressed the parameter operation relation that TL1 command format specifies preferably, therefore can be accurately, promptly TL1 order is carried out to verification.
Preferably, the inventive method also comprises: in the time that definite described TL1 order is illegal, return to failure response message to described Correspondent Node.
Preferably, described except CTAG field binary tree corresponding to each field specifically generate in the following way: for described each field, create respectively an operator stack and a data base, and operator stack and data base described in initialization; According to the each element of described each field order from left to right, be handled as follows: determine when currentElement is parameter, described parameter is pressed in described data base; Determine when currentElement is operator, according to predetermined operator precedence relation, judge that the priority of described operator, whether higher than the stack top element of described operator stack, is if so, pressed into described operator in described operator stack, as stack top element; Otherwise, make in described data base successively from stack top two elements of popping, go out stack element and form binary tree by described operator and described two, described operator is that the father node, described two of this binary tree goes out two child nodes that stack element is described binary tree, and this binary tree is pressed in described data base as stack top element; Until handle last element of this field, the stack top element of described data base is defined as to binary tree corresponding to this field.
Concrete, adopt before method of calibration provided by the invention carries out verification to TL1 order, need in advance according to evaluation of expression method, COMMAND CODE field to TL1 command format, TID field, AID field, GENERAL BLOCK field, DATA BLOCK field are carried out computing, obtain corresponding TID binary tree, AID binary tree, GENERAL BLOCK binary tree, DATA BLOCK binary tree.Wherein, described evaluation of expression method is a kind of important application of stack in data structure, and taking TID binary tree as example, the detailed process of utilizing the method to try to achieve TID binary tree structure is:
Step a1, creates an operator stack and a data base, and described operator stack, data base are carried out to initialization, is pressed into pound sign " # " operator in the stack top of described two stacks;
Step a2, determines the TID field of described TL1 command format, according to order from left to right, each element of described TID field is carried out to following operation: if the element of current TID field is parameter, this parameter is pressed in described data base, if operator, according to the operator precedence relation in described table 2, whether the priority that judges described operator is higher than the stack top element (initial stack top element is pound sign " # ") of described operator stack, if, this operator is pressed into described operator stack, otherwise make two elements of popping successively in described data base, and make described two to go out stack element and carry out computing according to described operator, this calculating process is actual is to make two child nodes of described two parameters of popping as this operator, composition node structure, and then this node structure is pressed into data base top,
Table 2
Note: x is the stack top element of operator stack, and y is current operator of reading in, and when x/y correspondence " > ", represents priority relationship x > y, and the rest may be inferred; If x > is y, the operator precedence of x is higher than y; If x < is y, the priority of x is lower than y; If x $ is y, x and y can not be adjacent.
Step a3, until all elements of described TID content is all finished according to above-mentioned steps a2, now, the stack top element of described data base is final TID binary tree.
In addition, in the time adopting said method to generate binary tree corresponding to each field, if find the stack top element of current operator of reading in and described operator stack have can not be adjacent relation, illustrate that current TL1 command format is illegal, can not generate corresponding binary tree according to this TL1 command format, need to report to the police and point out that current TL1 command format is illegal situation.
Preferably, generate described except CTAG field before binary tree corresponding to each field, also comprise: determine in described field and include operator pair, and described operator is when including the first operator before first parameter in the content of encapsulation, described the first operator is moved to described operator to before, wherein, described operator forms the first operator by for encapsulating one group of optional parameters and tail operator, and described the first operator is the operator that represents to still have other parameters below.
Preferably, described operator is to being made up of the left bracket of first operator " [" and the right bracket of tail operator "] ", and described the first operator is comma, ".
Concrete, in standard telecommunication administration agreement, specify, in TL1 command format, bracket should have comma to before the first parameter in " [] "; " but in the time the each several part content of TL1 command format being carried out to computing according to evaluation of expression method, if in the each several part content of TL1 command format, bracket is to there being comma before the first parameter in " [] "; " time, should be first by described comma, " move to described bracket to " [] " before; carry out again computing, otherwise can not obtain binary tree structure.For example,, if the DATA BLOCK content of TL1 command format is a| (b[, c, d]) [, h] [, i, j], when it being carried out computing and tries to achieve DATA BLOCK binary tree according to evaluation of expression method, should be first by bracket to the comma before first parameter in " [] ", move to described bracket to " [] " before, be revised as a| (b, [c, d]), [h], [i, j], and then carry out computing.
It is to be noted, according to evaluation of expression method, the respective field of TL1 command format is carried out to computing, to obtain the definite binary tree of structure, and in the inventive method, before carrying out computing according to evaluation of expression method, need to first carry out bracket the comma before first parameter in " [] ", " move to described bracket to " [] " special processing before, this is mainly because the bracket that has specified TL1 command format in standard telecommunication administration agreement should have comma to before first parameter in " [] ", ", but it is not that the inventive method is necessary that those skilled in the art should have reason to be sure of this step, for example, in actual enforcement, each producer can implement according to the regulation of standard telecommunication administration agreement, also can be according to the needs of oneself, in the time of configuration TL1 command format, at bracket, first parameter in " [] " is not arranged to comma before, ", and be arranged on bracket to " [] " before, like this in the time adopting method provided by the invention, just can not carry out the special processing of symbol and directly carry out computing according to evaluation of expression method.
Preferably, in above-mentioned steps 103, use described except CTAG field binary tree corresponding to each field, the content of respective field in described TL1 order is carried out to verification, specifically comprise:
Resolve described TL1 order, obtain all parameters of respective field in described TL1 order, carry out following checking procedure for each parameter: in the binary tree of described correspondence, search the node that nodal value is parameter current, determine while finding, from the binary tree of described correspondence, delete the node at parameter current place, simultaneously, from the father node of parameter current place node, search successively father node, and in the time determining that the nodal value of the current father node finding is the right first operator of operator, the nodal value of current parent's node is revised as to the first operator, in the time that the nodal value of determining the current father node finding is the second operator, the not child node in accessed path of current parent's node is deleted, until find the root node of the binary tree of described correspondence, wherein said operator forms the first operator by for encapsulating one group of optional parameters and tail operator, described the first operator is the operator that represents to still have other parameters below, described the second operator is the operator that can only have a side parameter to occur in the parameter of its both sides of expression, all execute after above checking procedure for described all parameters, obtain the first binary tree, deleting all nodal values in described the first binary tree is node and the child node thereof of the first operator that described operator is right, obtains the second binary tree, whether the nodal value that judges all nodes in described the second binary tree is all operator, determine that in the binary tree of described correspondence, can find nodal value is the node of described each parameter, and when the nodal value of all nodes is all operator in described the second binary tree, the respective field of determining described TL1 order is legal.
Preferably, described operator is to being made up of the left bracket of first operator " [" and the right bracket of tail operator "] ", and described the first operator is comma, ", described the second operator is infix operator " | ".
As an example of TID field example, above checking procedure is explained below.
In the present invention, TID binary tree is according to evaluation of expression method, TID field to TL1 command format is carried out the binary tree structure that computing obtains, it has expressed the operation relation between parameter and each parameter of TL1 command format to TID field in TL1 order well, wherein, the each node (nodal value is operator) that comprises operator in described TID binary tree has represented the operation relation between described each parameter, and described in comprise operator each child node of node represented each parameter with described operation relation, therefore, use described TID binary tree to carry out verification to the TID field of described TL1 order, can obtain the check results of the operation relation that meets described TL1 command format defined, and, because the relation between each node in described TID binary tree is a kind of data relation, sequencing is not had to particular/special requirement, therefore in the time of verification, the order of each parameter in TL1 order is not also limited.
Concrete, use described TID binary tree to carry out respectively verification to the each parameter in described all parameters, for any one parameter wherein, its checking procedure can be summarised as the following process that chops at a tree:
In described TID binary tree, search the node that nodal value is parameter current, if find, illustrate that parameter current can be identified, the node at parameter current place is deleted (being equivalent to the process of chopping at a tree) from described TID binary tree, simultaneously, from the father node of parameter current place node, search successively father node, in this process, if find, the nodal value of the current father node finding is left bracket " [", the nodal value of current parent's node is revised as to comma, ", this is because bracket is optional relation to all parameters in " [] ", be that bracket is to all parameters in " [] " or all occur, do not occur, in the time that parameter current is identified, just should all occur with himself or with the node that its ancestor node has an optional relation, therefore, should by the nodal value of current parent's node, by left bracket, " [" changes comma into, ", in addition, if find, the nodal value of the current father node finding is infix operator " | ", the not child node in accessed path of current parent's node is deleted to (being equivalent to the process of chopping at a tree), this is because the parameter of infix operator " | " both sides has mutex relation, in the time that parameter current is identified, just should not there is not again the knot removal at the parameter place that namely these should should not be occurred with himself or with the parameter that its ancestor node has a mutex relation, above-mentionedly search the process of father node until find the root node of TID binary tree.It is pointed out that in above-mentioned process of each parameter being carried out to verification, the present invention does not limit the verification order of described each parameter, i.e. which parameter of first verification no matter, as long as all parameters finally can complete verification.
Concrete, because the checking procedure of carrying out for each parameter above is all equivalent to the process that once chops at a tree, therefore after all executing above checking procedure for described all parameters, the structure of described TID binary tree is likely changed because chopping at a tree, and note TID binary tree is now a TID binary tree.
Concrete, after utilizing described TID binary tree all parameters of TID field carry out verification in to TL1 order, if also having nodal value in the TID binary tree obtaining is the left bracket " node of [", because the child node of this category node has optional relation, can occur, also can not occur, and all occur, do not occur, now, in a described TID binary tree, be that left bracket " delete by the node of [" and child node thereof by these nodal values, all occur or all do not occur can be regarded as legal parameter ignorance by these, obtain the 2nd TID binary tree.
Concrete, travel through described the 2nd TID binary tree, whether the nodal value that judges all nodes in described the 2nd TID binary tree is all operator, in this step, if the nodal value of all nodes is all operator in described the 2nd TID binary tree, illustrate that TID field in described TL1 order has comprised all parameters that must occur of TL1 command format defined, and these parameters that must occur are all identified, the node that comprises these parameters is deleted in the process of chopping at a tree, the TID field that is to say described TL1 order is not missed each parameter that the TID fields specify of described TL1 command format must occur, do not leak and select parameter.
Concrete, if can find nodal value to be the node of described each parameter in described TID binary tree time, all parameters that TID field in described TL1 order is described have all been identified by described TID binary tree, there is not nonrecognition parameter, on this basis, if also determine, the nodal value of all nodes in described the 2nd TID binary tree is all operator, all parameters that must occur that TL1 command format defined is described are all identified, do not exist yet and Lou select parameter, therefore the TID field that, can determine described TL1 order is legal.
Preferably, said method also comprises: for described each parameter, determine the node that to search less than nodal value be parameter current in the binary tree of described correspondence time, parameter current is defined as to nonrecognition parameter; Determine while existing nodal value to be the node of inverse symbol in described the second binary tree, described inverse symbol is defined as Lou selecting parameter; Determine when described TL1 order is illegal, return to described leakage to described Correspondent Node and select parameter and/or nonrecognition parameter.
Below be still explained as an example of TID field example.
Concrete, for each parameter of TID field in described TL1 order, when determine the node that to search less than nodal value be parameter current in described TID binary tree time, illustrate that parameter current can not be identified by described TID binary tree, be not specify this parameter in the TID field of TL1 command format, therefore, parameter current can be defined as to nonrecognition parameter, save as one of illegal reason of TID field of described TL1 order, and in the time that final definite described TL1 order is illegal, described nonrecognition parameter is returned to Correspondent Node.
Further, in the time existing nodal value to be the node of inverse symbol in definite described the 2nd TID binary tree, illustrate that in described TL1 order, TID field does not all comprise each parameter that in described TL1 command format, TID fields specify must occur, in other words, in described TL1 order, TID field has been missed some parameter that in described TL1 command format, TID content provided must occur, therefore, parameter current can be defined as Lou selecting parameter, save as one of illegal reason of TID field of described TL1 order, and in the time that final definite described TL1 order is illegal, select parameter to return to Correspondent Node described leakage.
In concrete enforcement, adopt COMMAND CODE field, AID field, GENERAL BLOCK field, binary tree corresponding to DATA BLOCK field in TL1 command format, the method that COMMAND CODE field to TL1 order, AID field, GENERAL BLOCK field, DATA BLOCK field are carried out verification, the method of the TID field of described TL1 order being carried out to verification with above-mentioned use TID binary tree is consistent, does not repeat them here.
Preferably, in above-mentioned steps 101, determine corresponding TL1 command format according to the COMMAND CODE field of described TL1 order, specifically comprise: determine the TL1 command format with described TL1 order with identical COMMAND CODE field contents.
Concrete, due to the COMMAND CODE fields specify of TL1 command format corresponding TL1 command type, and the COMMAND CODE field of TL1 command format is consistent with the COMMAND CODE field of TL1 order, COMMAND CODE field according to TL1 order in the present invention is determined corresponding TL1 command format, be specially and determine the TL1 command format with TL1 order with identical COMMAND CODE field, therefore, in the inventive method, can save and utilize COMMAND CODE binary tree to go the step of the COMMAND CODE field of verification TL1 order, if this is because can find the TL1 command format with TL1 order with identical COMMAND CODE field, the regulation of the TL1 command format having found described in the COMMAND CODE field that described TL1 order is described has met, can continue other each several parts of TL1 order to carry out verification, on the contrary, if can not find the TL1 command format with TL1 order with identical COMMAND CODE field, illustrate that the COMMAND CODE field of described TL1 order does not meet the regulation of any one TL1 command format in system, be that described TL1 order is for illegal.
Preferably, the CTAG field contents of described TL1 command format is numeral, and described CTAG regular expression is ([0-9])
+.
Concrete, in the present invention, CTAG regular expression is in advance according to the regular expression of the CTAG field for verification TL1 order of the CTAG field formulation of described TL1 command format; Other each fields in CTAG field and TL1 order have different feature, in standard telecommunication administration agreement, the CTAG field of regulation TL1 order must be numeral, as input 0 or 01 etc., therefore, each element of CTAG field does not have operation relation, the verification of this part field can adopt regular expression to mate, and described regular expression is ([0-9])
+this regular expression represents that the CTAG field contents of TL1 order can only be made up of the numeral between 0～9, and CTAG field can not be empty, is at least made up of the numeral between 0～9, otherwise the result that adopts this regular expression verification CTAG field will be illegal.
The invention provides a kind of TL1 command checksum embodiment of the method:
If TL1 command format is MELT:::CTAG::a| (b[, c, d]) [, h] [, i, j], k; , in this TL1 order, each field contents is as follows:
COMMAND CODE field: MELT;
TID field: sky;
AID field: sky;
CTAG field: ([0-9])
+;
GENERAL BLOCK field: sky;
DATA BLOCK field: a| (b[, c, d]) [, h] [, i, j], k.
Lower floor's equipment receives the TL1 order MELT:::01::d that upper layer device sends, c, and k, when b, the TL1 proxy module of lower floor's equipment is carried out following operation:
Step 1, finds corresponding TL1 command format according to the COMMAND CODE field MELT of described TL1 order, i.e. above-mentioned TL1 command format MELT:::CTAG::a| (b[, c, d]) [, h] [, i, j], k; ;
Step 2, obtain TID binary tree, AID binary tree, GENERAL BLOCK binary tree, DATABLOCK binary tree and the CTAG regular expression of described TL1 command format, wherein, TID binary tree, AID binary tree, GENERAL BLOCK binary tree are all empty, and CTAG regular expression is ([0-9])
+, DATA BLOCK binary tree as shown in Figure 2;
Step 3, while using described TID binary tree to carry out verification to the TID field of described TL1 order, because the TID field of described TL1 order is empty, has met the requirement of described TID binary tree, and therefore, the TID field of described TL1 order is legal;
Step 4, while using described AID binary tree to carry out verification to the AID field of described TL1 order, because the AID field of described TL1 order is empty, has met the requirement of described AID binary tree, and therefore, the AID field of described TL1 order is legal;
Step 5, is used described CTAG regular expression ([0-9])
+when the CTAG content of described TL1 order is carried out to verification, the CTAG field of described TL1 order is 01, uses regular expression ([0-9])
+the result of carrying out verification is legal;
Step 6, use described GENERAL BLOCK binary tree to carry out verification to the GENERAL BLOCK field of described TL1 order, because the GENERAL BLOCK field of described TL1 order is empty, meet the requirement of described GENERAL BLOCK binary tree, therefore, the GENERAL BLOCK content legality of described TL1 order;
Step 7, is used described DATA BLOCK binary tree to carry out verification to the DATA BLOCK field of described TL1 order, specifically comprises:
Steps A, obtains all parameters of DATABLOCK field in described TL1 order, i.e. d, c, k, b,
Step B, for above each parameter, carries out following checking procedure:
Taking parameter d as example, read parameter d, in described DATA BLOCK binary tree as shown in Figure 2, search the node that node is parameter current d, if find, perform step b1, otherwise, parameter current is defined as to nonrecognition parameter, charge to nonrecognition parameter set;
Step b1, as shown in Figure 3, from described DATA BLOCK binary tree, delete the node at parameter current d place, simultaneously, from the father node of parameter current d place node (figure for nodal value is comma, node) start, search successively its father node, in this process, if find that the nodal value of the current father node finding is left bracket " [" (as node of dash area in Fig. 3), the nodal value of current parent's node is revised as to comma, ", if find that the nodal value of the current father node finding is infix operator " | ", the not child node in accessed path of current parent's node (as the node that is a of nodal value in Fig. 3) is deleted, until find the root node of described DATA BLOCK binary tree,
After the complete parameter d of said process verification, all the other each parameters of verification again, verification mode and said process are similar, in this process, can in DATA BLOCK binary tree as shown in Figure 2, find each node that node is parameter d, c, k, b, there is no nonrecognition parameter;
After all executing above checking procedure for all parameter d, c, k, b, obtain a DATA BLOCK binary tree as shown in Figure 4;
Step C, as shown in Figure 5, deleting all nodal values in a described DATA BLOCK binary tree is that " node of [" and child node thereof, obtain the 2nd DATA BLOCK binary tree as shown in Figure 6 to left bracket;
Step D, travels through described the 2nd DATA BLOCK binary tree, judges wherein whether the nodal value of all nodes is all operator, and having nodal value if determine is the node of inverse symbol, described inverse symbol is defined as Lou selecting parameter, charges to and Lou selects parameter set; The nodal value that can determine all nodes in the 2nd DATA BLOCK binary tree as shown in Figure 6 in this process is all operator, illustrate that in described TL1 order, DATA BLOCK content has comprised all parameters that in described TL1 command format, DATA BLOCK content provided must occur, do not leak and select parameter;
Step e, determine that in DATA BLOCK binary tree as shown in Figure 2, can find nodal value is each node of parameter d, c, k, b, and the nodal value of all nodes is all operator in the 2nd DATA BLOCK binary tree as shown in Figure 6, determine that the DATA BLOCK field of described TL1 order is legal;
Step 8, the check results of determining above-mentioned steps 3～step 7 is all legal, determines that described TL1 order is legal.
Accordingly, the present invention also provides a kind of TL1 command checksum device, as shown in Figure 7, comprising:
Form determination module 701, after the TL1 order sending, determines corresponding TL1 command format according to the command code COMMAND CODE field of described TL1 order for received communication opposite end;
Binary tree acquisition module 702, for obtaining the regular expression of described TL1 command format connective marker CTAG field, and in described TL1 command format except CTAG field binary tree corresponding to each field, wherein, described except CTAG field binary tree corresponding to each field in advance according to evaluation of expression method, this field contents is carried out to the binary tree structure that computing obtains;
Binary tree correction verification module 703, for use described except CTAG field binary tree corresponding to each field, the content of respective field in described TL1 order is carried out to verification;
Expression formula correction verification module 704, for using described CTAG regular expression, carries out verification to the content of CTAG field in described TL1 order;
Result determination module 705, while being all legal, determines that described TL1 order is legal for the result of definite described binary tree correction verification module and the verification of described expression formula correction verification module;
Command execution module 706, in the time that described result determination module determines that described TL1 order is legal, carries out described TL1 order.
Preferably, described TL1 command checksum device also comprises: failure response module 707, in the time that described result determination module determines that described TL1 order is illegal, return to failure response message to described Correspondent Node.
Preferably, described TL1 command checksum device also comprises: binary tree computing module 708, for generate in the following way described except CTAG field binary tree corresponding to each field: for described each field, create respectively an operator stack and a data base, and operator stack and data base described in initialization; According to the each element of described each field order from left to right, be handled as follows: determine when currentElement is parameter, described parameter is pressed in described data base; Determine when currentElement is operator, according to predetermined operator precedence relation, judge that the priority of described operator, whether higher than the stack top element of described operator stack, is if so, pressed into described operator in described operator stack, as stack top element; Otherwise, make in described data base successively from stack top two elements of popping, go out stack element and form binary tree by described operator and described two, described operator is that the father node, described two of this binary tree goes out two child nodes that stack element is described binary tree, and this binary tree is pressed in described data base as stack top element; Until handle last element of this field, the stack top element of described data base is defined as to binary tree corresponding to this field.
Preferably, described TL1 command checksum device also comprises: symbol processing module 709, described except CTAG field before binary tree corresponding to each field for generating at described binary tree computing module 708, determine in described field and include operator pair, and described operator is when including the first operator before first parameter in the content of encapsulation, described the first operator is moved to described operator to before, wherein, described operator forms the first operator by for encapsulating one group of optional parameters and tail operator, described the first operator is the operator that represents to still have other parameters below.
Preferably, described binary tree correction verification module 703 specifically for: resolve described TL1 order, obtain all parameters of respective field in described TL1 order, carry out following checking procedure for each parameter: in the binary tree of described correspondence, search the node that nodal value is parameter current, determine while finding, from the binary tree of described correspondence, delete the node at parameter current place, simultaneously, from the father node of parameter current place node, search successively father node, and in the time determining that the nodal value of the current father node finding is the right first operator of operator, the nodal value of current parent's node is revised as to the first operator, in the time that the nodal value of determining the current father node finding is the second operator, the not child node in accessed path of current parent's node is deleted, until find the root node of the binary tree of described correspondence, wherein said operator forms the first operator by for encapsulating one group of optional parameters and tail operator, described the first operator is the operator that represents to still have other parameters below, described the second operator is the operator that can only have a side parameter to occur in the parameter of its both sides of expression, all execute after above checking procedure for described all parameters, obtain the first binary tree, deleting all nodal values in described the first binary tree is node and the child node thereof of the first operator that described operator is right, obtains the second binary tree, whether the nodal value that judges all nodes in described the second binary tree is all operator, determine that in the binary tree of described correspondence, can find nodal value is the node of described each parameter, and when the nodal value of all nodes is all operator in described the second binary tree, the respective field of determining described TL1 order is legal.
Preferably, described TL1 command checksum device also comprises: parameter is returned to module 710, be used for: when described binary tree correction verification module 703 is for described each parameter, determine the node that to search less than nodal value be parameter current in the binary tree of described correspondence time, parameter current is defined as to nonrecognition parameter; Determine while existing nodal value to be the node of inverse symbol in described the second binary tree when described binary tree correction verification module, described inverse symbol is defined as Lou selecting parameter; Determine when described TL1 order is illegal, return to described leakage to described Correspondent Node and select parameter and/or nonrecognition parameter.
Preferably, described form determination module 701 specifically for: determine with described TL1 order and there is the TL1 command format of identical COMMAND CODE field contents.
The specific implementation function of the modules of the TL1 of institute command checksum device, referring to the specific implementation process of above-mentioned TL1 command checksum method, does not repeat them here.
Obviously, those skilled in the art can carry out various changes and modification and not depart from the spirit and scope of the present invention the present invention.Like this, if these amendments of the present invention and within modification belongs to the scope of the claims in the present invention and equivalent technologies thereof, the present invention is also intended to comprise these changes and modification interior.
Claims (13)
1. a Traditional affair language TL1 command checksum method, is characterized in that, comprising:
After the TL1 order that received communication opposite end sends, determine corresponding TL1 command format according to the command code COMMAND CODE field of described TL1 order;
Obtain the regular expression of connective marker CTAG field in described TL1 command format, and in described TL1 command format except CTAG field binary tree corresponding to each field, wherein, described except CTAG field binary tree corresponding to each field in advance according to evaluation of expression method, this field contents is carried out to the binary tree structure that computing obtains; Described except CTAG field binary tree corresponding to each field specifically generate in the following way: for described each field, create respectively an operator stack and a data base, and operator stack and data base described in initialization; According to the each element of described each field order from left to right, be handled as follows: determine when currentElement is parameter, described parameter is pressed in described data base; Determine when currentElement is operator, according to predetermined operator precedence relation, judge that the priority of described operator, whether higher than the stack top element of described operator stack, is if so, pressed into described operator in described operator stack, as stack top element; Otherwise, make in described data base successively from stack top two elements of popping, go out stack element and form binary tree by described operator and described two, described operator is that the father node, described two of this binary tree goes out two child nodes that stack element is described binary tree, and this binary tree is pressed in described data base as stack top element; Until handle last element of this field, the stack top element of described data base is defined as to binary tree corresponding to this field;
Use described except CTAG field binary tree corresponding to each field, the content of respective field in described TL1 order is carried out to verification, specifically comprise: resolve described TL1 order, obtain all parameters of respective field in described TL1 order, carry out following checking procedure for each parameter: in the binary tree of described correspondence, search the node that nodal value is parameter current, determine while finding, from the binary tree of described correspondence, delete the node at parameter current place, simultaneously, from the father node of parameter current place node, search successively father node, and in the time determining that the nodal value of the current father node finding is the right first operator of operator, the nodal value of current parent's node is revised as to the first operator, in the time that the nodal value of determining the current father node finding is the second operator, the not child node in accessed path of current parent's node is deleted, until find the root node of the binary tree of described correspondence, wherein said operator forms the first operator by for encapsulating one group of optional parameters and tail operator, described the first operator is the operator that represents to still have other parameters below, described the second operator is the operator that can only have a side parameter to occur in the parameter of its both sides of expression, all execute after above checking procedure for described all parameters, obtain the first binary tree, deleting all nodal values in described the first binary tree is node and the child node thereof of the first operator that described operator is right, obtains the second binary tree, whether the nodal value that judges all nodes in described the second binary tree is all operator, determine that in the binary tree of described correspondence, can find nodal value is the node of described each parameter, and when the nodal value of all nodes is all operator in described the second binary tree, the respective field of determining described TL1 order is legal,
Use described CTAG regular expression, the content of CTAG field in described TL1 order is carried out to verification;
When the check results of determining each field in described TL1 order is legal, determine that described TL1 order is legal;
In the time that definite described TL1 order is legal, carry out described TL1 order.
2. the method for claim 1, is characterized in that, in the time that definite described TL1 order is illegal, returns to failure response message to described Correspondent Node.
3. the method for claim 1, is characterized in that, generates described except CTAG field, before binary tree corresponding to each field, also to comprise:
Determine in described field and include operator pair, and described operator is when including the first operator before first parameter in the content of encapsulation, described the first operator is moved to described operator to before, wherein, described operator forms the first operator by for encapsulating one group of optional parameters and tail operator, and described the first operator is the operator that represents to still have other parameters below.
4. method as claimed in claim 3, is characterized in that, described operator is to being made up of the left bracket of first operator " [" and the right bracket of tail operator "] ", and described the first operator is comma, ".
5. the method for claim 1, is characterized in that, described operator is to being made up of the left bracket of first operator " [" and the right bracket of tail operator "] ", and described the first operator is comma, ", described the second operator is infix operator " | ".
6. the method for claim 1, is characterized in that, also comprises:
For described each parameter, determine the node that to search less than nodal value be parameter current in the binary tree of described correspondence time, parameter current is defined as to nonrecognition parameter;
Determine while existing nodal value to be the node of inverse symbol in described the second binary tree, described inverse symbol is defined as Lou selecting parameter;
Determine when described TL1 order is illegal, return to described leakage to described Correspondent Node and select parameter and/or nonrecognition parameter.
7. the method as described in as arbitrary in claim 1～6, is characterized in that, determines corresponding TL1 command format according to the COMMAND CODE field of described TL1 order, specifically comprises:
Determine the TL1 command format with described TL1 order with identical COMMAND CODE field contents.
8. the method as described in as arbitrary in claim 1～6, is characterized in that, the CTAG field contents of described TL1 command format is numeral, and described CTAG regular expression is ([0-9])
+.
9. a Traditional affair language TL1 command checksum device, is characterized in that, comprising:
Form determination module, after the TL1 order sending, determines corresponding TL1 command format according to the command code COMMAND CODE field of described TL1 order for received communication opposite end;
Binary tree acquisition module, for obtaining the regular expression of described TL1 command format connective marker CTAG field, and in described TL1 command format except CTAG field binary tree corresponding to each field, wherein, described except CTAG field binary tree corresponding to each field in advance according to evaluation of expression method, this field contents is carried out to the binary tree structure that computing obtains;
Binary tree correction verification module, for use described except CTAG field binary tree corresponding to each field, the content of respective field in described TL1 order is carried out to verification;
Expression formula correction verification module, for using described CTAG regular expression, carries out verification to the content of CTAG field in described TL1 order;
Result determination module, while being all legal, determines that described TL1 order is legal for the result of definite described binary tree correction verification module and the verification of described expression formula correction verification module;
Command execution module, in the time that described result determination module determines that described TL1 order is legal, carries out described TL1 order;
Binary tree computing module, for generate in the following way described except CTAG field binary tree corresponding to each field: for described each field, create respectively an operator stack and a data base, and operator stack and data base described in initialization; According to the each element of described each field order from left to right, be handled as follows: determine when currentElement is parameter, described parameter is pressed in described data base; Determine when currentElement is operator, according to predetermined operator precedence relation, judge that the priority of described operator, whether higher than the stack top element of described operator stack, is if so, pressed into described operator in described operator stack, as stack top element; Otherwise, make in described data base successively from stack top two elements of popping, go out stack element and form binary tree by described operator and described two, described operator is that the father node, described two of this binary tree goes out two child nodes that stack element is described binary tree, and this binary tree is pressed in described data base as stack top element; Until handle last element of this field, the stack top element of described data base is defined as to binary tree corresponding to this field;
Described binary tree correction verification module specifically for: resolve described TL1 order, obtain all parameters of respective field in described TL1 order, carry out following checking procedure for each parameter: in the binary tree of described correspondence, search the node that nodal value is parameter current, determine while finding, from the binary tree of described correspondence, delete the node at parameter current place, simultaneously, from the father node of parameter current place node, search successively father node, and in the time determining that the nodal value of the current father node finding is the right first operator of operator, the nodal value of current parent's node is revised as to the first operator, in the time that the nodal value of determining the current father node finding is the second operator, the not child node in accessed path of current parent's node is deleted, until find the root node of the binary tree of described correspondence, wherein said operator forms the first operator by for encapsulating one group of optional parameters and tail operator, described the first operator is the operator that represents to still have other parameters below, described the second operator is the operator that can only have a side parameter to occur in the parameter of its both sides of expression, all execute after above checking procedure for described all parameters, obtain the first binary tree, deleting all nodal values in described the first binary tree is node and the child node thereof of the first operator that described operator is right, obtains the second binary tree, whether the nodal value that judges all nodes in described the second binary tree is all operator, determine that in the binary tree of described correspondence, can find nodal value is the node of described each parameter, and when the nodal value of all nodes is all operator in described the second binary tree, the respective field of determining described TL1 order is legal.
10. device as claimed in claim 9, is characterized in that, also comprises:
Failure response module, in the time that described result determination module determines that described TL1 order is illegal, returns to failure response message to described Correspondent Node.
11. devices as claimed in claim 9, it is characterized in that, also comprise: symbol processing module, described except CTAG field before binary tree corresponding to each field for generating at described binary tree computing module, determine in described field and include operator pair, and described operator is when including the first operator before first parameter in the content of encapsulation, described the first operator is moved to described operator to before, wherein, described operator forms the first operator by for encapsulating one group of optional parameters and tail operator, described the first operator is the operator that represents to still have other parameters below.
12. devices as claimed in claim 9, is characterized in that, also comprise: parameter is returned to module, for:
When described binary tree correction verification module is for described each parameter, determine the node that to search less than nodal value be parameter current in the binary tree of described correspondence time, parameter current is defined as to nonrecognition parameter;
Determine while existing nodal value to be the node of inverse symbol in described the second binary tree when described binary tree correction verification module, described inverse symbol is defined as Lou selecting parameter;
Determine when described TL1 order is illegal, return to described leakage to described Correspondent Node and select parameter and/or nonrecognition parameter.
13. devices as described in as arbitrary in claim 9～12, is characterized in that, described form determination module specifically for:
Determine the TL1 command format with described TL1 order with identical COMMAND CODE field contents.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201210074991.9A CN102624736B (en) | 2012-03-20 | 2012-03-20 | TL1 (transaction language 1) command verification method and TL1 command verification device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201210074991.9A CN102624736B (en) | 2012-03-20 | 2012-03-20 | TL1 (transaction language 1) command verification method and TL1 command verification device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102624736A CN102624736A (en) | 2012-08-01 |
| CN102624736B true CN102624736B (en) | 2014-11-12 |
Family
ID=46564420
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201210074991.9A Active CN102624736B (en) | 2012-03-20 | 2012-03-20 | TL1 (transaction language 1) command verification method and TL1 command verification device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102624736B (en) |
Families Citing this family (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106294317A (en) * | 2016-07-29 | 2017-01-04 | 浪潮(北京)电子信息产业有限公司 | The form information method of calibration at a kind of cloud platform interface and system |
| WO2018138793A1 (en) * | 2017-01-25 | 2018-08-02 | 三菱電機株式会社 | Attack/abnormality detection device, attack/abnormality detection method, and attack/abnormality detection program |
| CN110618961B (en) * | 2019-08-22 | 2021-04-27 | 苏州浪潮智能科技有限公司 | Method and device for realizing command verification of UBM (universal UBM management module) backplane |
| CN116932305B (en) * | 2023-09-15 | 2023-12-12 | 新华三信息技术有限公司 | Test file generation method and device, electronic equipment and storage medium |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6263366B1 (en) * | 1996-12-31 | 2001-07-17 | Mci Communications Corporation | System and method therefor of translating a message having a given format for usage in an operations system |
| CN1767524A (en) * | 2004-10-31 | 2006-05-03 | 中兴通讯股份有限公司 | Message processing system and its processing method |
| CN1829221A (en) * | 2005-03-02 | 2006-09-06 | 华为技术有限公司 | Traditional affair language interface transfer device and method |
| CN102142009A (en) * | 2010-12-09 | 2011-08-03 | 华为技术有限公司 | Method and device for matching regular expressions |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR100263386B1 (en) * | 1997-12-31 | 2000-08-01 | 강병호 | Method of parsing transaction language 1 in a regional monitor and control system |
-
2012
- 2012-03-20 CN CN201210074991.9A patent/CN102624736B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6263366B1 (en) * | 1996-12-31 | 2001-07-17 | Mci Communications Corporation | System and method therefor of translating a message having a given format for usage in an operations system |
| CN1767524A (en) * | 2004-10-31 | 2006-05-03 | 中兴通讯股份有限公司 | Message processing system and its processing method |
| CN1829221A (en) * | 2005-03-02 | 2006-09-06 | 华为技术有限公司 | Traditional affair language interface transfer device and method |
| CN102142009A (en) * | 2010-12-09 | 2011-08-03 | 华为技术有限公司 | Method and device for matching regular expressions |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102624736A (en) | 2012-08-01 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| KR102317535B1 (en) | Methods and systems for implementing data tracking with software development kits | |
| CN103383681B (en) | A kind of file type identification method and system | |
| CN107861713A (en) | Data calling method, device and computer-readable recording medium | |
| CN102624736B (en) | TL1 (transaction language 1) command verification method and TL1 command verification device | |
| CN110221968A (en) | Method for testing software and Related product | |
| CN102946415B (en) | A kind of implementation method of mobile terminal this locality application and device | |
| CN108804516A (en) | Similar users search device, method and computer readable storage medium | |
| CN107171897A (en) | A kind of interface test method and data-interface test system | |
| CN105573956A (en) | Serialization method and serialization-based network communication method | |
| CN107193917A (en) | Whole station CONFIG.SYS lossless data update method based on IID | |
| CN107105428A (en) | The method and device in quick completion end message storehouse | |
| CN108282377B (en) | Processing method and device for testing logistics service data and server | |
| CN107181815A (en) | A kind of micro- application and micro services exchange method, micro- application and system | |
| CN107797823A (en) | Business Rule Management method, apparatus, storage medium and computer equipment | |
| CN105511935B (en) | The acquisition methods and device of resource index value | |
| CN101794283A (en) | Method and system for processing character strings and matcher | |
| CN107992498A (en) | A kind of method and system for importing data to data warehouse | |
| CN106951593B (en) | Method and device for generating configuration file of protection measurement and control device | |
| CN101986282B (en) | Topology adaptation method and device | |
| CN110489207A (en) | Verification method, apparatus and computer readable storage medium | |
| CN103457957B (en) | A kind of network penetration test macro and method with adaptation function | |
| CN103186405A (en) | Method and device for implementing unified control of equipment | |
| CN105335160A (en) | Method for agile development of WEB-side components based JSF (Java Server Face) | |
| CN106610899B (en) | Test case generation method and device | |
| CN115878860A (en) | Menu generation method, device, server equipment and medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant |