CN112260851B - Gateway pairing verification method and device - Google Patents
Gateway pairing verification method and device Download PDFInfo
- Publication number
- CN112260851B CN112260851B CN202010967807.8A CN202010967807A CN112260851B CN 112260851 B CN112260851 B CN 112260851B CN 202010967807 A CN202010967807 A CN 202010967807A CN 112260851 B CN112260851 B CN 112260851B
- Authority
- CN
- China
- Prior art keywords
- gateway
- starting
- ending
- gateways
- current
- 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
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/08—Configuration management of networks or network elements
- H04L41/0866—Checking the configuration
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/08—Configuration management of networks or network elements
- H04L41/0803—Configuration setting
- H04L41/0813—Configuration setting characterised by the conditions triggering a change of settings
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/08—Configuration management of networks or network elements
- H04L41/0866—Checking the configuration
- H04L41/0869—Validating the configuration within one network element
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention relates to a gateway pairing verification method and device, belongs to the technical field of flow modeling and operation, and solves the problems that the service logic of configuration personnel is unclear and the approval service is incomplete easily caused by the fact that the existing gateway is unpaired. The method comprises the following steps: acquiring all gateways in the flow chart; determining an ending gateway and a starting gateway from all gateways; judging whether the number of the ending gateways is consistent with the number of the starting gateways; when the number of the ending gateways is consistent with the number of the starting gateways, traversing all incoming lines of each ending gateway in all ending gateways to judge whether each ending gateway has a matched starting gateway or not; and prompting the gateway to check the end gateway in pairs and positioning the end gateway which fails to check when the end gateway does not have the matched start gateway. The paired configuration check is realized, and when the paired check is prompted to fail and the failed end gateway is positioned, a flow configuration personnel is notified to carry out quick modification.
Description
Technical Field
The invention relates to the technical field of flow modeling and operation, in particular to a gateway pairing verification method and device.
Background
A Gateway (Gateway) is used to control the flow direction. The following four gateways can be classified according to different functions: exclusive gateway, parallel gateway, inclusive gateway, and event gateway. However, the gateway of the existing flow has the following problems:
1. the unpaired gateway easily causes unclear service logic of configurators
There are multiple gateway types in the flow modeling, and the flow engine typically does not define the relationship between the start and end gateways, sometimes even without an end gateway. The configuration period is checked in pairs, so that service configuration personnel can be helped to check configuration logic, and configuration errors are reduced.
2. The incomplete operation approval business is easily caused by unpaired gateway
The running period of the gateway is unpaired, which easily causes that the approval of the business matters is finished, the flow is finished, the approval business process is incomplete, such as the parallel start gateway and the single end gateway are connected, the branch approval of the parallel business is not finished, the follow-up flow is finished, and even the whole flow of approval is finished.
Disclosure of Invention
In view of the above analysis, the embodiment of the invention aims to provide a gateway pairing verification method and device, which are used for solving the problems that the existing gateway is not paired and is easy to cause unclear service logic of configurators and incomplete service approval in the operation period.
In one aspect, an embodiment of the present invention provides a gateway pairing verification method, including: acquiring all gateways in the flow chart; determining an ending gateway and a starting gateway from all gateways; judging whether the number of the ending gateways is consistent with the number of the starting gateways; when the number of the ending gateways is consistent with the number of the starting gateways, traversing all incoming lines of each ending gateway in all ending gateways to judge whether each ending gateway has a matched starting gateway or not; and prompting the gateway to pass the paired check when the paired starting gateway does not exist in the ending gateway, and positioning the ending gateway which passes the check.
The beneficial effects of the technical scheme are as follows: the gateway pairing verification method of the embodiment can carry out pairing configuration verification, and can timely inform flow configuration personnel to carry out quick modification according to prompt information when prompting that the gateway pairing verification fails and positioning the ending gateway which fails verification.
Based on a further improvement of the above method, traversing all incoming lines of each of all end gateways to determine whether there is a paired start gateway for each of all end gateways includes: acquiring all incoming lines of a current ending gateway; determining and recording a first starting gateway, wherein the first starting gateway is the latest starting gateway which is found forward from one incoming line of the current ending gateway; determining a second starting gateway on one of the remaining incoming lines of the current ending gateway; comparing the first starting gateway with the second starting gateway, and determining whether the first starting gateway is consistent with the second starting gateway.
Based on the further improvement of the method, the gateway pairing verification method further comprises the following steps: when the first starting gateway is consistent with the second starting gateway, continuing to traverse whether the starting gateways on other residual incoming lines of the current ending gateway are consistent with the first starting gateway; traversing all incoming lines of the current ending gateway, and judging whether the number of the incoming lines of the current ending gateway is consistent with the number of the outgoing lines of the first starting gateway; and if the number of incoming lines of the current ending gateway is consistent with the number of outgoing lines of the first starting gateway, the current ending gateway and the first starting gateway are paired gateways.
Based on a further improvement of the above method, when another end gateway is found forward according to the current incoming line of the current end gateway, a start gateway paired with the other end gateway is determined by the same method as the current end gateway.
Based on a further improvement of the above method, the further end gateway and the start gateway paired therewith are internal atomic level paired gateways.
Based on a further improvement of the method, in the case that n internal atom-level paired gateways exist, n is greater than or equal to 2, each atom-level paired gateway is determined by adopting the same method as the current ending gateway.
Based on the further improvement of the method, when the first starting gateway is inconsistent with the second starting gateway or when the incoming line number of the current ending gateway is inconsistent with the outgoing line number of the first starting gateway, the current ending gateway is prompted that no paired starting gateway exists.
Based on a further improvement of the above method, determining an end gateway and a start gateway from among the all gateways comprises: and selecting one gateway from all the gateways, and judging whether the gateway selected arbitrarily is an ending gateway or a starting gateway.
Based on a further improvement of the above method, the step of determining whether the arbitrarily selected gateway is an ending gateway or a starting gateway includes: when the incoming line of the arbitrarily selected gateway is one or no incoming line and the outgoing lines are a plurality of outgoing lines, the arbitrarily selected gateway is a starting gateway; and when the incoming lines of the arbitrarily selected gateway are multiple and the outgoing lines are one or no outgoing lines, the arbitrarily selected gateway is an ending gateway.
On the other hand, the embodiment of the invention provides a gateway pairing verification device, which comprises: the gateway acquisition module is used for acquiring all the gateways of the flow chart; the gateway determining module is used for determining an ending gateway and a starting gateway from all the gateways; the first judging module is used for judging whether the number of the ending gateways is consistent with the number of the starting gateways; the second judging module is used for traversing all incoming lines of each ending gateway in all ending gateways when the number of the ending gateways is consistent with the number of the starting gateways so as to judge whether each ending gateway in all ending gateways has a matched starting gateway or not; and the prompting module is used for prompting the gateway to pass the pairing check and positioning the ending gateway which fails the check when the ending gateway does not have the paired starting gateway.
Compared with the prior art, the invention has at least one of the following beneficial effects:
1. the gateway pairing verification method of the embodiment can carry out pairing configuration verification, and can timely inform flow configuration personnel to carry out quick modification according to prompt information when prompting that the gateway pairing verification fails and positioning the ending gateway which fails verification.
2. And in the modeling period, the gateway is identified to be correctly nested, and the multi-layer gateway configured in the flow model is subjected to paired configuration verification.
3. And ensuring the integrity of the business approval in the running period to avoid the defect that the parallel business branch approval is not finished and the subsequent flow is finished.
In the invention, the technical schemes can be mutually combined to realize more preferable combination schemes. Additional features and advantages of the invention will be set forth in the description which follows, and in part will be obvious from the description, or may be learned by practice of the invention. The objectives and other advantages of the invention may be realized and attained by the structure particularly pointed out in the written description and drawings.
Drawings
The drawings are only for purposes of illustrating particular embodiments and are not to be construed as limiting the invention, like reference numerals being used to refer to like parts throughout the several views.
Fig. 1 is a simplified flow chart of a gateway pairing check method according to an embodiment of the invention.
Fig. 2 is a flowchart of a gateway pairing check method according to an embodiment of the invention.
Fig. 3 is a schematic diagram of a flow model of an atomic pair gateway.
Fig. 4 is a schematic diagram of a complex scene gateway paired flow model.
Fig. 5 is a flowchart of a gateway pairing check method according to an embodiment of the invention.
Detailed Description
Preferred embodiments of the present invention will now be described in detail with reference to the accompanying drawings, which form a part hereof, and together with the description serve to explain the principles of the invention, and are not intended to limit the scope of the invention.
In one embodiment of the present invention, a gateway pairing verification method is disclosed, as shown in fig. 1. The gateway pairing verification method comprises the following steps: step S102, all gateways in the flow chart are obtained; step S104, determining an ending gateway and a starting gateway from all gateways; step S106, judging whether the number of the ending gateways is consistent with the number of the starting gateways; step S108, when the number of the ending gateways is consistent with the number of the starting gateways, traversing all incoming lines of each ending gateway in all ending gateways to judge whether each ending gateway in all ending gateways has a matched starting gateway or not; and step S110, when all the end gateways have the end gateway and the matched start gateway does not exist, prompting the gateway to pass the paired check and positioning the end gateway which does not pass the check.
Compared with the prior art, the gateway pairing verification method provided by the embodiment can perform pairing configuration verification, and can timely inform flow configuration personnel to quickly modify according to prompt information when prompting that the gateway pairing verification fails and positioning the gateway which fails to pass the verification.
Hereinafter, a gateway pairing check method will be described in detail with reference to fig. 1, 3 and 4.
Referring to fig. 1, the gateway pairing check method includes: step S102, all gateways in the flow chart are acquired. For example, referring to fig. 3, all gateways include a start gateway and an end gateway, where the start gateway and the end gateway are both single gateways. Referring to fig. 4, all gateways include a single start gateway, a single end gateway, a parallel start gateway, and a parallel end gateway.
Step S104, determining an ending gateway and a starting gateway from all gateways. Determining an end gateway and a start gateway from all gateways includes: and selecting one gateway from all the gateways, and judging whether the gateway selected arbitrarily is an ending gateway or a starting gateway. Specifically, when the incoming line of the arbitrarily selected gateway is one or no incoming line and the outgoing line is a plurality of outgoing lines, the arbitrarily selected gateway is the start gateway. When the incoming lines of the arbitrarily selected gateway are multiple and the outgoing lines are one or no outgoing lines, the arbitrarily selected gateway is an ending gateway. Referring to fig. 3, a single start gateway has 3 outgoing lines without incoming lines, and a single end gateway has 3 incoming lines without outgoing lines. Referring to fig. 4, a single start gateway has one incoming line and 3 outgoing lines, and a single end gateway has 3 incoming lines and one outgoing line; and the parallel start gateway has no incoming line and 3 outgoing lines, and the parallel end gateway has 3 incoming lines and no outgoing lines.
Step S106, judging whether the number of the ending gateways is consistent with the number of the starting gateways. When the number of the end gateways is inconsistent with the number of the start gateways, unpaired start gateways or end gateways exist, so that the gateway pairing check method is directly stopped or exited, and the gateway pairing check is prompted to be failed.
Step S108, when the number of the ending gateways is consistent with the number of the starting gateways, traversing all incoming lines of each ending gateway in all ending gateways to judge whether each ending gateway in all ending gateways has a matched starting gateway. Hereinafter, step S108 will be described in detail with reference to fig. 2 and 5.
Referring to fig. 2, the method comprises the steps of: traversing all ending gateways and obtaining all incoming lines of the current ending gateway. And determining and recording a first starting gateway, wherein the first starting gateway is the latest starting gateway which is found forward from one incoming line of the current ending gateway. For example, a temporary variable is set by which the first start gateway is saved or recorded. For example, referring to fig. 4, in the case where the current end gateway is a parallel end gateway, when a single start gateway, a parallel start gateway, and a parallel start gateway can be found according to the first incoming line, the second incoming line, and the third incoming line, respectively, the temporary variable stores the latest parallel start gateway found forward according to the incoming line of the current end gateway as the first start gateway. And determining a second starting gateway on one of the remaining incoming lines of the current ending gateway. For example, the remaining incoming lines of the current end gateway are traversed with a loop step (e.g., the remaining incoming lines in fig. 4 include a first incoming line and a second incoming line, or include a first incoming line and a third incoming line): and finding a second starting gateway according to the current incoming line of the current ending gateway. The first starting gateway and the second starting gateway determine whether the first starting gateway is consistent with the second starting gateway. Specifically, the first start gateway and the second start gateway stored in the temporary variable are compared, and it is determined whether the first start gateway and the second start gateway are identical. In addition, when the first starting gateway is consistent with the second starting gateway, continuing to traverse whether the starting gateway on other residual incoming lines of the current ending gateway is consistent with the first starting gateway; traversing all incoming lines of the current ending gateway, and judging whether the number of the incoming lines of the current ending gateway is consistent with the number of the outgoing lines of the first starting gateway; and if the number of incoming lines of the current ending gateway is consistent with the number of outgoing lines of the first starting gateway, the current ending gateway and the first starting gateway are paired gateways. Specifically, when the first starting gateway is consistent with the second starting gateway, the circulation step is continued until all incoming lines of the current ending gateway are traversed, and the circulation step is exited. And then judging whether the number of incoming lines of the current ending gateway is consistent with the number of outgoing lines of the first starting gateway. In the judging step, the number of incoming lines of the current ending gateway is determined to be consistent with the number of outgoing lines of the stored first starting gateway or the second starting gateway which is found later, and the current ending gateway and the stored first starting gateway or the second starting gateway which is found later are paired gateways.
A gateway pair-wise verification method of the flow model of the complex scene gateway will be described in detail with reference to fig. 4 and 5. The flow model of the complex scene gateway may have 1 or n internal atomic level paired gateways. In the case of 1 internal atomic level paired gateway, when another end gateway is found forward according to the current incoming line of the current end gateway, a start gateway paired with the other end gateway is determined by the same method as the current end gateway. Specifically, traversing the remaining incoming lines of the current end gateway using the looping step further includes: when the other ending gateway is found forward according to the current incoming line of the current ending gateway, the nearest third starting gateway is found forward recursively from the other ending gateway, wherein the other ending gateway and the third starting gateway are internal atomic-level paired gateways, and the internal atomic-level paired gateways are regarded as a straight line. After determining the internal atomic pair gateway, a current active pointer is directed to the third starting gateway so that starting from the third starting gateway the second starting gateway can continue to be found forward again.
With continued reference to fig. 5, in the case where there are n internal atomic level paired gateways, where n is greater than or equal to 2, each atomic level paired gateway is determined using the same method as the current ending gateway. Specifically, traversing the remaining incoming lines of the current end gateway using the looping step further includes: when the other ending gateway is found forward according to the current incoming line of the current ending gateway, recursively finding the nearest third starting gateway forward from the other ending gateway, namely, finding an internal atomic pair gateway consisting of the other ending gateway and the third starting gateway; continuing recursively and forwardly finding n-1 internal atomic-level paired gateways, so that the n internal atomic-level paired gateways are regarded as a straight line; the current active pointer is directed to the starting gateway of the nth internal atomic level pair gateway so as to start from the starting gateway of the nth internal atomic level pair gateway to find the second starting gateway forward again by using the loop step. When the first starting gateway is inconsistent with the second starting gateway or when the number of incoming lines of the current ending gateway is inconsistent with the number of outgoing lines of the first starting gateway, the current active pointer returns to the current ending gateway, and the current ending gateway is prompted that no paired starting gateway exists.
Referring to fig. 1 again, the gateway pairing verification method further includes step S110, when there is a starting gateway for which there is no pairing in all the ending gateways, prompting the gateway to check in pairing to fail, and locating the ending gateway that fails to check.
The embodiment of the invention defines the gateway pairing judgment rule, performs gateway pairing verification during flow verification or release, and gives corresponding prompts when the gateway pairing verification does not pass. Specifically, the gateway pairing judgment rule includes: 1. all the starting gateways and ending gateways of the whole flow chart are consistent in number; 2. an ending gateway always finds a nearest starting gateway consistent with the type forward; 3. and each incoming line of the ending gateway is forwarded to find the same starting gateway; and 4, the outgoing lines of the starting gateway are consistent with the incoming lines of the ending gateway.
The gateway pairing verification method provided by the embodiment of the invention can realize pairing verification, and the modeling period ensures the pairing correctness of the gateway:
1. determining gateway paired service judgment rules:
all outgoing lines of one starting gateway of the same type are finally converged to one ending gateway of the same type.
2. And after the gateway multi-layer nesting is identified through an intelligent algorithm and a gateway token strategy, the gateway performs paired verification, so that a flow model with successful configuration verification is ensured to accord with the service rule.
3. Providing accurate positioning cues
Gateway verification is not passed, a popup window is arranged below the flow chart to prompt, and a prompt line record is clicked to rapidly locate the gateway which is not passed by verification, so that the checking by configuration personnel is facilitated.
In fig. 3, the gateways are of the same type and are all single gateways. The number of types is consistent, and each of the start and the end is only one. All three incoming lines of the ending gateway are found forward to the same single starting gateway. The number of the three outgoing lines of the single starting gateway is consistent with the number of the three incoming lines of the ending gateway.
The gateway pairing check method is described by way of specific example with reference to fig. 5.
The core algorithm is recursion backtracking, when the latest starting gateway is found from the ending gateway, the ending gateway is encountered, the recursion algorithm is the algorithm of atomic-level paired gateways, and backtracking is that the starting gateway found by each incoming line must be consistent when all incoming lines of the ending gateway are circulated, so that backtracking comparison is carried out, and the following is a specific pseudo code
Private returns to start gateway recursion method (incoming end gateway) {
1. Obtaining all incoming lines of ending gateway
2. Setting temporary variable temp for holding the latest start gateway found forward for each connection
3. Circulation of all incoming lines
4. Circulating internal connection forward finding starting gateway
1) After finding the ending gateway, recursively finding the nearest starting gateway, pointing the forward-found active pointer to the starting gateway (i.e. the internal atomic-level paired gateway is regarded as a straight line), and then continuing to find the starting gateway forward with the starting gateway (backtracking).
2) If the temp has a value, comparing whether the starting gateway is consistent with the temp (backtracking), if not, directly exiting, and continuing to circulate in a consistent manner.
5. And comparing whether the number of the found outgoing lines of the starting gateway is consistent with that of the incoming lines of the ending gateway, returning to the starting gateway if the number of the outgoing lines of the starting gateway is consistent with that of the incoming lines of the ending gateway, and returning to the null if the number of the outgoing lines of the starting gateway is inconsistent with that of the incoming lines of the ending gateway.
Another embodiment of the present invention discloses a gateway pairing verification device, including: the gateway acquisition module is used for acquiring all the gateways of the flow chart; the gateway determining module is used for determining an ending gateway and a starting gateway from all the gateways; the first judging module is used for judging whether the number of the ending gateways is consistent with the number of the starting gateways; the second judging module is used for traversing all incoming lines of each ending gateway in all ending gateways when the number of the ending gateways is consistent with the number of the starting gateways so as to judge whether each ending gateway in all ending gateways has a matched starting gateway or not; and the prompting module is used for prompting the gateway to check the end gateway which fails to pass the pairing check and positioning the end gateway which fails to pass the check when the end gateway does not have the paired start gateway.
The gateway pairing check device further comprises a plurality of other modules, and since the gateway pairing check device corresponds to the gateway pairing check method, the plurality of other modules are not described in detail to avoid redundant description.
Compared with the prior art, the invention has at least one of the following beneficial effects:
1. the gateway pairing verification method of the embodiment can carry out pairing configuration verification, and can timely inform flow configuration personnel to carry out quick modification according to prompt information when prompting that the gateway pairing verification fails and positioning the ending gateway which fails verification.
2. And in the modeling period, the gateway is identified to be correctly nested, and the multi-layer gateway configured in the flow model is subjected to paired configuration verification.
3. And ensuring the integrity of the business approval in the running period to avoid the defect that the parallel business branch approval is not finished and the subsequent flow is finished.
Those skilled in the art will appreciate that all or part of the flow of the methods of the embodiments described above may be accomplished by way of a computer program to instruct associated hardware, where the program may be stored on a computer readable storage medium. Wherein the computer readable storage medium is a magnetic disk, an optical disk, a read-only memory or a random access memory, etc.
The present invention is not limited to the above-mentioned embodiments, and any changes or substitutions that can be easily understood by those skilled in the art within the technical scope of the present invention are intended to be included in the scope of the present invention.
Claims (9)
1. A gateway pairing verification method, comprising:
acquiring all gateways in the flow chart;
determining an ending gateway and a starting gateway from all gateways;
judging whether the number of the ending gateways is consistent with the number of the starting gateways;
when the number of the ending gateways is consistent with the number of the starting gateways, traversing all incoming lines of each ending gateway in all ending gateways to judge whether each ending gateway has a matched starting gateway or not; and
when there is no paired starting gateway in the ending gateways, prompting the gateway to check the pairing failing and positioning the ending gateways which do not pass the checking, wherein traversing all incoming lines of each ending gateway in all ending gateways to judge whether the paired starting gateway exists in each ending gateway in all ending gateways comprises: acquiring all incoming lines of a current ending gateway; determining and recording a first starting gateway, wherein the first starting gateway is the latest starting gateway which is found forward from one incoming line of the current ending gateway; determining a second starting gateway on one of the remaining incoming lines of the current ending gateway; comparing the first starting gateway with the second starting gateway, and determining whether the first starting gateway is consistent with the second starting gateway.
2. The gateway pairing verification method according to claim 1, further comprising:
when the first starting gateway is consistent with the second starting gateway, continuing to traverse whether the starting gateways on other residual incoming lines of the current ending gateway are consistent with the first starting gateway;
traversing all incoming lines of the current ending gateway, and judging whether the number of the incoming lines of the current ending gateway is consistent with the number of the outgoing lines of the first starting gateway; and
and if the number of incoming lines of the current ending gateway is consistent with the number of outgoing lines of the first starting gateway, the current ending gateway and the first starting gateway are paired gateways.
3. The gateway pairwise calibration method of claim 1, wherein,
and when the other end gateway is found forward according to the current incoming line of the current end gateway, determining a starting gateway paired with the other end gateway by adopting the same method as the current end gateway.
4. The gateway pairwise calibration method of claim 3, wherein,
the other end gateway and the start gateway paired therewith are internal atomic pair gateways.
5. The gateway pairing verification method according to claim 4, wherein in the case where there are n internal atomic-level paired gateways, where n is 2 or more,
and determining each atomic-level paired gateway by adopting the same method as the current ending gateway.
6. The gateway pairwise calibration method of claim 2, wherein,
and when the first starting gateway is inconsistent with the second starting gateway or the incoming line number of the current ending gateway is inconsistent with the outgoing line number of the first starting gateway, prompting that no paired starting gateway exists in the current ending gateway.
7. The gateway pairing verification method according to claim 1, wherein determining an end gateway and a start gateway from among the all gateways comprises: and selecting one gateway from all the gateways, and judging whether the gateway selected arbitrarily is an ending gateway or a starting gateway.
8. The gateway pairing check method according to claim 7, wherein the step of determining whether the arbitrarily selected gateway is an ending gateway or a starting gateway includes:
when the incoming line of the arbitrarily selected gateway is one or no incoming line and the outgoing lines are a plurality of outgoing lines, the arbitrarily selected gateway is a starting gateway;
and when the incoming lines of the arbitrarily selected gateway are multiple and the outgoing lines are one or no outgoing lines, the arbitrarily selected gateway is an ending gateway.
9. A gateway pairing verification device, comprising:
the gateway acquisition module is used for acquiring all the gateways of the flow chart;
the gateway determining module is used for determining an ending gateway and a starting gateway from all the gateways;
the first judging module is used for judging whether the number of the ending gateways is consistent with the number of the starting gateways;
the second judging module is used for traversing all incoming lines of each ending gateway in all ending gateways when the number of the ending gateways is consistent with the number of the starting gateways so as to judge whether each ending gateway in all ending gateways has a matched starting gateway or not; and
the prompting module is used for prompting the gateway to pass the pairing check and positioning the end gateway which does not pass the check when the end gateway does not have the paired start gateway, wherein the second judging module is also used for acquiring all incoming lines of the current end gateway; determining and recording a first starting gateway, wherein the first starting gateway is the latest starting gateway which is found forward from one incoming line of the current ending gateway; determining a second starting gateway on one of the remaining incoming lines of the current ending gateway; comparing the first starting gateway with the second starting gateway, and determining whether the first starting gateway is consistent with the second starting gateway.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010967807.8A CN112260851B (en) | 2020-09-15 | 2020-09-15 | Gateway pairing verification method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010967807.8A CN112260851B (en) | 2020-09-15 | 2020-09-15 | Gateway pairing verification method and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN112260851A CN112260851A (en) | 2021-01-22 |
| CN112260851B true CN112260851B (en) | 2023-05-09 |
Family
ID=74231300
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010967807.8A Active CN112260851B (en) | 2020-09-15 | 2020-09-15 | Gateway pairing verification method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112260851B (en) |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101169845A (en) * | 2007-12-04 | 2008-04-30 | 金蝶软件（中国）有限公司 | Work flow model calibration method and device |
| CN102316006A (en) * | 2010-07-05 | 2012-01-11 | 杭州华三通信技术有限公司 | Method and device for sending data message |
| CN105930105A (en) * | 2016-05-20 | 2016-09-07 | 中国农业银行股份有限公司 | Node detection method and device for parallel gateway |
| CN106203851A (en) * | 2016-07-15 | 2016-12-07 | 云南大学 | A kind of control stream consistency detecting method towards BPMN2.0 formatting model and device |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20150003240A1 (en) * | 2006-02-21 | 2015-01-01 | Rockstar Consortium Us Lp | Adaptive call routing in ip networks |
| US9820316B2 (en) * | 2013-03-15 | 2017-11-14 | Aerohive Networks, Inc. | Preventing asymmetric routing using network tunneling |
-
2020
- 2020-09-15 CN CN202010967807.8A patent/CN112260851B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101169845A (en) * | 2007-12-04 | 2008-04-30 | 金蝶软件（中国）有限公司 | Work flow model calibration method and device |
| CN102316006A (en) * | 2010-07-05 | 2012-01-11 | 杭州华三通信技术有限公司 | Method and device for sending data message |
| CN105930105A (en) * | 2016-05-20 | 2016-09-07 | 中国农业银行股份有限公司 | Node detection method and device for parallel gateway |
| CN106203851A (en) * | 2016-07-15 | 2016-12-07 | 云南大学 | A kind of control stream consistency detecting method towards BPMN2.0 formatting model and device |
Also Published As
| Publication number | Publication date |
|---|---|
| CN112260851A (en) | 2021-01-22 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| WO2019109915A1 (en) | Vehicle trouble diagnosis method, vehicle trouble diagnosis apparatus and electronic device | |
| US8605527B2 (en) | Mechanisms for built-in self test and repair for memory devices | |
| US8056059B2 (en) | Using cross-entropy to test executable logic code | |
| CN103744745B (en) | A kind of detection method, equipment and the distributed memory system of data storage | |
| CN102981947B (en) | Data preparation method in test and system provided with the same | |
| CN110008129B (en) | Reliability test method, device and equipment for storage timing snapshot | |
| CN108804326B (en) | Automatic software code detection method | |
| CN103345439A (en) | Method and device for monitoring health states of full links in information system | |
| CN116089260A (en) | SQL sentence detection method and device | |
| CN112260851B (en) | Gateway pairing verification method and device | |
| CN112260885B (en) | Industrial control protocol automatic test method, system, device and readable storage medium | |
| US7007211B1 (en) | Testing self-repairing memory of a device | |
| CN110706108B (en) | Method and apparatus for concurrently executing transactions in a blockchain | |
| CN117373525A (en) | ECC function test method and device, electronic equipment and storage medium | |
| CN115328814B (en) | Fault injection method, device, equipment and storage medium based on mirror pair | |
| CN101271419B (en) | Random storage failure detecting and processing method, device and system | |
| CN113704026B (en) | Distributed financial memory database security synchronization method, device and medium | |
| CN111858361B (en) | Atomic violation defect detection method based on prediction and parallel verification strategy | |
| CN110879883B (en) | Software defect repair authorization method and device, computer equipment and storage medium | |
| JP2002536777A (en) | Method for testing function of memory cell of integrated semiconductor memory | |
| CN113360389A (en) | Performance test method, device, equipment and storage medium | |
| CN106250193A (en) | A kind of system start method based on nand memory and system | |
| US20240086303A1 (en) | Formal Verification of a Program of a Control Device | |
| CN106933888A (en) | Database configuration management system | |
| CN111782141A (en) | Data inspection method and device |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |