Micro-difference delay network connection relationship automatic verification method based on topology analysis

Abstract

This invention discloses an automatic verification method for connectivity relationships in low-delay networks based on topology analysis, belonging to the field of industrial communication network verification technology. Addressing the problem in networks with a unified time base and constrained by a periodic transmission mechanism, where multiple target branches share uplink transmission resources after a preset branch point, continuous time difference results are difficult to stably map to branch connectivity conclusions. The method first groups and sorts the target branches and their return paths, identifying sensitive tail branches and preceding branches to form a boundary compression control basis. Then, it loads additional transmission occupancy, limited by boundary constraints, onto the verification messages corresponding to the preceding branches, compressing the sensitive tail branches to near the transmission period boundary. Finally, it outputs the connectivity verification result based on whether the transmission period boundary is crossed. This method can transform structural differences that are not easily manifested into discrete discriminative states, improving the consistency and interpretability of the verification results.

Description

Technical Field

[0001] This invention relates to the field of industrial communication network verification technology, and more specifically, to an automatic verification method for micro-delay network connectivity based on topology analysis. Background Technology

[0002] Industrial communication network verification technology is commonly used in scenarios involving network transmission with a unified time base and constrained by a periodic transmission mechanism. In this scenario, the master control side typically needs to send time-sensitive messages to multiple target nodes via preset branch points in the designed topology, and monitor whether the target branches after the preset branch points still form the correct separation and connection relationship according to the designed topology. Existing technologies usually obtain target path information, send probe messages or verification messages, collect the arrival time or return completion time of each target path, and perform post-event comparison of the time difference results between different target paths to determine whether there are any anomalies in the relevant paths. For cases where the path differences are significant or the degree of anomaly is large, existing methods can usually obtain comparable time difference results and perform basic anomaly identification based on this.

[0003] The existing technology has the following shortcomings:

[0004] On the one hand, when multiple target branches share the front-end path and only form separate paths after a preset branch point, if the transmission of the probe message itself occupies a small amount of space, both correct structure and slight structural anomalies may cause the relevant backhauls to still fall within the same transmission cycle. In this case, although the time difference result will change, this change may originate from structural offsets after the preset branch point, or from operational factors such as transmission cycle switching, changes in transmission cycle boundary protection margin, or jitter in backhaul result acquisition. It is difficult to directly correlate this to whether the branch connection relationship after the preset branch point still holds true according to the designed topology. As a result, existing methods lack a discriminant criterion to distinguish between structural differences and operational disturbance stability, making it difficult to output stable connection relationship verification conclusions.

[0005] On the other hand, the output of existing methods mainly reflects continuous numerical time difference differences, which usually rely on design reference values ​​or empirical ranges for comparison and judgment, lacking discrete result exits established around the transmission cycle boundaries. Therefore, even if micro-hour time differences have been measured, it is still easy to encounter mapping breakpoints that directly infer connection relationship conclusions from continuous time difference results, making it difficult to stably converge the branch structure differences that are not easily manifested after the preset branch points into automatic verification results oriented towards connection relationships.

[0006] To overcome the aforementioned deficiencies of the prior art, embodiments of the present invention provide an automatic verification method for the connection relationship of micro-delay networks based on topology analysis, in order to solve the problems mentioned in the background art. Summary of the Invention

[0007] To achieve the above objectives, the present invention provides the following technical solution:

[0008] An automatic verification method for connectivity relationships in low-difference delay networks based on topology analysis includes:

[0009] S101, extract the target branches and their backhaul paths leading to each target node after the preset branch point; group them according to the uplink transmission resources occupied by each target branch above the preset branch point to form a co-transmission branch group; within each co-transmission branch group, sort the target branches from front to back according to the corresponding backhaul completion time under the predetermined topology connection relationship, and identify one or more target branches at the end of the sorting whose time distance between the corresponding backhaul completion time and the transmission cycle boundary is less than or equal to the tail sensitive determination time as sensitive tail branches; identify the target branches located before the sensitive tail branches and whose transmission occupancy can be passed to the sensitive tail branches along the same serial uplink transmission queue as preceding branches.

[0010] S102, based on the queuing and transmission distance from the preceding branch to the corresponding sensitive tail branch and the basic transmission occupancy of the corresponding verification message of the preceding branch, determine the additional transmission occupancy of the verification message of the preceding branch; according to the time distance between each sensitive tail branch and the transmission cycle boundary, load the additional transmission occupancy of the corresponding verification message of the preceding branch in sequence, and limit the additional transmission occupancy according to the boundary constraints of the affected sensitive tail branches, so that the newly added transmission occupancy of the preceding branch is accumulated and transmitted backward along the same serial uplink transmission queue and the sensitive tail branch is compressed to the vicinity of the transmission cycle boundary;

[0011] S103, collect the actual feedback results of each target branch, and for each co-transmission branch group, determine whether there is one or more target branches in the sensitive tail branch that cross the transmission cycle boundary before the other target branches in the co-transmission branch group; when any co-transmission branch group has the target branch, output the branch structure abnormal conclusion corresponding to the preset branch point; when none of the co-transmission branch groups have the target branch, output the preset branch point consistent conclusion.

[0012] In a preferred embodiment, the condition for a target branch to be included in the same transmission branch group is that each target branch occupies the same uplink transmission resource during the uplink backhaul process and enters the same serial uplink transmission queue above the preset branch point.

[0013] In a preferred embodiment, within each co-transmission branch group, after sorting the corresponding return completion times of each target branch according to the predetermined topology connection relationship from front to back, the target branch at the end of the sort that has a time distance between its corresponding return completion time and the transmission cycle boundary that is less than or equal to the tail sensitivity determination time is identified as a sensitive tail branch, and the target branch located before the sensitive tail branch that can be transmitted along the same serial uplink transmission queue to the sensitive tail branch is identified as the preceding branch. The tail sensitivity determination time is determined based on the distribution of the design state return completion times and the transmission cycle boundary protection margin within the co-transmission branch group.

[0014] In a preferred embodiment, the queuing transmission distance from the preceding branch to the sensitive tail branch is determined according to the order difference in the design state return transmission completion sequence within the same branch group.

[0015] In a preferred embodiment, the additional sending occupancy of the verification message corresponding to the preceding branch is determined based on the queuing distance and the basic sending occupancy, and the shorter the queuing distance, the larger the additional sending occupancy; the larger the basic sending occupancy, the larger the additional sending occupancy.

[0016] In a preferred embodiment, before loading additional sending space for the verification message corresponding to the preceding branch, an upper bound limit is applied to the additional sending space based on the minimum value of the allowable space to continue loading, obtained by subtracting the safety margin threshold from the current remaining boundary margin of each of the sensitive tail branches covered by the preceding branch, so as to obtain the actual loaded additional sending space.

[0017] In a preferred embodiment, when loading additional sending space for the verification message corresponding to the preceding branch, in each loading round, the sensitive tail branch with the smallest time distance from the sending cycle boundary is first selected as the current target sensitive tail branch, and then the preceding branch with the shortest queuing distance is selected from the preceding branches covering the current target sensitive tail branch as the current execution preceding branch; when there are multiple preceding branches with the same queuing distance, the preceding branch with the largest basic sending space is selected as the current execution preceding branch.

[0018] In a preferred embodiment, after each loading round is completed, the current remaining boundary margin of the affected sensitive tail branch is recalculated, wherein the current remaining boundary margin is the time distance between the corresponding backhaul completion time of the sensitive tail branch after loading and the sending cycle boundary; when the current remaining boundary margin of the current target sensitive tail branch is greater than the safety margin threshold and less than or equal to the preset observation threshold, and the current remaining boundary margin of the affected sensitive tail branches covered by the currently executed preceding branch is greater than or equal to the safety margin threshold, the loading of additional sending occupancy is stopped.

[0019] In a preferred embodiment, when it is determined that the target branch crosses the transmission cycle boundary, the boundary tolerance is determined based on the clock synchronization error and jitter of the backhaul result acquisition under a unified time reference; when the backhaul result corresponding to the sensitive tail branch exceeds the transmission cycle boundary and exceeds the boundary tolerance, it is determined to have crossed the transmission cycle boundary.

[0020] In a preferred embodiment, the safety margin threshold is determined based on the distribution of the design state backhaul completion time within the same transmission branch group, the transmission cycle boundary protection margin, and the jitter range of the backhaul result under a unified time reference; the preset observation threshold is determined based on the preset proportional relationship between the safety margin threshold and the tail sensitivity determination time, and is greater than the safety margin threshold and less than or equal to the tail sensitivity determination time.

[0021] The effects and advantages of the automatic verification method for micro-delay network connectivity based on topology analysis in this invention are as follows:

[0022] This invention provides an automatic verification method for micro-delay network connections based on topology analysis. Under the constraints of a periodic transmission mechanism and shared uplink transmission resources, by constructing boundary squeezing conditions, the previously subtle differences in branch structures after a preset branch point are transformed into discrete discrimination states of whether or not the transmission period boundary is crossed. This transforms connection verification from continuous time-difference comparison to explicit discrimination based on the designed topology. Based on this approach, the interference of structural offsets and operational fluctuations on the verification results can be reduced, and the mapping breakpoints caused by directly inferring connection relationships from continuous time-difference results can be decreased, thereby improving the consistency and interpretability of the automatic verification results for branch connection relationships. Attached Figure Description

[0023] Figure 1 This is a schematic diagram of the method flow of the present invention;

[0024] Figure 2 A schematic diagram for identifying homogeneous branch groups and screening sensitive tail branches;

[0025] Figure 3 A schematic diagram comparing the verification results of the connection relationship after boundary extrusion loading. Detailed Implementation

[0026] The technical solutions of the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only some embodiments of the present invention, and not all embodiments. Based on the embodiments of the present invention, all other embodiments obtained by those skilled in the art without creative effort are within the scope of protection of the present invention.

[0027] This invention provides an automatic verification method for connectivity relationships in low-delay networks based on topology analysis. It is applicable to low-delay networks with a unified time base and constrained by a periodic transmission mechanism. In transmission scenarios where multiple target branches share uplink transmission resources after a preset branch point, the method automatically verifies the separation connectivity relationships of each target branch. For such networks, whether the target branches still form the correct separation connectivity relationships according to the designed topology after the preset branch point directly affects the relative timing of message reception by different target nodes. Therefore, it is necessary to perform stability verification of the connectivity relationships after the preset branch point.

[0028] Existing methods typically measure the arrival time or completion time of each target path after message sending or transmission, and then compare the corresponding time differences retrospectively. While these methods can obtain time difference results, the observed results mainly show continuous numerical differences, making it difficult to directly correlate them with whether the branch connections after the preset branch point still follow the original topology. In other words, existing technologies do not completely fail to detect differences; rather, they can obtain time difference results at the continuous quantity level, but these continuous quantity results cannot yet stably converge into connection relationship verification conclusions.

[0029] Especially when multiple target branches share a front-end path, separate paths only form after a preset branch point, and the transmission of probe messages themselves occupies a small amount of space, both correct structures and minor structural anomalies can often cause related backhauls to still fall within the same transmission cycle. In this case, time difference changes may originate from structural offsets after the preset branch point, or from operational factors such as transmission cycle switching, changes in transmission cycle boundary protection margins, and jitter in backhaul result acquisition. It is difficult to reliably separate the structural differences that truly correspond to changes in connection relationships. In other words, even if existing methods can measure minute time differences, they often only observe numerical changes and cannot directly convert these changes into discernible conclusions about branch connection relationships.

[0030] To this end, the present invention organizes the entire automatic verification process around the target branch that shares uplink transmission resources after the preset branch point. First, it identifies sensitive tail branches, preceding branches and their boundary squeezing control basis within the target branch range where there is a direct queuing and squeezing relationship. Then, it loads additional transmission occupancy restricted by boundary constraints on the verification message corresponding to the preceding branch in round by round, so that the sensitive tail branch is compressed to the critical observation interval near the transmission cycle boundary. Finally, it uses whether the sensitive tail branch crosses the transmission cycle boundary first as the discrete discrimination exit, and outputs the preset branch point consistency conclusion or the branch structure abnormal conclusion, thereby converging the originally difficult-to-interpret continuous time difference changes into the connection relationship verification result.

[0031] Based on the above design, this invention constructs a complete process for automatic verification of micro-differential delay network connectivity based on topology analysis, consisting of steps S101 to S103 sequentially. (Refer to...) Figure 1 , Figure 1 This is a schematic diagram of the method flow of the present invention, which includes:

[0032] Step S101, co-transmission branch identification and boundary control basis generation, is used to extract the backhaul path of the target branches in the design topology and target branch input information X101, under the premise that the design topology has given the preset branch points and the design connection relationship of each target branch. It identifies the range of target branches that are truly under the same uplink transmission competition relationship, and further filters out the sensitive tail branches closest to the transmission cycle boundary and their corresponding preceding branches, forming the control basis entry required for subsequent boundary squeezing loading. This step takes the design topology and target branch input information X101 as input and outputs the boundary squeezing control basis set R101. The boundary squeezing control basis set R101 is used to indicate which target branches have been assigned to the co-transmission branch group, which target branches are identified as sensitive tail branches and preceding branches, and records the coverage mapping relationship, queuing and transmission level basis, preceding priority relationship basis, and boundary time distance record required by subsequent step S102, for direct reading by subsequent steps S102 and S103.

[0033] Step S102, boundary squeezing loading and critical observation condition generation, is used to perform round-based additional transmission occupancy determination, boundary constraint truncation, actual loading, and boundary state recalculation around the sensitive tail branch and preceding branch, based on the boundary squeezing control basis set R101. This gradually compresses the current target sensitive tail branch to the critical observation interval, forming the explicit conditions before the subsequent discrete determination of connection relationships. This step takes the boundary squeezing control basis set R101 as input and outputs the boundary squeezing loading result R102. The boundary squeezing loading result R102 is used to record the current target sensitive tail branch selection result, the current preceding branch selection result, the additional transmission occupancy loading result, the current remaining boundary margin, the critical observation state, and the stopping condition state for each round, which can be directly read by the subsequent step S103.

[0034] Step S103 generates actual return transmission judgment and connection relationship verification results. Based on the boundary squeezing control basis set R101 and the boundary squeezing loading result R102, it collects the actual return transmission results of each target branch after boundary squeezing loading, and performs a cross-transmission cycle boundary judgment around the sensitive tail branch. It outputs a verification conclusion on whether the branch connection relationship after the preset branch point is still consistent with the predetermined topology connection relationship. When the same preset branch point corresponds to multiple co-transmission branch groups, a cross-transmission cycle boundary judgment is performed on each co-transmission branch group, and the judgment results of each co-transmission branch group are summarized to generate the final verification conclusion corresponding to the preset branch point. This step takes the boundary squeezing control basis set R101 and the boundary squeezing loading result R102 as input and outputs the connection relationship verification result R103. The connection relationship verification result R103 is used to record the cross-boundary judgment status of the sensitive tail branch and the corresponding preset branch point consistency conclusion or branch structure anomaly conclusion, serving as the final verification output of this method.

[0035] Based on the above technical means, this invention constructs boundary compression conditions to transform the branch structure differences that were originally difficult to manifest after the preset branch point into a discrete discrimination state of whether or not the transmission cycle boundary is crossed. Based on this discrete discrimination state, it is possible to automatically verify whether the branch connection relationship still holds according to the designed topology, and reduce the mapping breakpoints caused by directly inferring the connection relationship based solely on continuous time difference results.

[0036] The implementation process and operational effects of the method of the present invention will be described in detail below with reference to specific embodiments. It should be understood that the embodiments are only used to illustrate the technical solution of the present invention, and not to limit it. The relevant steps, parameters, and module divisions can be appropriately adjusted without changing the essence of the invention.

[0037] In an optional implementation, step S101 includes target object extraction and co-occurrence grouping, design state return completion sequence identification and sensitive tail branch screening, preceding branch identification, relationship basis and boundary basis generation, and result write-back.

[0038] In the target object extraction and co-transmission grouping process, the preset branch point identifier, target node identifier, design connection relationship of each target branch after the preset branch point, and backhaul path information corresponding to each target branch are read from the design topology and target branch input information X101. The target branches leading to each target node after the preset branch point are then extracted as the current analysis objects. The backhaul path refers to the path taken by each target branch when its corresponding verification message is transmitted back to the upstream sending side. It is used to determine whether different target branches share uplink transmission resources and enter the same serial uplink transmission queue. Subsequently, the resource occupancy of the backhaul path corresponding to each target branch above the preset branch point is compared, and it is checked whether they have entered the same serial uplink transmission queue. The serial uplink transmission queue refers to a queued transmission channel in which multiple target branches enter and transmit sequentially when transmitting back above the preset branch point. It is used to characterize whether transmission occupancy can be passed along the same queuing chain. Only target branches that simultaneously occupy the same uplink transmission resource and enter the same serial uplink transmission queue are determined to have a direct queuing relationship and are merged into a co-transmission branch group. A co-transmission branch group refers to a group of target branches that occupy the same uplink transmission resource and enter the same serial uplink transmission queue during the uplink backhaul process. It is used to limit the actual scope of subsequent boundary squeezing analysis.

[0039] In the design-state backhaul completion order identification and sensitive tail branch screening, for each co-transmission branch group, the backhaul completion time of each target branch in the design state is determined according to the predetermined topology connection relationship, and they are arranged in order from front to back according to the backhaul completion time to form the design-state backhaul completion order. The design-state backhaul completion time refers to the theoretical backhaul completion time corresponding to each target branch when the predetermined topology connection relationship is maintained. It can be determined based on the design path length of each target branch after the preset branch point, the node forwarding delay configuration, and the design-state transmission order relationship under the same uplink transmission resource. It is used to form a unified sorting baseline for subsequent sensitive tail branch identification and queuing transmission distance determination. Subsequently, for the target branch at the end of the sorting, the time distance between its corresponding backhaul completion time and the transmission cycle boundary is extracted. The transmission cycle boundary is the boundary time that distinguishes the current transmission cycle and the next transmission cycle under the periodic transmission mechanism, and is used to uniformly determine whether the target branch has approached the cross-cycle state. The transmission cycle boundary protection margin refers to the protective time margin reserved in the design state to prevent the target branch's return transmission from prematurely approaching the transmission cycle boundary. It is used to limit the boundary area near the boundary that can enter the tail sensitivity determination range. The tail sensitivity determination duration refers to the boundary time determination criterion used to determine whether a target branch belongs to a sensitive tail branch. It is used to screen out the tail objects that are closest to the transmission cycle boundary and are most suitable for subsequent boundary compression observation. The tail sensitivity determination duration is determined based on the distribution of design state return transmission completion times within the same transmission branch group and the transmission cycle boundary protection margin. In engineering implementation, the set of target branches at the end of the sorting within the same transmission branch group and whose corresponding return transmission completion time is less than the transmission cycle boundary protection margin can be selected first. Then, the largest time distance in this set is taken as the tail sensitivity determination duration. When the time distance between the corresponding return transmission completion time of a target branch and the transmission cycle boundary is less than or equal to the tail sensitivity determination duration, the target branch is identified as a sensitive tail branch. When multiple target branches at the end of the sorting meet this condition, they are collectively identified as a set of sensitive tail branches.

[0040] In the preceding branch identification process, for each sensitive tail branch, the process traces backward along the design state backhaul completion order within the corresponding co-transmission branch group to identify target branches that precede the sensitive tail branch and whose transmission occupancy can be propagated backward along the same serial uplink transmission queue to the sensitive tail branch. These target branches are then identified as preceding branches. A preceding branch is a target branch that precedes the sensitive tail branch and whose transmission occupancy can be propagated backward along the same serial uplink transmission queue to the sensitive tail branch, serving as the loading object for subsequent additional transmission occupancy. The aforementioned ability to propagate backward means that the target branch and the corresponding sensitive tail branch are in the same serial uplink transmission queue and are ranked before the sensitive tail branch in the design state backhaul completion order. When the transmission occupancy of the target branch increases, the transmission completion time of the sensitive tail branch in the same serial uplink transmission queue is delayed. If multiple preceding branches act on the same sensitive tail branch, a preceding priority relationship is generated according to the order of the priority difference between each preceding branch and the sensitive tail branch from smallest to largest. The precedence priority relationship refers to the order judgment criterion formed by the order difference between multiple preceding branches and the same sensitive tail branch when multiple preceding branches jointly cover the same sensitive tail branch. This criterion is used to provide a unified order source for the round selection in the subsequent step S102.

[0041] In the generation of relational and boundary criteria, for each preceding branch, the system records which sensitive tail branches its newly added transmission occupancy might be cumulatively passed to, forming a coverage mapping relationship. The coverage mapping relationship refers to the correspondence between which sensitive tail branches the cumulative transmission occupancy of the preceding branch will be passed to, including at least the correspondence set between the preceding branch identifier and the affected sensitive tail branch identifier, used to characterize the scope of the target object when subsequent additional transmission occupancy is loaded. Simultaneously, based on the design state backhaul completion order within the same transmission branch group, the queuing interval levels traversed when the newly added transmission occupancy of the preceding branch is passed to the corresponding sensitive tail branch are determined, forming a queuing transmission level basis. The queuing transmission level basis refers to the basis for determining the queuing interval levels traversed when the newly added transmission occupancy of the preceding branch is passed to the corresponding sensitive tail branch, used to support the determination of subsequent queuing transmission distances and candidate values ​​for additional transmission occupancy. Under the current implementation, the queuing transmission distance from the preceding branch to the sensitive tail branch is determined according to the order difference in the design state backhaul completion order within the same transmission branch group. The smaller the order difference, the fewer queuing intervals are crossed when the newly added transmission occupies the corresponding sensitive tail branch, and the more direct the subsequent boundary squeezing effect. Simultaneously, for each sensitive tail branch, its corresponding return completion time, corresponding transmission cycle boundary time, and the time distance between them are recorded, forming a boundary time distance record, which is then arranged in ascending order of time distance. The boundary time distance record refers to the time distance record between the corresponding return completion time of each sensitive tail branch and the transmission cycle boundary, and its arrangement. It is used to characterize the initial approximation state of each sensitive tail branch near the boundary and provides a unified input basis for the selection of the current target sensitive tail branch, boundary constraint calculation, and stopping condition judgment in subsequent steps S102.

[0042] In the result write-back, the results of same-origin branch group identification, sensitive tail branch identification, preceding branch identification, coverage mapping relationship, queuing and transmission hierarchy basis, preceding priority relationship basis, and boundary time distance are merged and registered. When a target branch meets the same-origin grouping condition, its same-origin branch group identifier is recorded; when a target branch meets the sensitive tail branch identification condition, its sensitive tail branch identifier and its corresponding boundary time distance are recorded; when a target branch meets the preceding branch identification condition, its preceding branch identifier and its corresponding coverage area are recorded; when multiple preceding branches jointly cover the same sensitive tail branch, the corresponding preceding priority relationship basis is recorded; when a preceding branch and its corresponding sensitive tail branch can form a queuing and transmission relationship, its queuing and transmission hierarchy basis and queuing and transmission distance are recorded. Subsequently, the above results are uniformly written into the boundary compression control basis set R101. R101 at least accepts the same-transmission branch group identifier, target branch identifier, sensitive tail branch identifier, preceding branch identifier, coverage mapping relationship, queuing and transmission hierarchy basis, preceding priority relationship basis, and boundary time distance record. It is used to provide a unified control basis for the subsequent step S102 of additional transmission occupancy loading object, affected object, transmission relationship and initial boundary state, and to provide the boundary observation object caliber and design state relationship source for step S103.

[0043] In an optional implementation, step S102 includes basic state reading, current target sensitive tail branch selection, current execution preceding branch selection, additional sending occupancy candidate value generation, boundary constraint upper bound truncation, actual loading and state recalculation, stop condition judgment, and result writing back.

[0044] In the basic state reading, the following are read from the boundary squeezing control basis set R101: the same-send branch group identifier, sensitive tail branch identifier, preceding branch identifier, coverage mapping relationship, queuing and transmission hierarchy basis, preceding priority relationship basis, and boundary time distance record. Based on the boundary time distance record, the current remaining boundary balance of each sensitive tail branch at the beginning of this step is determined. Basic transmission occupancy refers to the basic transmission duration occupied by the verification message corresponding to the currently executing preceding branch when no additional transmission occupancy is loaded; it serves as the baseline quantity for generating candidate values ​​for additional transmission occupancy in this step. The current remaining boundary balance refers to the time distance still retained between the return completion time corresponding to a certain sensitive tail branch and the transmission cycle boundary; it serves as the state quantity for boundary constraints and stopping condition judgment.

[0045] In the selection of the current target sensitive tail branch, for multiple sensitive tail branches within the same co-originating branch group, the current target sensitive tail branch is selected in ascending order of its current remaining boundary margin. The current target sensitive tail branch refers to the sensitive tail branch that preferentially enters boundary compression control in the current round and is used as the core object for boundary compression observation in this round. When multiple sensitive tail branches have the same current remaining boundary margin, the sensitive tail branch with the higher ranking in the boundary time distance record is selected as the current target sensitive tail branch.

[0046] In the current execution preceding branch selection, for the current target sensitive tail branch, a set of preceding branches that can act on the current target sensitive tail branch are filtered from the coverage mapping relationship, and the current execution preceding branch is selected according to the preceding priority relationship. The current execution preceding branch refers to the preceding branch that actually undertakes the additional transmission occupancy loading in the current round, and is used to apply a backward queuing squeezing effect to the current target sensitive tail branch. When multiple preceding branches jointly cover the current target sensitive tail branch, they are first compared in ascending order of queuing transmission distance between each preceding branch and the current target sensitive tail branch, and the preceding branch with the shortest queuing transmission distance is selected as the priority candidate. When multiple preceding branches have the same queuing transmission distance, the basic transmission occupancy is further compared among the multiple preceding branches, and the preceding branch with the larger basic transmission occupancy is selected as the current execution preceding branch. When the queuing transmission distance and basic transmission occupancy are still the same, the preceding branch with the higher ranking in the preceding priority relationship is selected as the current execution preceding branch. By following the above sequence, the preceding branches, which are more directly transmitted in the queue and have a more significant effect on the tail branches that are sensitive to the current target, can be prioritized for loading in this round.

[0047] In the generation of additional transmission occupancy candidate values, the basic transmission occupancy of the currently executing preceding branch and its queuing transmission distance to the current target sensitive tail branch are read, and additional transmission occupancy candidate values ​​are generated accordingly. The queuing transmission distance refers to the number of queuing intervals traversed when the newly added transmission occupancy of the currently executing preceding branch is transmitted backward along the same serial uplink transmission queue to the current target sensitive tail branch, used to characterize the directness of the current round of boundary squeezing. Under the current caliber, the queuing transmission distance is determined by the queuing transmission hierarchy in the boundary squeezing control criterion set R101, and obtained according to the order difference in the design state return completion sequence within the same transmission branch group, and is a positive integer. The additional transmission occupancy candidate value refers to the newly added transmission duration predetermined based on the basic transmission occupancy and queuing transmission distance of the currently executing preceding branch before the formal loading of this round, used as the original candidate quantity for this round of boundary squeezing control. Let the basic transmission duration of the verification message corresponding to the currently executing preceding branch be... Let the queuing distance from the current execution preorder branch to the current target sensitive tail branch be . Then, append the candidate value for sending the occupancy. according to Confirmed. Among them, This indicates the base sending time of the verification message corresponding to the current preceding branch when no additional sending is loaded. This indicates the number of queuing intervals that must be crossed when a new data entry is sent from the preceding branch and propagated to the current target sensitive tail branch. This indicates the additional send occupancy candidate values ​​generated before the current round of formal loading. When The smaller the value, the more direct the queuing and squeezing effect of the current preceding branch on the current target-sensitive tail branch, and the larger the corresponding additional sending occupancy candidate value; when The larger the value, the more interval levels the queuing transmission spans, and the smaller the corresponding additional transmission occupancy candidate value.

[0048] In the boundary constraint upper bound truncation, for each affected sensitive tail branch covered by the currently executing preceding branch, the maximum loadable space in this round is calculated, and the minimum value among them is used as the unified upper bound for this round to truncate the additional transmission occupancy candidate values. The safety margin threshold refers to the minimum remaining time distance reserved to prevent sensitive tail branches from being prematurely pushed out of the current transmission cycle during the loading process, while maintaining the predetermined topology connection relationship; it is used to limit the maximum loadable space in this round. Boundary constraints are the boundary restriction conditions used when applying loading restrictions to additional transmission occupancy candidate values, determined jointly by the current remaining boundary margin of the affected sensitive tail branches and the safety margin threshold. Let the current executing preceding branch cover the... The current remaining boundary margin of each affected sensitive tail branch before this round of loading is: Let the safety margin threshold be... Then the first The maximum loadable space for each affected sensitive tail branch in this round is .in, This indicates the sequence number of each affected sensitive tail branch covered by the currently executing preceding branch. Indicates the first The time distance that the affected sensitive tail branch still retains between the current loading cycle boundary and the current cycle boundary. Indicates the safety margin threshold. Indicates the first The maximum safe space allowed for continued loading of each affected sensitive tail branch in this round. When the currently executing preceding branch covers multiple affected sensitive tail branches, each... The minimum value in the range is used as the unified upper bound for this round. Then determine the actual additional transmission occupancy as .in, This represents the uniform maximum upper bound of the load that can be applied to the current preceding branch in this round. This represents the actual additional transmission occupancy obtained after applying boundary constraints to the candidate values ​​of the additional transmission occupancy. The reason for taking the minimum value in the maximum loadable space corresponding to each affected sensitive tail branch as the unified upper bound is that the same currently executing preceding branch may act on multiple affected sensitive tail branches simultaneously. In this case, the affected sensitive tail branch with the tightest boundary space should be used as the unified constraint object to prevent any affected sensitive tail branch from being prematurely pushed out of the current transmission cycle when the predetermined topology connection relationship remains valid.

[0049] In engineering implementation, the safety margin threshold can be determined jointly based on the upper limit of clock synchronization error under a unified time reference and the upper limit of jitter in the backhaul result acquisition. The upper limit of clock synchronization error can be pre-determined based on the synchronization accuracy configuration parameters of network devices under a unified time reference, synchronization test records, or synchronization error statistics during system acceptance. The upper limit of jitter in the backhaul result acquisition can be pre-determined based on the jitter statistics obtained by the main control side from the continuous acquisition of actual backhaul results from the target branches within the same transmission branch group, the accuracy parameters of the acquisition device, or historical operation records. For example, the safety margin threshold can be set as the sum of the upper limit of clock synchronization error and the upper limit of jitter in the backhaul result acquisition; when the system is pre-configured with a transmission cycle boundary protection margin, the transmission cycle boundary protection margin can also be used as an additional verification basis for the safety margin threshold without changing the safety boundary caliber. The reason for this setting is that even under normal conditions where the predetermined topology connection relationship remains established, the actual return result may still be affected by time alignment errors and acquisition perturbations. If this minimum remaining time distance is not reserved, the affected sensitive tail branch may be mistakenly pushed out of the current transmission cycle due to error accumulation, thereby interfering with the discrete determination stability of the subsequent step S103. When the maximum loadable space in this round corresponding to a certain affected sensitive tail branch is less than or equal to zero, it is determined that the affected sensitive tail branch no longer has space to continue to be safely loaded, and the additional transmission occupation acting on the affected sensitive tail branch will not be increased in this round, and the stop condition judgment will be entered.

[0050] In the actual loading and state recalculation, the actual additional transmission occupancy is loaded onto the corresponding verification message of the currently executing preceding branch. This allows the newly added transmission occupancy of the currently executing preceding branch to accumulate and propagate along the same serial uplink transmission queue. Based on this, the return completion time of the current target sensitive tail branch and other affected sensitive tail branches, as well as the current remaining boundary margin, are recalculated. The actual additional transmission occupancy refers to the actual loading amount obtained after truncating the candidate values ​​of the additional transmission occupancy according to the boundary constraints. This amount is used as the new transmission occupancy actually applied to the currently executing preceding branch in this round. After loading is completed, the actual increase in transmission occupancy of the currently executing preceding branch in this round is used as the new transmission occupancy propagation amount for this round. Then, state updates are performed separately for each affected sensitive tail branch covered by the currently executing preceding branch. For each affected sensitive tail branch, under the condition that the currently executing preceding branch and the affected sensitive tail branch are in the same serial uplink transmission queue and the newly added transmission occupancy can be passed forward along the serial uplink transmission queue, the original return completion time of the affected sensitive tail branch is extended backward by the amount of newly added transmission occupancy passed in this round to obtain the updated return completion time of the affected sensitive tail branch after this round of loading; then, based on the time distance between the updated return completion time and the transmission cycle boundary, the current remaining boundary balance of the affected sensitive tail branch after this round of loading is recalculated. If the same currently executing preceding branch acts on multiple affected sensitive tail branches simultaneously, the above update is performed on each affected sensitive tail branch separately, and the corresponding updated return completion time and current remaining boundary balance are recorded separately. When an affected sensitive tail branch is not covered by the currently executing preceding branch, or it is not on the queue chain where the newly added transmission occupancy can continue to be passed forward, its return completion time and current remaining boundary balance remain unchanged. After the above recalculation is completed, the update results of each affected sensitive tail branch will be used as the input basis for the selection of the current target sensitive tail branch, boundary constraint judgment and stopping condition judgment in the next round.

[0051] In the stop condition determination, based on the current remaining boundary margin of the current target sensitive tail branch after this round of loading, it is determined whether it has entered the critical observation interval, or whether loading should be stopped. The critical observation interval refers to the state interval near the boundary where the sensitive tail branch has been compressed to a level sufficient to reveal structural differences, but has not yet crossed the safety boundary; this interval serves as the target state interval for stopping loading in this step. The preset observation threshold is a threshold used to determine whether the current target sensitive tail branch has entered the critical observation interval, and it, together with the safety margin threshold, constitutes the stop condition. The preset observation threshold is greater than the safety margin threshold and can be determined based on a preset proportional relationship between the safety margin threshold and the tail sensitivity determination time. For example, the preset observation threshold can be set to the midpoint between the safety margin threshold and the tail sensitivity determination time, and the preset observation threshold is greater than the safety margin threshold and less than or equal to the tail sensitivity determination time. The reason for this setting is that if the current target sensitive tail branch is still significantly far from the transmission cycle boundary, it has not yet entered the critical observation state sufficient to manifest structural differences; if it is too close to the transmission cycle boundary and touches the safety margin threshold, it may cross the boundary prematurely due to operational errors and acquisition jitter. Therefore, it is necessary to reserve a stable observation interval near the boundary outside the safety margin threshold as the target state interval before the subsequent step S103 performs discrete determination. When the current remaining boundary margin of the current target sensitive tail branch after this round of loading is greater than the safety margin threshold and less than or equal to the preset observation threshold, and the current remaining boundary margin of the affected sensitive tail branches covered by the current execution preceding branch is greater than or equal to the safety margin threshold, it is determined that the current target sensitive tail branch has entered the critical observation interval, and loading is stopped; when continuing loading will cause the current remaining boundary margin of the current target sensitive tail branch to be less than the safety margin threshold, loading is also stopped; when the current remaining boundary margin of the current target sensitive tail branch is still greater than the preset observation threshold, it is determined that it has not yet entered the critical observation interval, and the next round of loading begins.

[0052] In the result write-back, the current target sensitive tail branch selection results, the current execution preceding branch selection results, additional transmission occupancy candidate values, actual additional transmission occupancy, the current remaining boundary margin of each affected sensitive tail branch, the critical observation state, and the stopping condition state are all uniformly written into the boundary squeezing loading result R102. When a sensitive tail branch is selected as a priority compression target in the current round, its current target sensitive tail branch identifier is recorded; when a preceding branch is selected as a loading target in the current round, its current execution preceding branch identifier is recorded; when additional transmission occupancy candidate values ​​have been generated and boundary constraint truncation has been completed in this round, the corresponding additional transmission occupancy candidate values ​​and actual additional transmission occupancy are recorded; when an affected sensitive tail branch completes its state update after loading in this round, its current remaining boundary margin is recorded; when the current target sensitive tail branch meets the critical observation interval condition or meets the stop loading condition, the corresponding critical observation state and stopping condition state are recorded. Subsequently, the above results are uniformly written into the boundary squeezing loading result R102. R102 at least includes the current target sensitive tail branch identifier, the current execution preceding branch identifier, the additional transmission occupancy candidate value, the actual additional transmission occupancy, the current remaining boundary margin of each affected sensitive tail branch, the critical observation state identifier, and the stop condition state identifier, which are used to provide the dynamic boundary state basis for the subsequent step S103 before discrete determination.

[0053] In one optional implementation, step S103 includes reading the judgment object and judgment basis, collecting the actual return result, determining the boundary tolerance, judging the crossing of the transmission cycle boundary, and writing back the result.

[0054] In the determination of the target and the determination basis reading, the simultaneous transmission branch group identifier, sensitive tail branch identifier, transmission cycle boundary, and boundary time distance record are read from the boundary squeezing control basis set R101. The current target sensitive tail branch identifier, the current remaining boundary margin of each affected sensitive tail branch, the critical observation state, and the stopping condition state are read from the boundary squeezing loading result R102. Based on this, the target branch range and boundary state basis for entering this step of determination are determined. The target branch range entering this step of determination refers to the set of target branches within the simultaneous transmission branch group after boundary squeezing loading in step S102 and reaching the stopping condition. This set serves as the object range for subsequent actual feedback result collection and cross-boundary determination.

[0055] In the actual feedback result acquisition, for each target branch entering the scope of this step's judgment, the actual feedback result of each target branch after boundary compression loading is collected. The actual feedback result refers to the actual feedback time of each target branch within the same transmission branch group, collected by the main control side under a unified time reference after the boundary compression loading in step S102 is completed. This time is used as the direct input for this step to perform the judgment of crossing the transmission cycle boundary. The main control side uniformly records the actual feedback result of each target branch as an actual feedback time that can be directly compared with the transmission cycle boundary, thereby ensuring that the subsequent cross-boundary judgment uses a consistent time comparison caliber.

[0056] In determining the boundary tolerance, the boundary tolerance is determined based on the clock synchronization error under a unified time reference and the jitter in the backhaul results. Boundary tolerance refers to the allowable deviation range reserved near the boundary of the transmission cycle to absorb the clock synchronization error and jitter in the backhaul results under a unified time reference, preventing error disturbances from being misjudged as actual boundary crossings. The upper limit of the clock synchronization error can be pre-determined based on the network device's synchronization accuracy configuration parameters under a unified time reference, synchronization test records, or synchronization error statistics during system acceptance. The upper limit of the backhaul results jitter can be pre-determined based on the jitter statistics obtained from the continuous acquisition of actual backhaul results from the target branch by the main control side, the accuracy parameters of the acquisition device, or historical operation records. For example, the boundary tolerance can be set as the sum of the upper limit of the clock synchronization error and the upper limit of the backhaul results jitter. The reason for this setting is that even when the predetermined topology connection relationship remains established, the actual backhaul results may still fluctuate slightly near the boundary of the transmission cycle due to clock alignment deviations and acquisition disturbances. If no boundary tolerance is set, normal fluctuations near the boundary are easily misjudged as boundary crossing anomalies, thereby weakening the stability of the final verification conclusion. Under the current implementation, when determining whether a sensitive tail branch crosses the transmission cycle boundary, the time difference between the actual return time of the sensitive tail branch and the transmission cycle boundary is used as a unified comparison benchmark. Only when the time difference is greater than the boundary tolerance is the sensitive tail branch determined to have truly crossed the transmission cycle boundary. When the time difference is less than or equal to the boundary tolerance, it is determined to still be within the boundary tolerance range and is not treated as a true crossover.

[0057] In the determination of crossing the transmission cycle boundary, the actual return result of the sensitive tail branch is checked to see if it exceeds the transmission cycle boundary and the deviation range allowed by the boundary tolerance. Crossing the transmission cycle boundary means that the actual return time of a target branch is later than the transmission cycle boundary and exceeds the deviation range allowed by the boundary tolerance, which indicates that the target branch has entered the next transmission cycle from the current transmission cycle. For each co-transmission branch group corresponding to the same preset branch point, the determination of crossing the transmission cycle boundary is performed respectively; if there is no target branch in a co-transmission branch group that crosses the transmission cycle boundary before the other target branches in the co-transmission branch group, it is determined that the branch connection relationship corresponding to the co-transmission branch group is still consistent with the predetermined topology connection relationship; if there is one or more target branches in a co-transmission branch group that cross the transmission cycle boundary before the other target branches in the co-transmission branch group, it is determined that the actual branch connection relationship corresponding to the co-transmission branch group has deviated from the predetermined topology connection relationship. When any branch group within the same pre-defined branch point is determined to have a branch connection relationship that deviates from the predetermined topology, an abnormal branch structure conclusion is output for that pre-defined branch point. Only when none of the branch groups are determined to have a branch connection relationship that deviates from the predetermined topology is a consistent conclusion for that pre-defined branch point. A consistent conclusion for a pre-defined branch point refers to the verification conclusion that the branch connection relationship after the pre-defined branch point remains consistent with the predetermined topology. An abnormal branch structure conclusion refers to the verification conclusion that the actual branch connection relationship after the pre-defined branch point has deviated from the predetermined topology.

[0058] In the result write-back, the actual return results of each target branch, the cross-boundary determination status of sensitive tail branches, and the final connection relationship verification conclusion are all written into the connection relationship verification result R103. When the actual return time corresponding to a sensitive tail branch is later than the transmission cycle boundary and exceeds the deviation range allowed by the boundary tolerance, the sensitive tail branch is recorded as crossing the transmission cycle boundary; when the sensitive tail branch does not exhibit the above state, it is recorded as not crossing the transmission cycle boundary. When the same preset branch point corresponds to multiple co-transmission branch groups, if one or more target branches in any co-transmission branch group cross the transmission cycle boundary before the other target branches in the co-transmission branch group, the branch structure abnormal conclusion corresponding to the preset branch point is recorded; the consensus conclusion of the preset branch point is recorded only when none of the co-transmission branch groups have the target branch. Subsequently, the above results are all written into the connection relationship verification result R103. R103 at least includes the co-transmission branch group identifier, sensitive tail branch identifier, actual return results, cross-boundary determination status, and final verification conclusion, and is used as the final output result of this method.

[0059] To illustrate the verification process and determination exit point of the connection relationship of the target branches after the preset branch point in this invention, two representative verification scenarios C1 and C2 are selected as the illustrative objects. In each representative verification scenario, target branches B1 to B5 leading to target nodes N1 to N5 are configured around the preset branch point P, and the shared uplink transmission resource occupancy relationship, serial uplink transmission queue relationship, design state backhaul completion time, and transmission cycle boundary of each target branch during the uplink backhaul process are configured. Subsequently, the method of this invention performs co-transmission branch group identification, sensitive tail branch screening, boundary squeezing loading, and connection relationship verification on the target branches.

[0060] Scenario C1 illustrates that after boundary squeezing and loading, if the actual return time of the sensitive tail branch does not exceed the transmission period boundary, or if it approaches the transmission period boundary but does not exceed the boundary tolerance, this invention does not determine it as a true boundary crossing, but outputs a conclusion that the preset branch point is consistent. Scenario C2 illustrates that after boundary squeezing and loading, if the actual return time of the sensitive tail branch exceeds the transmission period boundary and exceeds the boundary tolerance, this invention determines that the actual branch connection relationship after the preset branch point has deviated from the predetermined topology connection relationship, and outputs a conclusion that the branch structure is abnormal.

[0061] like Figure 2 As shown, Figure 2 The upper part is the branch grouping background area for representative verification scenarios, used to explain that subsequent verification objects originate from target branch samples with pre-configured resource occupancy and queuing relationships. In this background area, target branches B1, B2, and B3 lead to target nodes N1, N2, and N3, and jointly occupy the shared uplink transmission resource Q1, belonging to the co-transmission branch group G1; target branches B4 and B5 lead to target nodes N4 and N5, and jointly occupy the shared uplink transmission resource Q2, belonging to the co-transmission branch group G2. Figure 2 The lower section explains the filtering process within group G1. Within G1, the order of data is determined from front to back based on the design state return completion time. The shaded area to the left of the transmission cycle boundary T represents the interval corresponding to the tail sensitivity determination time. The tail sensitivity determination time refers to the boundary time determination caliber used to determine whether a target branch belongs to a sensitive tail branch. It is used to filter out tail objects that are closest to the transmission cycle boundary and are most suitable for subsequent boundary squeezing observation. In this example, the boundary time distance between the design state return completion time and the transmission cycle boundary T of B3 falls within the interval corresponding to the tail sensitivity determination time, therefore B3 is identified as a sensitive tail branch. B1 and B2, which are located before B3 and whose transmission occupancy can be passed to B3 along the same serial uplink transmission queue, are identified as preceding branches. Figure 2 For illustrative purposes, this invention does not uniformly enter all target branches into subsequent verification. Instead, it first limits the range of target branches that actually have direct queuing and crowding relationships, and then filters out the most noteworthy boundary tail objects from the group.

[0062] like Figure 3 As shown, Figure 3 Based on Figure 2 Two representative verification result scenarios formed by G1. Figure 3 Scenario C1 corresponds to the preset branch point consistency conclusion. In C1, after the boundary squeezing loading in step S102, the actual backhaul results of each target branch in G1 are uniformly recorded as the actual backhaul time that can be directly compared with the sending period boundary. Among them, although the sensitive tail branch B3 is close to the sending period boundary T, its actual backhaul time does not exceed the sending period boundary T, so the preset branch point consistency conclusion is output. Figure 3 Scenario C2 corresponds to the conclusion of branch structure anomaly. In C2, after the same boundary squeezing loading, the actual return time of the sensitive tail branch B3 crosses the transmission period boundary T and exceeds the boundary tolerance, thus outputting the conclusion of branch structure anomaly. The boundary tolerance refers to the allowable deviation range reserved near the transmission period boundary to absorb clock synchronization errors and jitter in the acquisition of return results under a unified time reference, used to avoid misjudging normal fluctuations near the boundary as real cross-boundary events. Figure 3 For illustrative purposes, the final verification output of this invention is not the continuous time difference value itself, but rather the discrete judgment result established around the boundary of the transmission period.

[0063] Depend on Figure 2 and Figure 3 As can be seen, this invention first determines the co-transmission branch group based on shared uplink transmission resources and the serial uplink transmission queue. Then, it identifies sensitive tail branches based on the boundary time distance between the design state return completion time and the transmission cycle boundary. Subsequently, it compresses structural differences that are not easily manifested to the vicinity of the transmission cycle boundary through boundary squeezing loading. Finally, it uses whether the sensitive tail branch actually crosses the boundary as the criterion, rather than simply making empirical comparisons of continuous time difference results. Therefore, the verification results of the branch connection relationship after the preset branch point can maintain a more stable and consistent correspondence with the actual structural state, thereby improving the consistency and interpretability of the automatic verification results.

[0064] The above embodiments can be implemented, in whole or in part, by software, hardware, firmware, or any other combination thereof. When implemented using software, the above embodiments can be implemented, in whole or in part, in the form of a computer program product.

[0065] Those skilled in the art will recognize that the modules and algorithm steps of the various examples described in conjunction with the embodiments disclosed herein can be implemented in electronic hardware, or a combination of computer software and electronic hardware. Whether these functions are implemented in hardware or software depends on the specific application and inventive constraints of the technical solution. Those skilled in the art can use different methods to implement the described functions for each specific application, but such implementation should not be considered beyond the scope of this application.

[0066] In addition, the functional modules in the various embodiments of this application can be integrated into one processing module, or each module can exist physically separately, or two or more modules can be integrated into one module.

[0067] The above description is merely a specific embodiment of this application, but the scope of protection of this application is not limited thereto. Any variations or substitutions that can be easily conceived by those skilled in the art within the scope of the technology disclosed in this application should be included within the scope of protection of this application. Therefore, the scope of protection of this application should be determined by the scope of the claims.

[0068] In conclusion, the above description is only a preferred embodiment of the present invention and is not intended to limit the present invention. Any modifications, equivalent substitutions, improvements, etc., made within the spirit and principles of the present invention should be included within the protection scope of the present invention.

Claims

1. An automatic verification method for connectivity relationships in micro-differential delay networks based on topology analysis, characterized in that, include: S101, Extract the target branches and their return paths to each target node after the preset branch point is extracted; Based on the uplink transmission resources occupied by each target branch above the preset branch point, they are grouped together to form a co-transmission branch group; Within each co-transmission branch group, the target branches are sorted from front to back according to the corresponding return completion time under the predetermined topology connection relationship. One or more target branches at the end of the sorting are identified as sensitive tail branches with a time distance between the corresponding return completion time and the transmission cycle boundary that is less than or equal to the tail sensitivity determination time. Target branches located before sensitive tail branches and whose transmission occupancy can be passed to sensitive tail branches along the same serial uplink transmission queue are identified as preceding branches. S102, based on the queuing and transmission distance from the preceding branch to the corresponding sensitive tail branch and the basic transmission occupancy of the corresponding verification message of the preceding branch, determine the additional transmission occupancy of the verification message of the preceding branch; according to the time distance between each sensitive tail branch and the transmission cycle boundary, load the additional transmission occupancy of the corresponding verification message of the preceding branch in sequence, and limit the additional transmission occupancy according to the boundary constraints of the affected sensitive tail branches, so that the newly added transmission occupancy of the preceding branch is accumulated and transmitted backward along the same serial uplink transmission queue and the sensitive tail branch is compressed to the vicinity of the transmission cycle boundary; S103, collect the actual feedback results of each target branch, and for each co-transmission branch group, determine whether there is one or more target branches in the sensitive tail branch that cross the transmission cycle boundary before the other target branches in the co-transmission branch group; when any co-transmission branch group has the target branch, output the branch structure abnormal conclusion corresponding to the preset branch point; when none of the co-transmission branch groups have the target branch, output the preset branch point consistent conclusion.

2. The automatic verification method for micro-delay network connectivity based on topology analysis according to claim 1, characterized in that, The conditions for a target branch to be included in the same transmission branch group are: each target branch occupies the same uplink transmission resource during the uplink backhaul process and enters the same serial uplink transmission queue above the preset branch point.

3. The automatic verification method for micro-delay network connectivity based on topology analysis according to claim 2, characterized in that, Within each co-transmission branch group, after sorting the return completion times of each target branch from front to back according to the predetermined topology connection relationship, the target branch at the end of the sort that has a time distance between its corresponding return completion time and the transmission cycle boundary that is less than or equal to the tail sensitivity determination time is identified as a sensitive tail branch. The target branch located before the sensitive tail branch and whose transmission occupancy can be passed to the sensitive tail branch along the same serial uplink transmission queue is identified as the preceding branch. The tail sensitivity determination time is determined based on the distribution of the design state return completion times and the transmission cycle boundary protection margin within the co-transmission branch group.

4. The automatic verification method for the connection relationship of a micro-delay network based on topology analysis according to claim 3, characterized in that, The queuing and transmission distance from the preceding branch to the sensitive tail branch is determined according to the order difference in the design state return transmission completion sequence within the same branch group.

5. The automatic verification method for micro-delay network connectivity based on topology analysis according to claim 4, characterized in that, The additional sending cost of the verification message corresponding to the preceding branch is determined based on the queuing distance and the basic sending cost. The shorter the queuing distance, the larger the additional sending cost; the larger the basic sending cost, the larger the additional sending cost.

6. The automatic verification method for micro-delay network connectivity based on topology analysis according to claim 5, characterized in that, Before loading additional sending space for the corresponding verification message of the preceding branch, the upper bound limit is applied to the additional sending space based on the minimum value of the space allowed to continue loading after deducting the safety margin threshold from the current remaining boundary margin of each of the sensitive tail branches covered by the preceding branch, so as to obtain the actual additional sending space loaded.

7. The automatic verification method for micro-delay network connectivity based on topology analysis according to claim 6, characterized in that, When loading additional sending space for the verification message corresponding to the preceding branch, in each loading round, the sensitive tail branch with the smallest time distance from the sending cycle boundary is selected as the current target sensitive tail branch, and then the preceding branch with the shortest queuing distance is selected from the preceding branches covering the current target sensitive tail branch as the current execution preceding branch. When there are multiple preceding branches with the same queuing distance, the preceding branch with the largest basic transmission occupancy is selected as the current preceding branch to be executed.

8. The automatic verification method for micro-delay network connectivity based on topology analysis according to claim 7, characterized in that, After each loading round is completed, the current remaining boundary margin of the affected sensitive tail branch is recalculated. The current remaining boundary margin is the time distance between the corresponding return completion time of the sensitive tail branch after loading and the sending cycle boundary. When the current remaining boundary margin of the current target sensitive tail branch is greater than the safety margin threshold and less than or equal to the preset observation threshold, and the current remaining boundary margin of the affected sensitive tail branches covered by the current execution preceding branch is greater than or equal to the safety margin threshold, the loading of additional sending occupancy is stopped.

9. The automatic verification method for the connection relationship of a micro-delay network based on topology analysis according to claim 1, characterized in that, When determining whether a target branch crosses the transmission cycle boundary, the boundary tolerance is determined based on the clock synchronization error and jitter of the backhaul result acquisition under a unified time reference; when the backhaul result corresponding to the sensitive tail branch exceeds the transmission cycle boundary and exceeds the boundary tolerance, it is determined to have crossed the transmission cycle boundary.

10. The automatic verification method for the connection relationship of a micro-delay network based on topology analysis according to claim 8, characterized in that, The safety margin threshold is determined based on the distribution of the design state backhaul completion time within the same branch group, the boundary protection margin of the transmission cycle, and the jitter range of the backhaul result under a unified time reference; the preset observation threshold is determined based on the preset proportional relationship between the safety margin threshold and the tail sensitivity judgment duration, and is greater than the safety margin threshold and less than or equal to the tail sensitivity judgment duration.

Images