CN102624736A - 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
- CN102624736A CN102624736A CN2012100749919A CN201210074991A CN102624736A CN 102624736 A CN102624736 A CN 102624736A CN 2012100749919 A CN2012100749919 A CN 2012100749919A CN 201210074991 A CN201210074991 A CN 201210074991A CN 102624736 A CN102624736 A CN 102624736A
- Authority
- CN
- China
- Prior art keywords
- operator
- field
- binary tree
- parameter
- node
- 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.)
- Granted
Links
Images
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 the TL1 order, the command format with standard, and this makes developer and operator can both easily understand the TL1 order.
In the network management model based on TL1, through TL1 northbound interface transmission TL1 order, the TL1 proxy module of TL1 northbound interface is specifically designed to verification and explains the TL1 order between upper layer device and the lower floor's equipment.When upper layer device issues TL1 when order to lower floor's equipment; The TL1 northbound interface of lower floor's equipment receives this TL1 order; And it is carried out verification by TL1 proxy module wherein, if judge after the verification that this TL1 order is legal, then the TL1 proxy module becomes the assignment instructions that system can carry out with this TL1 command interpretation and issues; So that related network elements equipment is carried out corresponding task; After task was finished, the TL1 proxy module can generate the response message that meets TL1 communication protocol with the execution result packing and report upper layer device, if judge after the verification that the TL1 order of receiving is illegal; Then the TL1 proxy module reports upper layer device with the error message that generation meets TL1 communication protocol, informs that mistake appears in the TL1 order of input.It is thus clear that 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; Usually be upper layer device and a plurality of TL1 command formats that are used for verification TL1 order of lower floor's equipment disposition that link together in advance; The TL1 command format comprises six major parts: command code COMMAND CODE, purpose identifier TID, access identifier AID, connective marker CTAG, generic block GENERAL BLOCK, parameter block DATA BLOCK; Separate with colon ": " between this six part, and with branch "; " finish, concrete form is: COMMAND CODE:TID:AID:CTAG:GENERAL BLOCK:DATA BLOCK;
Each TL1 command format has been stipulated the form that a cover TL1 order should be followed, and the TL1 order also comprises above-mentioned six major parts; Wherein, Command code COMMAND CODE is used to indicate concrete TL1 command type; For example, when the COMMAND CODE content of TL1 order is ACT, represent that this TL1 order is ACT (activation) order; And when the COMMAND of TL1 command format CODE content was ACT, this TL1 command format was used for the TL1 order of identification and verification ACT (activation) type; Purpose identifier TID is used to indicate the network element of carrying out the TL1 order, and for example the TID value of TL1 order can be ID number of purpose network element device, and the TID value of TL1 order has stipulated then which the legal TID value of corresponding TL1 order is; Insert identifier AID and be used to indicate concrete equipment veneer name or the signal name of carrying out the TL1 order; Connective marker CTAG is used for TL1 order and relative response message are associated, and according to the telecommunication administration agreement of standard, the CTAG content must be digital, but in the reality each manufacturer can to carry out self-defined CTAG content according to self needs be numeral or character; Generic block GENERAL BLOCK is used to specify the execution option of TL1 order, as postponing activation etc.; Part after the generic block GENERAL BLOCK is parameter block DATA BLOCK, is used to represent the concrete execution parameter of TL1 order, wherein may comprise zero or multi-parameter piece more, is separated by colon ": " between these parameter blocks.
In above-mentioned six parts; The COMMAND CODE content of TL1 command format is consistent with the COMMAND CODE content of its corresponding TL1 order; The TID of TL1 command format, AID, CTAG, GENERAL BLOCK, DATA BLOCK content then separate provision the form that should follow of TID, AID, CTAG, GENERAL BLOCK, the DATA BLOCK content of corresponding TL1 order, promptly stipulated various parameters that the TL1 order should have and the operation relation between the parameter.Wherein, use the operator regulation TL1 in the table 1 to order the operation relation between each parameter in the TL1 command format:
Table 1
| ， | | | [ | ( | ] | ) |
| Comma | Infix operator | Left side bracket | Left side round bracket | Right bracket | Right round bracket |
Wherein, comma, " represent that order has end or not, the back is a parameter also; Infix operator " | " is used to separate the parameter of both sides, and the wherein parameter of a side can only appear in expression; Left side bracket " [" and right bracket "] " is formed bracket jointly to " [] ", and expression encapsulates one group of optional parameter, parameter wherein or all occur, or do not occur all; Left side round bracket " (" and right round bracket ") " is formed round bracket jointly " () " expression has been encapsulated one group of essential operator or parameter.
Above-mentioned operator only appears in the TL1 command format, but do not appear in the TL1 order, for example, TL1 command format MELT:::CTAG:m, n, z:a|b; The TL1 that has stipulated the MELT type orders the form that should follow, and promptly this TL1 command format is used for verification MELT order, and this TL1 command format has stipulated that the TID content and the AID content of MELT order do not have parameter; Regulation CTAG content is a numeral, and the parameter of regulation GENERALBLOCK content should be m, n; Z, the parameter of regulation DATABLOCK content should be a or b, for example; The MELT order that this command format is corresponding can be MELT:::01:m, n, z:a;
Because a string character string that TL1 order itself is made up of parameter; 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 is directed against the regular expression that each TL1 command format has been formulated a correspondence again, and this regular expression is a kind of formula that can realize easily that verification is carried out in order to TL1.At present, lower floor's equipment receives TL1 when order, and the normal TL1 command checksum method that adopts is: according to the COMMAND CODE content of the TL1 order of said reception; Confirm corresponding TL1 command format, and further confirm corresponding regular expression, utilize this regular expression that it is carried out verification again; If verification succeeds; Explain that then the TL1 order that upper layer device issues is legal, otherwise, explain that the TL1 that upper layer device issues orders illegal.
Though adopt regular expression to TL1 order to carry out verification more convenient; But but there is the following shortcoming: when 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 the parameter; Regular expression has strict requirement to the order of parameter, and this just requires upper layer device when issuing the TL1 order, and parameter order wherein must meet the order of regular expression defined; Otherwise check results will be illegal, in fact; The TL1 command format is to the not restriction in proper order of the parameter in the TL1 order, and for example, upper layer device is when issuing the TL1 order; Below two orders be considered to the same command: MELT:::00:m, n, z:a; And MELT:::00:z, n, m:a; This shows that the existing method of regular expression verification TL1 order of utilizing can not be expressed the complex calculation relation between the parameter preferably, and to a great extent limit the flexibility of upper layer device input TL1 order.
Summary of the invention
The present invention provides a kind of TL1 command checksum method and device; The simple complex calculation that adopts regular expression to stipulate according to the TL1 command format preferably concerns that verification is carried out in order to TL1 in the prior art in order to solve, and influences the problem that upper layer device can not be imported the TL1 command parameter flexibly.
The inventive method comprises:
A kind of TL1 command checksum method comprises:
After the TL1 order that send the received communication opposite end, confirm corresponding TL1 command format according to the command code COMMAND CODE field of said TL1 order;
Obtain the regular expression of connective marker CTAG field in the said TL1 command format; And in the said TL1 command format except that the CTAG field the corresponding binary tree of each field; Wherein, Said except that the CTAG field the corresponding binary tree of each field in advance according to the evaluation of expression method, this field contents is carried out the binary tree structure that computing obtains;
Use said except that the CTAG field the corresponding binary tree of each field, the content of respective field in the said TL1 order is carried out verification;
Use said CTAG regular expression, the content of CTAG field in the said TL1 order is carried out verification;
When the check results of confirming each field in the said TL1 order all is legal, confirm that said TL1 order is legal;
When definite said TL1 orders when legal, carry out said TL1 order.
A kind of TL1 command checksum device comprises:
The form determination module after the TL1 order that is used for sending the received communication opposite end, is confirmed corresponding TL1 command format according to the command code COMMAND CODE field of said TL1 order;
The binary tree acquisition module; Be used for obtaining the regular expression of said TL1 command format connective marker CTAG field; And in the said TL1 command format except that the CTAG field the corresponding binary tree of each field; Wherein, said except that the CTAG field the corresponding binary tree of each field in advance according to the evaluation of expression method, this field contents is carried out the binary tree structure that computing obtains;
Binary tree verification module, be used to use said except that the CTAG field the corresponding binary tree of each field, the content of respective field in the said TL1 order is carried out verification;
Expression formula verification module is used to use said CTAG regular expression, and the content of CTAG field in the said TL1 order is carried out verification;
Determination module when the check results that is used for each field of definite said TL1 order all is legal, confirms that said TL1 order is legal as a result;
Command execution module is used for ordering when legal as definite said TL1, carries out said TL1 order.
A kind of TL1 command checksum method provided by the invention and device; Based on the evaluation of expression method; Respectively each field except that the CTAG field in the TL1 command format is carried out computing and obtain corresponding binary tree; Utilize the corresponding binary tree of said each field except that the CTAG field that the respective field in the TL1 order that receives is carried out verification then respectively; Because the binary tree structure that the present invention adopts can be expressed TL1 command format predetermined parameter operation relation preferably, therefore can accurately, promptly order and carry out verification TL1.
Description of drawings
Fig. 1 is a kind of TL1 command checksum method flow diagram provided by the invention;
A kind of binary tree structure sketch map that Fig. 2 provides for the embodiment of the invention;
A kind of sketch map that utilizes binary tree checking parameter shown in Figure 2 that Fig. 3 provides for the embodiment of the invention;
A kind of first binary tree structure sketch map that Fig. 4 provides for the embodiment of the invention;
Fig. 5 a kind ofly deletes that all nodal values are left bracket " node of [" and the sketch map of child node thereof in the binary tree structure shown in Figure 4 for what the embodiment of the invention provided;
A kind of second binary tree structure sketch map that Fig. 6 provides for the embodiment of the invention;
The structural representation of a kind of TL1 command checksum device that Fig. 7 provides for the embodiment of the invention.
Embodiment
Below in conjunction with accompanying drawing and specific embodiment, 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 just are used to express the symbol of certain operations relation, those skilled in the art can under the situation of expressing the identical operation relation, adopt other symbols to replace according to the needs of self fully.
The present invention provides a kind of TL1 command checksum method, and as shown in Figure 1, this method comprises:
Step 101 after the TL1 order that send the received communication opposite end, is confirmed corresponding TL1 command format according to the command code COMMAND CODE field of said TL1 order;
Step 102; Obtain the regular expression of connective marker CTAG field in the said TL1 command format; And in the said TL1 command format except that the CTAG field the corresponding binary tree of each field; Wherein, said except that the CTAG field the corresponding binary tree of each field in advance according to the evaluation of expression method, this field contents is carried out the binary tree structure that computing obtains;
Step 103, use said except that the CTAG field the corresponding binary tree of each field, the content of respective field in the said TL1 order is carried out verification;
Step 104 is used said CTAG regular expression, and the content of CTAG field in the said TL1 order is carried out verification;
Step 105 when the check results of confirming each field in the said TL1 order all is legal, confirms that said TL1 order is legal;
Step 106 when definite said TL1 orders when legal, is carried out said TL1 order.
In the inventive method, said each field except that the CTAG field is respectively: command code COMMAND CODE field, purpose 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 the evaluation of expression method; Respectively each field except that the CTAG field in the TL1 command format is carried out computing and obtain corresponding binary tree; Utilize the corresponding binary tree of said each field except that the CTAG field that the respective field in the TL1 order that receives is carried out verification then respectively; Because the binary tree structure that the present invention adopts can be expressed TL1 command format predetermined parameter operation relation preferably, therefore can accurately, promptly order and carry out verification TL1.
Preferably, the inventive method also comprises: when definite said TL1 orders when illegal, return failure response message to said Correspondent Node.
Preferably, said except that the CTAG field the corresponding binary tree of each field specifically generate through following mode: to said each field, create an operator stack and a data base respectively, and said operator stack of initialization and data base; According to said each element of each field order from left to right, handle as follows: when confirming that currentElement is parameter, said parameter is pressed in the said data base; When confirming that currentElement is operator,, judge whether the priority of said operator is higher than the stack top element of said operator stack, if then said operator is pressed in the said operator stack, as stack top element according to predetermined operator precedence relation; Otherwise; Make in the said data base successively from stack top two elements of popping; Go out stack element and constitute binary tree by said operator and said two; Said operator goes out two node that stack element is said binary tree, and is pressed into this binary tree in the said data base as stack top element for the father node of this binary tree, said two; Till last element of handling this field, the stack top element of said data base is confirmed as the corresponding binary tree of this field.
Concrete; Adopt method of calibration provided by the invention to before TL1 order the carrying out verification; Need in advance according to the evaluation of expression method; COMMAND CODE field, TID field, AID field, GENERAL BLOCK field, DATA BLOCK field to the TL1 command format are carried out computing, obtain corresponding TID binary tree, AID binary tree, GENERAL BLOCK binary tree, DATA BLOCK binary tree.Wherein, said evaluation of expression method is a kind of important application of stack in the data structure, is example with the TID binary tree, and the detailed process of utilizing this method to try to achieve the TID binary tree structure is:
Step a1 creates an operator stack and a data base, and said operator stack, data base are carried out initialization, and promptly the stack top at said two stacks is pressed into pound sign " # " operator;
Step a2 confirms the TID field of said TL1 command format, according to order from left to right, each element of said TID field is carried out following operation:, then this parameter is pressed in the said data base if the element of current TID field is a parameter; If operator; Then, judge whether the priority of said operator is higher than the stack top element of said operator stack (initial stack top element is pound sign " # ") according to the relation of the operator precedence in the said table 2, if; Then this operator is pressed into said operator stack; Otherwise make two elements of popping successively in the said data base, and make said two to go out stack element and carry out computing according to said operator, this calculating process is actual to be to make two node of said two parameters of popping as this operator; Form node structure, and then be pressed into the data base top to this node structure;
Table 2
Annotate: x is the stack top element of operator stack, and y is current operator of reading in, when x/y correspondence "＞", and expression priority relationship x＞y, the rest may be inferred; If x＞y, then the operator precedence of x is higher than y; If x＜y, then the priority of x is lower than y; If x$y, then x and y can not be adjacent.
Step a3 is finished according to above-mentioned steps a2 up to all elements of said TID content, and at this moment, the stack top element of said data base is final TID binary tree.
In addition; When adopting said method to generate the binary tree of each field correspondence; If find the stack top element of current operator of reading in and said operator stack have can not be adjacent relation; Explain that then current TL1 command format is illegal, can not generate corresponding binary tree, need to report to the police and point out that current TL1 command format is illegal situation according to this TL1 command format.
Preferably; Generate saidly except that the CTAG field before the corresponding binary tree of each field, also comprise: it is right to confirm to include operator in the said field, and said operator is when including first operator before the first parameter in the content of encapsulation; With said first operator move to said operator to before; Wherein, said operator is to being made up of the first operator and the tail operator that are used to encapsulate one group of optional parameters, and said first operator still has the operator of other parameters for the expression back.
Preferably, said operator is to being made up of first operator left side bracket " the right bracket "] of [" and tail operator ", and said first operator is a comma, ".
Concrete, stipulate in the standard telecommunication administration agreement, in the TL1 command format; Bracket should have comma to before the first parameter in " [] ", ", but when according to the evaluation of expression method each several part content of TL1 command format being carried out computing; if in the each several part content of TL1 command format, bracket has comma before to the first parameter in " [] ", " time; Should be at first with said comma; " Move to said bracket before, carry out computing again, otherwise can not obtain binary tree structure " [] ".For example, if the DATA BLOCK content of TL1 command format be a| (b [, c, d]) [, h] [; I, j], when then it being carried out computing and tries to achieve DATA BLOCK binary tree according to the evaluation of expression method, should be at first with bracket to the comma before the first parameter in " [] "; Move to said bracket before, promptly be revised as a| (b, [c, d]) " [] "; [h], [i, j], and then carry out computing.
It is pointed out that according to the evaluation of expression method respective field of TL1 command format is carried out computing, is to obtain the definite binary tree of structure; And in the inventive method, before evaluation of expression method execution computing, need to carry out earlier with bracket to the comma before the first parameter in " [] "; " Move to said bracket to " [] " special processing before, this mainly is before comma should be arranged owing to stipulated the bracket of TL1 command format in the standard telecommunication administration agreement to first parameter in " [] ", "; but those skilled in the art should have reason to be sure of this step is not that the inventive method is necessary, for example, in actual the enforcement; each producer can implement according to the regulation of standard telecommunication administration agreement; also can when configuration TL1 command format, first parameter in " [] " be provided with comma before according to the needs of oneself at bracket; " And it is arranged on bracket to " [] " before, like this when adopting method provided by the invention, just can not carry out the special processing of symbol and directly carried out computing according to the evaluation of expression method.
Preferably, in the above-mentioned steps 103, use said except that the CTAG field the corresponding binary tree of each field, the content of respective field in the said TL1 order is carried out verification, specifically comprise:
Resolve said TL1 order, obtain all parameters of respective field in the said TL1 order; Carry out following checking procedure to each parameter: in the binary tree of said correspondence, search the node that nodal value is a parameter current; When confirming to find, the node at deletion parameter current place from the binary tree of said correspondence, simultaneously; The father node of node begins from the parameter current place; Search father node successively, and when the nodal value of confirming the current father node that finds is the right first operator of operator, the nodal value of current parent's node is revised as first operator; When the nodal value of confirming the current father node that finds is second operator; With the deletion of the not child node in searching the path of current parent's node, till the root node of the binary tree that finds said correspondence, wherein said operator is to being made up of the first operator and the tail operator that are used to encapsulate one group of optional parameters; Said first operator still has the operator of other parameters for representing the back, the operator that can only have a side parameter to occur in the parameter of said second operator for its both sides of expression; After all executing above checking procedure to said all parameters, obtain first binary tree; Delete that all nodal values are the node and the child node thereof of the right first operator of said operator in said first binary tree, obtain second binary tree; Whether the nodal value of judging all nodes in said second binary tree all is operator; Confirming in the binary tree of said correspondence, can find nodal value is the node of said each parameter, and when the nodal value of all nodes all is operator in said second binary tree, confirms that the respective field of said TL1 order is legal.
Preferably, said operator is to being made up of first operator left side bracket " the right bracket "] of [" and tail operator ", and said first operator is a comma, ", said second operator is an infix operator " | ".
Below be that example is explained above checking procedure with the TID field.
Among the present invention; The TID binary tree is according to the evaluation of expression method, and the TID field of TL1 command format is carried out the binary tree structure that computing obtains, and it has expressed the TL1 command format well to the parameter of TID field and the operation relation between each parameter in the TL1 order; Wherein, Each node (nodal value is an operator) that comprises operator in the said TID binary tree has promptly been represented the operation relation between said each parameter, and said each child node that comprises the node of operator has promptly been represented each parameter with said operation relation, therefore; Use said TID binary tree that the TID field of said TL1 order is carried out verification; Can access the check results of the operation relation that meets said TL1 command format defined, and, because the relation between each node is a kind of data relation in the said TID binary tree; Sequencing is not had specific (special) requirements, and therefore the order to each parameter in the TL1 order does not limit yet when verification.
Concrete, use said TID binary tree that each parameter in said all parameters is carried out verification respectively, to any parameter wherein, its checking procedure can be summarised as the following process that chops at a tree:
In said TID binary tree, search the node that nodal value is a parameter current,, explain that then parameter current can be identified, the node at parameter current place is deleted (being equivalent to the process of chopping at a tree) from said TID binary tree if find; Simultaneously, the father node of node begins from the parameter current place, searches father node successively; In this process, if find the nodal value of the current father node that finds be left bracket " [", then the nodal value with current parent's node is revised as comma; ", this is because bracket is optional relation to all parameters in " [] ", promptly bracket is to all parameters in " [] " or all occur; Do not occur, when parameter current is identified, just should all occur with himself or with node that its ancestor node has an optional relation; Therefore, should be with the nodal value of current parent's node by left bracket " [" changes comma into, "; In addition; If find that the nodal value of the current father node that finds is an infix operator " | "; Then with the not child node in searching the path deletion (being equivalent to the process of chopping at a tree) of current parent's node, this is because the parameter of infix operator " | " both sides has mutex relation, when parameter current is identified; Just should not occur again with himself or with parameter that its ancestor node has a mutex relation, just should be with the knot removal at these parameters that should not occur places; Above-mentioned process of searching father node is till the root node that finds the TID binary tree.It is pointed out that in the above-mentioned process of each parameter being carried out verification that the present invention is to the verification not restriction in proper order of said each parameter, i.e. which parameter of first verification no matter is as long as all parameters finally can both be accomplished verification.
Concrete; Because above checking procedure of carrying out to each parameter all is equivalent to the process that once chops at a tree; Therefore all execute after the above checking procedure to said all parameters, the structure of said TID binary tree might change because of being chopped at a tree, and note TID binary tree at this moment is a TID binary tree.
Concrete, after utilizing said TID binary tree all parameters of TID field carry out verification in to the TL1 order, be the left bracket " node of [" if also have nodal value in the TID binary tree of acquisition; Because the child node of this category node has optional relation, promptly can occur, and also can not occur; And all occur; Not occurring, at this moment, is " the node of [" and child node thereof the deletion of left bracket with these nodal values in a said TID binary tree; Soon these all occur or all do not occur can be regarded as legal parameter ignorance, obtain the 2nd TID binary tree.
Concrete; Travel through said the 2nd TID binary tree, judge whether the nodal value of all nodes in said the 2nd TID binary tree all is operator, in this step; If the nodal value of all nodes all is an operator in said the 2nd TID binary tree; Explain that then TID field in the said 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 said TL1 order is not missed each parameter that the TID fields specify of said TL1 command format must occur, and promptly leaks and selects parameter.
Concrete; If in the time of in said TID binary tree, can finding nodal value to be the node of said each parameter, explain that all parameters of TID field in the said TL1 order have all been identified by said TID binary tree, promptly there is not the nonrecognition parameter; On this basis; If confirm that also the nodal value of all nodes in said the 2nd TID binary tree all is an operator, explain that then all parameters that must occur of TL1 command format defined are all identified, promptly do not exist to leak yet and select parameter; Therefore, can confirm that the TID field that said TL1 orders is legal.
Preferably, said method also comprises: to said each parameter, confirm in the binary tree of said correspondence, to search when being the node of parameter current less than nodal value, parameter current is confirmed as the nonrecognition parameter; When confirming to exist in said second binary tree nodal value to be the node of inverse symbol, said inverse symbol confirmed as Lou select parameter; Confirm that said TL1 orders when illegal, returns said leakage to said Correspondent Node and selects parameter and/or nonrecognition parameter.
Be that example is explained still below with the TID field.
Concrete; To each parameter of TID field in the said TL1 order,, explain that parameter current can not be discerned by said TID binary tree when confirming in said TID binary tree, to search when being the node of parameter current less than nodal value; Be not stipulate this parameter in the TID field of TL1 command format; Therefore, can parameter current be confirmed as the nonrecognition parameter, preserve as one of illegal reason of TID field of said TL1 order; And confirm that final said TL1 orders when illegal, returns to Correspondent Node with said nonrecognition parameter.
Further; When in confirming said the 2nd TID binary tree, existing nodal value to be the node of inverse symbol, explain that each parameter that the TID field TID fields specify in the said TL1 command format must not occur in the said TL1 order all comprises, in other words; The TID field has been missed some parameter that the TID content provided must occur in the said TL1 command format in the said TL1 order; Therefore, can parameter current be confirmed as and Lou select parameter, preserve as one of illegal reason of TID field of said TL1 order; And confirm that final said TL1 orders when illegal, selects parameter to return to Correspondent Node said leakage.
In the practical implementation; Adopt COMMAND CODE field in the TL1 command format, AID field, GENERAL BLOCK field, the corresponding binary tree of DATA BLOCK field; The method that COMMAND CODE field, AID field, GENERAL BLOCK field, the DATA BLOCK field of TL1 order are carried out verification; The method of the TID field of said TL1 order being carried out verification with above-mentioned use TID binary tree is consistent, repeats no more at this.
Preferably, in the above-mentioned steps 101, confirm corresponding TL1 command format, specifically comprise: the TL1 command format of confirming to have identical COMMAND CODE field contents with said TL1 order according to the COMMAND CODE field of said TL1 order.
Concrete; Since 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; Confirm corresponding TL1 command format according to the COMMAND CODE field of TL1 order among the present invention, be specially and confirm to order TL1 command format, therefore with identical COMMAND CODE field with TL1; Can save in the inventive method and utilize COMMAND CODE binary tree to go the step of the COMMAND CODE field of verification TL1 order; This is because if can find the TL1 command format that has identical COMMAND CODE field with the TL1 order, explains that then the COMMAND CODE field of said TL1 order has met the regulation of the said TL1 command format that finds, and can continue other each several parts of TL1 order are carried out verification; On the contrary; If can not find the TL1 command format that has identical COMMAND CODE field with the TL1 order, explain that then the COMMAND CODE field of said TL1 order does not meet the regulation of any one TL1 command format in the system, promptly said TL1 order is for illegal.
Preferably, the CTAG field contents of said TL1 command format is a numeral, and said CTAG regular expression is ([0-9])
+
Concrete, among the present invention, the CTAG regular expression is the regular expression of the CTAG field that is used for verification TL1 order formulated according to the CTAG field of said TL1 command format in advance; Other each fields in CTAG field and the TL1 order have different characteristics; The CTAG field of regulation TL1 order must be a numeral in the standard telecommunication administration agreement; As import 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 said regular expression is ([0-9])
+This regular expression representes that the CTAG field contents of TL1 order can only be made up of the numeral between 0～9, and the CTAG field can not be sky, promptly is made up of the numeral between 0～9 at least; Otherwise, adopt the result of this regular expression verification CTAG field will be for illegal.
The present invention provides a kind of TL1 command checksum method embodiment:
If TL1 command format is MELT:::CTAG::a| (b [, c, d]) [, h] [, i, j], k; , then each field contents is following in this TL1 order:
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, during b, operation below the TL1 proxy module of lower floor's equipment is carried out:
Step 1, the COMMAND CODE field MELT that orders based on said TL1 finds corresponding TL1 command format, promptly above-mentioned TL1 command format MELT:::CTAG::a|(b[, c, d]) [, h] [and, 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 said TL1 command format; Wherein, TID binary tree, AID binary tree, GENERAL BLOCK binary tree all are empty, and the CTAG regular expression is ([0-9])
+, DATA BLOCK binary tree is as shown in Figure 2;
Step 3 when using said TID binary tree that the TID field of said TL1 order is carried out verification, because the TID field of said TL1 order is empty, has satisfied the requirement of said TID binary tree, and therefore, the TID field of said TL1 order is legal;
Step 4 when using said AID binary tree that the AID field of said TL1 order is carried out verification, because the AID field of said TL1 order is empty, has satisfied the requirement of said AID binary tree, and therefore, the AID field of said TL1 order is legal;
Step 5 is used said CTAG regular expression ([0-9])
+When the CTAG content of said TL1 order was carried out verification, the CTAG field of said TL1 order was 01, uses regular expression ([0-9])
+The result who carries out verification is for legal;
Step 6; Use said GENERAL BLOCK binary tree that the GENERAL BLOCK field of said TL1 order is carried out verification; Because the GENERAL BLOCK field of said TL1 order is empty; Satisfied the requirement of said GENERAL BLOCK binary tree, therefore, the GENERAL BLOCK content legality of said TL1 order;
Step 7 uses said DATA BLOCK binary tree that the DATA BLOCK field of said TL1 order is carried out verification, specifically comprises:
Steps A is obtained all parameters of DATABLOCK field in the said TL1 order, i.e. d, c, k, b,
Step B, to above each parameter, carry out following checking procedure:
With the parameter d is example, reads parameter d, in said DATA BLOCK binary tree as shown in Figure 2, searches the node that node is parameter current d, if find, and execution in step b1 then, otherwise, parameter current is confirmed as the nonrecognition parameter, charge to the nonrecognition parameter set;
Step b1, as shown in Figure 3, the node at deletion parameter current d place from said DATA BLOCK binary tree; Simultaneously, the father node of node from parameter current d place (the figure for nodal value is a comma, node) beginning; Search its father node successively; In this process, if find the nodal value of the current father node that finds be left bracket " [" (like node of dash area among Fig. 3), then the nodal value with current parent's node is revised as comma; " If finding the nodal value of the current father node that finds is infix operator " | ", then the not child node in searching the path (is the node of a like nodal value among Fig. 3) of current parent's node is deleted, till the root node that finds said DATA BLOCK binary tree;
After the intact 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, promptly not have the nonrecognition parameter;
All execute after the above checking procedure to all parameter d, c, k, b, obtain a DATA BLOCK binary tree as shown in Figure 4;
Step C, as shown in Figure 5, delete that all nodal values are that " node of [" and child node thereof obtain the 2nd DATA BLOCK binary tree as shown in Figure 6 to left bracket in the said DATA BLOCK binary tree;
Step D travels through said the 2nd DATA BLOCK binary tree, judges wherein whether the nodal value of all nodes all is operator, is the node of inverse symbol if confirm to exist nodal value, then said inverse symbol is confirmed as and is Lou selected parameter, charges to and Lou selects parameter set; The nodal value that can confirm all nodes in the 2nd DATA BLOCK binary tree as shown in Figure 6 in this process all is an operator; Explain that DATA BLOCK content has comprised all parameters that DATA BLOCK content provided must occur in the said TL1 command format in the said TL1 order, promptly do not leak and select parameter;
Step e; Confirm 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 all is an operator in the 2nd DATA BLOCK binary tree as shown in Figure 6, confirms that then the DATA BLOCK field of said TL1 order is legal;
Step 8, the check results of confirming above-mentioned steps 3～step 7 all is legal, confirms that then said TL1 order is legal.
Accordingly, the present invention also provides a kind of TL1 command checksum device, and is as shown in Figure 7, comprising:
Form determination module 701 after the TL1 order that is used for sending the received communication opposite end, is confirmed corresponding TL1 command format according to the command code COMMAND CODE field of said TL1 order;
Binary tree acquisition module 702; Be used for obtaining the regular expression of said TL1 command format connective marker CTAG field; And in the said TL1 command format except that the CTAG field the corresponding binary tree of each field; Wherein, said except that the CTAG field the corresponding binary tree of each field in advance according to the evaluation of expression method, this field contents is carried out the binary tree structure that computing obtains;
Binary tree verification module 703, be used to use said except that the CTAG field the corresponding binary tree of each field, the content of respective field in the said TL1 order is carried out verification;
Expression formula verification module 704 is used to use said CTAG regular expression, and the content of CTAG field in the said TL1 order is carried out verification;
Determination module 705 as a result, when the result who is used for definite said binary tree verification module and the block check of said expression formula calibration mode is legal, confirm that said TL1 order is legal;
Command execution module 706 is used for confirming said TL1 when said determination module as a result and orders when legal, carries out said TL1 order.
Preferably, said TL1 command checksum device also comprises: failure response module 707, and be used for confirming said TL1 and order when illegal when said determination module as a result, return failure response message to said Correspondent Node.
Preferably; Said TL1 command checksum device also comprises: binary tree computing module 708; Be used for through following mode generate said except that the CTAG field the corresponding binary tree of each field: to said each field; Create an operator stack and a data base respectively, and said operator stack of initialization and data base; According to said each element of each field order from left to right, handle as follows: when confirming that currentElement is parameter, said parameter is pressed in the said data base; When confirming that currentElement is operator,, judge whether the priority of said operator is higher than the stack top element of said operator stack, if then said operator is pressed in the said operator stack, as stack top element according to predetermined operator precedence relation; Otherwise; Make in the said data base successively from stack top two elements of popping; Go out stack element and constitute binary tree by said operator and said two; Said operator goes out two node that stack element is said binary tree, and is pressed into this binary tree in the said data base as stack top element for the father node of this binary tree, said two; Till last element of handling this field, the stack top element of said data base is confirmed as the corresponding binary tree of this field.
Preferably; Said TL1 command checksum device also comprises: symbol processing module 709; Be used for generating at said binary tree computing module 708 said except that the CTAG field before the corresponding binary tree of each field, it is right to confirm to include operator in the said field, and said operator is when first parameter includes first operator before in the content that encapsulates; With said first operator move to said operator to before; Wherein, said operator is to being made up of the first operator and the tail operator that are used to encapsulate one group of optional parameters, and said first operator still has the operator of other parameters for the expression back.
Preferably, said binary tree verification module 703 specifically is used for: resolve said TL1 order, obtain all parameters of respective field in the said TL1 order; Carry out following checking procedure to each parameter: in the binary tree of said correspondence, search the node that nodal value is a parameter current; When confirming to find, the node at deletion parameter current place from the binary tree of said correspondence, simultaneously; The father node of node begins from the parameter current place; Search father node successively, and when the nodal value of confirming the current father node that finds is the right first operator of operator, the nodal value of current parent's node is revised as first operator; When the nodal value of confirming the current father node that finds is second operator; With the deletion of the not child node in searching the path of current parent's node, till the root node of the binary tree that finds said correspondence, wherein said operator is to being made up of the first operator and the tail operator that are used to encapsulate one group of optional parameters; Said first operator still has the operator of other parameters for representing the back, the operator that can only have a side parameter to occur in the parameter of said second operator for its both sides of expression; After all executing above checking procedure to said all parameters, obtain first binary tree; Delete that all nodal values are the node and the child node thereof of the right first operator of said operator in said first binary tree, obtain second binary tree; Whether the nodal value of judging all nodes in said second binary tree all is operator; Confirming in the binary tree of said correspondence, can find nodal value is the node of said each parameter, and when the nodal value of all nodes all is operator in said second binary tree, confirms that the respective field of said TL1 order is legal.
Preferably; Said TL1 command checksum device also comprises: parameter is returned module 710; Be used for: when said binary tree verification module 703 is directed against said each parameter; Confirm in the binary tree of said correspondence, to search when being the node of parameter current, parameter current is confirmed as the nonrecognition parameter less than nodal value; When said binary tree verification module confirms to exist in said second binary tree nodal value to be the node of inverse symbol, said inverse symbol confirmed as Lou select parameter; Confirm that said TL1 orders when illegal, returns said leakage to said Correspondent Node and selects parameter and/or nonrecognition parameter.
Preferably, said form determination module 701 specifically is used for: the TL1 command format of confirming to have with said TL1 order identical COMMAND CODE field contents.
The concrete realization function of each module of the TL1 of institute command checksum device repeats no more at this referring to the concrete implementation procedure of above-mentioned TL1 command checksum method.
Obviously, those skilled in the art can carry out various changes and modification to the present invention and not break away from the spirit and scope of the present invention.Like this, belong within the scope of claim of the present invention and equivalent technologies thereof if of the present invention these are revised with modification, then the present invention also is intended to comprise these changes and modification interior.
Claims (17)
1. a Traditional affair language TL1 command checksum method is characterized in that, comprising:
After the TL1 order that send the received communication opposite end, confirm corresponding TL1 command format according to the command code COMMAND CODE field of said TL1 order;
Obtain the regular expression of connective marker CTAG field in the said TL1 command format; And in the said TL1 command format except that the CTAG field the corresponding binary tree of each field; Wherein, Said except that the CTAG field the corresponding binary tree of each field in advance according to the evaluation of expression method, this field contents is carried out the binary tree structure that computing obtains;
Use said except that the CTAG field the corresponding binary tree of each field, the content of respective field in the said TL1 order is carried out verification;
Use said CTAG regular expression, the content of CTAG field in the said TL1 order is carried out verification;
When the check results of confirming each field in the said TL1 order all is legal, confirm that said TL1 order is legal;
When definite said TL1 orders when legal, carry out said TL1 order.
2. the method for claim 1 is characterized in that, when definite said TL1 orders when illegal, returns failure response message to said Correspondent Node.
3. the method for claim 1 is characterized in that, said except that the CTAG field the corresponding binary tree of each field specifically generate through following mode:
To said each field, create an operator stack and a data base respectively, and said operator stack of initialization and data base;
According to said each element of each field order from left to right, handle as follows: when confirming that currentElement is parameter, said parameter is pressed in the said data base; When confirming that currentElement is operator,, judge whether the priority of said operator is higher than the stack top element of said operator stack, if then said operator is pressed in the said operator stack, as stack top element according to predetermined operator precedence relation; Otherwise; Make in the said data base successively from stack top two elements of popping; Go out stack element and constitute binary tree by said operator and said two; Said operator goes out two node that stack element is said binary tree, and is pressed into this binary tree in the said data base as stack top element for the father node of this binary tree, said two;
Till last element of handling this field, the stack top element of said data base is confirmed as the corresponding binary tree of this field.
4. method as claimed in claim 3 is characterized in that, generates saidly except that the CTAG field, before the corresponding binary tree of each field, also to comprise:
It is right to confirm to include operator in the said field; And said operator is when including first operator before the first parameter in the content of encapsulation; With said first operator move to said operator to before; Wherein, said operator is to being made up of the first operator and the tail operator that are used to encapsulate one group of optional parameters, and said first operator still has the operator of other parameters for the expression back.
5. method as claimed in claim 4 is characterized in that, said operator is to being made up of first operator left side bracket " the right bracket "] of [" and tail operator ", and said first operator is a comma, ".
6. the method for claim 1 is characterized in that, use said except that the CTAG field the corresponding binary tree of each field, the content of respective field in the said TL1 order is carried out verification, specifically comprise:
Resolve said TL1 order, obtain all parameters of respective field in the said TL1 order;
Carry out following checking procedure to each parameter: in the binary tree of said correspondence, search the node that nodal value is a parameter current; When confirming to find, the node at deletion parameter current place from the binary tree of said correspondence, simultaneously; The father node of node begins from the parameter current place; Search father node successively, and when the nodal value of confirming the current father node that finds is the right first operator of operator, the nodal value of current parent's node is revised as first operator; When the nodal value of confirming the current father node that finds is second operator; With the deletion of the not child node in searching the path of current parent's node, till the root node of the binary tree that finds said correspondence, wherein said operator is to being made up of the first operator and the tail operator that are used to encapsulate one group of optional parameters; Said first operator still has the operator of other parameters for representing the back, the operator that can only have a side parameter to occur in the parameter of said second operator for its both sides of expression;
After all executing above checking procedure to said all parameters, obtain first binary tree;
Delete that all nodal values are the node and the child node thereof of the right first operator of said operator in said first binary tree, obtain second binary tree;
Whether the nodal value of judging all nodes in said second binary tree all is operator;
Confirming in the binary tree of said correspondence, can find nodal value is the node of said each parameter, and when the nodal value of all nodes all is operator in said second binary tree, confirms that the respective field of said TL1 order is legal.
7. method as claimed in claim 6 is characterized in that, said operator is to being made up of first operator left side bracket " the right bracket "] of [" and tail operator ", and said first operator is a comma, ", said second operator is an infix operator " | ".
8. method as claimed in claim 6 is characterized in that, also comprises:
To said each parameter, confirm in the binary tree of said correspondence, to search when being the node of parameter current less than nodal value, parameter current is confirmed as the nonrecognition parameter;
When confirming to exist in said second binary tree nodal value to be the node of inverse symbol, said inverse symbol confirmed as Lou select parameter;
Confirm that said TL1 orders when illegal, returns said leakage to said Correspondent Node and selects parameter and/or nonrecognition parameter.
9. like the arbitrary described method of claim 1～8, it is characterized in that, confirm corresponding TL1 command format, specifically comprise according to the COMMAND CODE field of said TL1 order:
Confirm to have the TL1 command format of identical COMMAND CODE field contents with said TL1 order.
10. like the arbitrary described method of claim 1～8, it is characterized in that the CTAG field contents of said TL1 command format is a numeral, said CTAG regular expression is ([0-9])
+
11. a Traditional affair language TL1 command checksum device is characterized in that, comprising:
The form determination module after the TL1 order that is used for sending the received communication opposite end, is confirmed corresponding TL1 command format according to the command code COMMAND CODE field of said TL1 order;
The binary tree acquisition module; Be used for obtaining the regular expression of said TL1 command format connective marker CTAG field; And in the said TL1 command format except that the CTAG field the corresponding binary tree of each field; Wherein, said except that the CTAG field the corresponding binary tree of each field in advance according to the evaluation of expression method, this field contents is carried out the binary tree structure that computing obtains;
Binary tree verification module, be used to use said except that the CTAG field the corresponding binary tree of each field, the content of respective field in the said TL1 order is carried out verification;
Expression formula verification module is used to use said CTAG regular expression, and the content of CTAG field in the said TL1 order is carried out verification;
Determination module when the result who is used for definite said binary tree verification module and the block check of said expression formula calibration mode is legal, confirms that said TL1 order is legal as a result;
Command execution module is used for confirming said TL1 when said determination module as a result and orders when legal, carries out said TL1 order.
12. device as claimed in claim 11 is characterized in that, also comprises:
The failure response module is used for confirming said TL1 when said determination module as a result and orders when illegal, returns failure response message to said Correspondent Node.
13. device as claimed in claim 11 is characterized in that, also comprises: the binary tree computing module, be used for through following mode generate said except that the CTAG field the corresponding binary tree of each field:
To said each field, create an operator stack and a data base respectively, and said operator stack of initialization and data base;
According to said each element of each field order from left to right, handle as follows: when confirming that currentElement is parameter, said parameter is pressed in the said data base; When confirming that currentElement is operator,, judge whether the priority of said operator is higher than the stack top element of said operator stack, if then said operator is pressed in the said operator stack, as stack top element according to predetermined operator precedence relation; Otherwise; Make in the said data base successively from stack top two elements of popping; Go out stack element and constitute binary tree by said operator and said two; Said operator goes out two node that stack element is said binary tree, and is pressed into this binary tree in the said data base as stack top element for the father node of this binary tree, said two;
Till last element of handling this field, the stack top element of said data base is confirmed as the corresponding binary tree of this field.
14. device as claimed in claim 13; It is characterized in that, also comprise: the symbol processing module is used for generating at said binary tree computing module said except that the CTAG field before the binary tree of each field correspondence; It is right to confirm to include operator in the said field; And said operator is when including first operator before the first parameter in the content of encapsulation, with said first operator move to said operator to before, wherein; Said operator is to being made up of the first operator and the tail operator that are used to encapsulate one group of optional parameters, and said first operator still has the operator of other parameters for the expression back.
15. device as claimed in claim 11 is characterized in that, said binary tree verification module specifically is used for:
Resolve said TL1 order, obtain all parameters of respective field in the said TL1 order;
Carry out following checking procedure to each parameter: in the binary tree of said correspondence, search the node that nodal value is a parameter current; When confirming to find, the node at deletion parameter current place from the binary tree of said correspondence, simultaneously; The father node of node begins from the parameter current place; Search father node successively, and when the nodal value of confirming the current father node that finds is the right first operator of operator, the nodal value of current parent's node is revised as first operator; When the nodal value of confirming the current father node that finds is second operator; With the deletion of the not child node in searching the path of current parent's node, till the root node of the binary tree that finds said correspondence, wherein said operator is to being made up of the first operator and the tail operator that are used to encapsulate one group of optional parameters; Said first operator still has the operator of other parameters for representing the back, the operator that can only have a side parameter to occur in the parameter of said second operator for its both sides of expression;
After all executing above checking procedure to said all parameters, obtain first binary tree;
Delete that all nodal values are the node and the child node thereof of the right first operator of said operator in said first binary tree, obtain second binary tree;
Whether the nodal value of judging all nodes in said second binary tree all is operator;
Confirming in the binary tree of said correspondence, can find nodal value is the node of said each parameter, and when the nodal value of all nodes all is operator in said second binary tree, confirms that the respective field of said TL1 order is legal.
16. device as claimed in claim 15 is characterized in that, also comprises: parameter is returned module, is used for:
When said binary tree verification module to said each parameter, confirm in the binary tree of said correspondence, to search when being the node of parameter current less than nodal value, parameter current is confirmed as the nonrecognition parameter;
When said binary tree verification module confirms to exist in said second binary tree nodal value to be the node of inverse symbol, said inverse symbol confirmed as Lou select parameter;
Confirm that said TL1 orders when illegal, returns said leakage to said Correspondent Node and selects parameter and/or nonrecognition parameter.
17., it is characterized in that said form determination module specifically is used for like the arbitrary described device of claim 11～16:
Confirm to have the TL1 command format of identical COMMAND CODE field contents with said TL1 order.
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 true CN102624736A (en) | 2012-08-01 |
| CN102624736B 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) |
Cited By (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 |
| CN110192196A (en) * | 2017-01-25 | 2019-08-30 | 三菱电机株式会社 | Attacks/anomalies detection device, attacks/anomalies detection method and attacks/anomalies detect program |
| CN110618961A (en) * | 2019-08-22 | 2019-12-27 | 苏州浪潮智能科技有限公司 | Method and device for realizing command verification of UBM (universal UBM management module) backplane |
| CN116932305A (en) * | 2023-09-15 | 2023-10-24 | 新华三信息技术有限公司 | Test file generation method and device, electronic equipment and storage medium |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR19990061505A (en) * | 1997-12-31 | 1999-07-26 | 유기범 | How to handle transaction language 1 parsing in Network Management Regional Center |
| 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 |
-
2012
- 2012-03-20 CN CN201210074991.9A patent/CN102624736B/en active Active
Patent Citations (5)
| 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 |
| KR19990061505A (en) * | 1997-12-31 | 1999-07-26 | 유기범 | How to handle transaction language 1 parsing in Network Management Regional Center |
| 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 |
Cited By (7)
| 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 |
| CN110192196A (en) * | 2017-01-25 | 2019-08-30 | 三菱电机株式会社 | Attacks/anomalies detection device, attacks/anomalies detection method and attacks/anomalies detect program |
| US11467565B2 (en) * | 2017-01-25 | 2022-10-11 | Mitsubishi Electric Corporation | Attack/abnormality detection device, attack/abnormality detection method, and attack/abnormality detection program |
| CN110618961A (en) * | 2019-08-22 | 2019-12-27 | 苏州浪潮智能科技有限公司 | Method and device for realizing command verification of UBM (universal UBM management module) backplane |
| CN110618961B (en) * | 2019-08-22 | 2021-04-27 | 苏州浪潮智能科技有限公司 | Method and device for realizing command verification of UBM (universal UBM management module) backplane |
| CN116932305A (en) * | 2023-09-15 | 2023-10-24 | 新华三信息技术有限公司 | Test file generation method and device, electronic equipment and storage medium |
| CN116932305B (en) * | 2023-09-15 | 2023-12-12 | 新华三信息技术有限公司 | Test file generation method and device, electronic equipment and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102624736B (en) | 2014-11-12 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN105303112B (en) | The detection method and device of component call loophole | |
| CN106470415A (en) | Smart card and its Activiation method, Internet of things system, management platform of remotely contracting | |
| CN108197114B (en) | Method and device for detecting table data, storage medium and electronic device | |
| CN108875757B (en) | Information auditing method, server and system | |
| CN103383681B (en) | A kind of file type identification method and system | |
| CN102946415B (en) | A kind of implementation method of mobile terminal this locality application and device | |
| CN104407901B (en) | The adding method and device of code | |
| CN102624736B (en) | TL1 (transaction language 1) command verification method and TL1 command verification device | |
| CN108282377B (en) | Processing method and device for testing logistics service data and server | |
| CN107105428A (en) | The method and device in quick completion end message storehouse | |
| CN105573956A (en) | Serialization method and serialization-based network communication method | |
| CN106105154A (en) | The method of data upload, Apparatus and system | |
| CN107171897A (en) | A kind of interface test method and data-interface test system | |
| CN103902339A (en) | Application installation method, terminal and server | |
| CN103716356A (en) | Storage process operation method, device and system based on Web | |
| CN107797823A (en) | Business Rule Management method, apparatus, storage medium and computer equipment | |
| CN109885744A (en) | Web data crawling method, device, system, computer equipment and storage medium | |
| CN105657677A (en) | Short message sending method, short message gateway and service platform | |
| CN105511935B (en) | The acquisition methods and device of resource index value | |
| CN105487877A (en) | Version updating method, system and base station | |
| CN105072105B (en) | A kind of processing method and processing system of the information flag based on intelligent terminal | |
| CN110489207A (en) | Verification method, apparatus and computer readable storage medium | |
| CN104750468A (en) | Server side topological data conversion method and device | |
| CN108647139B (en) | System test method, device, storage medium and electronic device | |
| CN107368557B (en) | Page editing method and device |
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 |