Fault localization detection method, root node, communication system topology, and storage medium

Abstract

The application provides a fault positioning detection method, a root node, a communication system topology and a storage medium. The root node acquires a first communication quality parameter of a target leaf node. When the first communication quality parameter does not meet a first preset communication quality parameter requirement, historical characteristic information of multiple leaf nodes is acquired, and a first leaf node suspected of interfering with the target leaf node is determined from the multiple leaf nodes according to the historical characteristic information. Then, the first leaf node is controlled to stop uploading data in a first uplink time slot of the target leaf node, a second communication quality parameter of the target leaf node in the first uplink time slot is acquired. When the second communication quality parameter meets a second preset communication quality parameter requirement, the first leaf node is determined as a second leaf node interfering with the target leaf node. The application can screen out interfering leaf nodes, solve the problem that the uplink logical channel of a leaf node in a PToMP communication system topology adopting a TDMA mechanism is occupied, and realize fault positioning.

Description

Technical Field

[0001] The embodiments of the present invention relate to, but are not limited to, the field of communication technology, and particularly to a fault location and detection method, a root node, a communication system topology, and a computer-readable storage medium. Background Technology

[0002] A PToMP (Point To MultiPoint) communication architecture system typically consists of a root node and multiple leaf nodes. When this PToMP architecture system employs a TDMA (Time Division Multiple Access) mechanism, under normal circumstances, the root node assigns different uplink logical channel identifiers to different leaf nodes and allocates different uplink bandwidth time slots for leaf nodes to upload data based on these identifiers. However, because the uplink logical channel identifiers are dynamically allocated, the root node might reassign an uplink logical channel identifier to another leaf node if the previously assigned leaf node fails (e.g., goes offline). Since the leaf node that previously assigned the identifier might not properly release it upon its failure, this can lead to duplicate uplink logical channel identifiers. In other words, if a leaf node fails to release the uplink logical channel identifier as required by the root node due to an anomaly, and the root node reassigns the uplink logical channel identifier to other leaf nodes, it will cause a conflict in the uplink logical channel identifiers of the leaf nodes, which will in turn cause the abnormal leaf node to interfere with the uplink data of the normal leaf nodes.

[0003] To address this interference issue, it is necessary to first locate the abnormal leaf nodes. However, two situations often arise during the location process: First, due to differences in the states of different leaf nodes, such as signal strength or bandwidth, their manifestations differ depending on the uplink logical channel occupancy. Furthermore, because leaf nodes themselves may exhibit non-stationary characteristics, detecting uplink logical channel identifier occupancy issues is challenging. Second, given the dynamic allocation mechanism of uplink logical channel identifiers, uplink logical channel identifier occupancy is implicit, making it difficult to locate the leaf nodes exhibiting uplink logical channel identifier occupancy. Summary of the Invention

[0004] The following is an overview of the subject matter described in detail herein. This overview is not intended to limit the scope of the claims.

[0005] This invention provides a fault location and detection method, a root node, a communication system topology, and a computer-readable storage medium, which can locate abnormal leaf nodes.

[0006] In a first aspect, embodiments of the present invention provide a fault location and detection method applied to a root node in a communication system topology, wherein the communication system topology further includes multiple leaf nodes communicating with the root node, and the method includes:

[0007] Obtain the first communication quality parameter of the target leaf node, wherein the target leaf node is one of the plurality of leaf nodes;

[0008] When the first communication quality parameter does not meet the first preset communication quality parameter requirement, obtain the historical feature information of multiple leaf nodes;

[0009] Based on the historical feature information, determine the first leaf node suspected of interfering with the target leaf node from among the multiple leaf nodes;

[0010] Control the first leaf node to stop uploading data in the first uplink time slot of the target leaf node, and obtain the second communication quality parameter of the target leaf node in the first uplink time slot;

[0011] When the second communication quality parameter meets the second preset communication quality parameter requirement, the first leaf node is determined to be the second leaf node that interferes with the target leaf node.

[0012] In a second aspect, embodiments of the present invention also provide a root node, comprising: a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor executes the computer program to implement the fault location and detection method as described in the first aspect above.

[0013] Thirdly, embodiments of the present invention also provide a communication system topology, including multiple leaf nodes and a root node as described in the second aspect above, wherein the root node communicates with the multiple leaf nodes.

[0014] Fourthly, embodiments of the present invention also provide a computer-readable storage medium storing computer-executable instructions for performing the fault location and detection method as described in the first aspect above.

[0015] This invention includes the following steps: A root node in a communication system topology acquires a first communication quality parameter of a target leaf node, where the target leaf node is one of multiple leaf nodes in the topology. When the first communication quality parameter does not meet a first preset communication quality parameter requirement, the root node acquires historical feature information of the multiple leaf nodes and, based on the historical feature information, identifies a first leaf node suspected of interfering with the target leaf node. Then, the root node controls the first leaf node to stop uploading data during a first uplink time slot of the target leaf node and acquires a second communication quality parameter of the target leaf node during the first uplink time slot. When the second communication quality parameter meets a second preset communication quality parameter requirement, the root node determines that the first leaf node is a second leaf node interfering with the target leaf node. According to the technical solution of this invention, the root node can filter out a second leaf node, i.e., an abnormal leaf node, from multiple leaf nodes, solving the problem of occupied uplink logical channels of leaf nodes in a PToMP communication system topology using a TDMA mechanism, and achieving the location of abnormal leaf nodes.

[0016] Other features and advantages of the invention will be set forth in the description which follows, and will be apparent in part from the description, or may be learned by practicing the invention. The objects and other advantages of the invention may be realized and obtained by means of the structures particularly pointed out in the description, claims, and drawings. Attached Figure Description

[0017] The accompanying drawings are provided to further understand the technical solutions of the present invention and constitute a part of the specification. They are used together with the embodiments of the present invention to explain the technical solutions of the present invention, and do not constitute a limitation on the technical solutions of the present invention.

[0018] Figure 1 This is a schematic diagram of a PToMP communication system topology provided in one embodiment of the present invention;

[0019] Figure 2 This is a schematic diagram of an xPON network provided in one embodiment of the present invention;

[0020] Figure 3 This is a schematic diagram of a system architecture platform for performing a fault location and detection method according to an embodiment of the present invention;

[0021] Figure 4 This is a flowchart of a fault location and detection method provided in one embodiment of the present invention;

[0022] Figure 5 This is a flowchart illustrating the determination of the first leaf node in a fault location and detection method provided in an embodiment of the present invention.

[0023] Figure 6 This is a flowchart illustrating the determination of the first leaf node in a fault location and detection method provided in another embodiment of the present invention.

[0024] Figure 7 This is a flowchart illustrating the specific process of controlling the first leaf node to stop uploading data within the first uplink time slot of the target leaf node in a fault location and detection method provided in an embodiment of the present invention.

[0025] Figure 8 This is a flowchart illustrating the specific process of controlling the first leaf node to stop uploading data within the first uplink time slot of the target leaf node in the fault location and detection method provided in another embodiment of the present invention.

[0026] Figure 9 This is a flowchart illustrating the specific process of controlling the first leaf node to stop uploading data within the first uplink time slot of the target leaf node in a fault location and detection method provided in another embodiment of the present invention.

[0027] Figure 10 This is a flowchart illustrating the process of uploading the feature parameters of the second leaf node in a fault location and detection method provided in one embodiment of the present invention.

[0028] Figure 11 This is a flowchart of the xPON network topology licensing process provided in one embodiment of the present invention;

[0029] Figure 12 This is a flowchart illustrating a fault location and detection method in an xPON network according to an embodiment of the present invention. Detailed Implementation

[0030] To make the objectives, technical solutions, and advantages of this invention clearer, the invention will be further described in detail below with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are merely illustrative and not intended to limit the invention.

[0031] It should be noted that although functional modules are divided in the device schematic diagram and a logical order is shown in the flowchart, in some cases, the steps shown or described may be performed in a different order than the module division in the device or the order in the flowchart. The terms "first," "second," etc., in the specification, claims, or the aforementioned drawings are used to distinguish similar objects and are not necessarily used to describe a specific order or sequence.

[0032] like Figure 1 As shown, Figure 1 This is a schematic diagram of a PToMP communication system topology provided in one embodiment of the present invention. For Figure 1The PToMP communication architecture system includes a root node 110 and multiple leaf nodes 120 that communicate with the root node 110. When Figure 1 In the PToMP communication architecture system using the TDMA mechanism, under normal circumstances, the root node 110 dynamically assigns different uplink logical channel identifiers to different leaf nodes 120, and the root node 110 allocates different uplink bandwidth time slots for leaf nodes 120 to upload data based on the uplink logical channel identifier. However, because the uplink logical channel identifier uses a dynamic allocation mechanism, the root node may reassign an uplink logical channel identifier to other leaf nodes if the previously assigned leaf node fails (e.g., goes offline). Since the leaf node that previously assigned the uplink logical channel identifier may not release it properly in the event of its failure, this leads to the problem of duplicate uplink logical channel identifiers. In other words, if a leaf node fails to release the uplink logical channel identifier as required by the root node due to an anomaly, and the root node reassigns the uplink logical channel identifier to other leaf nodes, it will cause a conflict in the uplink logical channel identifiers of the leaf nodes, which will then cause the abnormal leaf node 120 to interfere with the uplink data of the normal leaf node 120.

[0033] It should be noted that the PToMP communication system topology using the TDMA mechanism described above can be a PON (Passive Optical Network) communication system using the TDMA mechanism in the access network. Specifically, the root node 110 can correspond to an OLT (Optical Line Terminal) in the PON communication system, and the leaf node 120 can correspond to an ONU (Optical Network Unit) or ONT (Optical Network Termination) in the PON communication system. Furthermore, the communication system topology using the TDMA mechanism described above can also be other network architectures using the TDMA mechanism or multiple terminal devices using the TDMA mechanism; this embodiment of the invention does not impose any limitations.

[0034] Specifically, in order to more clearly describe the situation where the uplink logical channel identifier is occupied in the PToMP communication architecture topology using the TDMA mechanism, this embodiment of the invention will take a PON communication system using the TDMA mechanism in the access network as an example for detailed explanation.

[0035] It is understood that passive optical network devices based on the TDMA mechanism can be divided into EPON (Ethernet Passive Optical Network), G-PON (Gigabit-capable Passive Optical Network), and other passive optical network devices based on their working mechanism. The system architecture of these passive optical network devices is consistent, all of which include an OLT and an ONU. In this embodiment of the invention, the above PON technology is collectively referred to as xPON.

[0036] like Figure 2 As shown, Figure 2 This is a schematic diagram of an xPON network provided in one embodiment of the present invention. For Figure 2 The xPON network includes an EMS (Element Management Server) 210, an OLT 220, an ODN (Optical Distribution Network) 230, and multiple ONUs 240. The OLT 220 acts as the central office equipment, connecting and aggregating multiple ONUs 240 via the ODN 230 network. The ONUs 240 are used to access user services, enabling data services and configuration management. Furthermore, the transmission direction from the OLT 220 to the ONUs 240 is downlink, using broadcast data transmission. The ONUs 240 determine the validity of the data based on the data identifier and decide whether to accept or discard it. The transmission direction from the ONUs 240 to the OLT 220 is uplink, using TDMA. The ONUs 240 transmit data based on the logical channel identifier and the uplink authorization from the OLT, and the OLT determines the validity of the data and decides whether to accept or discard it.

[0037] for Figure 2 The bandwidth authorization mechanism of the xPON network is as follows: After ONU240 registration, OLT220 and ONU240 periodically authorize bandwidth. Specifically, OLT220 sends a normal authorization to each ONU240 based on the ONU identifier. Only ONU240 with matching identifiers can respond and send a report according to the authorization requirements. Then, based on the report frame reported by the ONU240, OLT220 allocates new bandwidth to the ONU240 in the next cycle through an authorization frame. Subsequently, ONUs with matching uplink logical channel identifiers send data within the time specified in the authorization frame. When an ONU240 is deleted, the uplink logical channel identifier of the deleted ONU240 is reassigned by the OLT to other newly accessed ONU240s. That is, the ONU240 uplink logical channel identifier adopts a dynamic allocation mechanism.

[0038] It is understood that the aforementioned transmission of a general grant from the OLT220 to each ONU240 based on the ONU identifier can be, but is not limited to, an MPCP GATE frame in an EPON system or a GTC / BWmap frame in a GPON system. Furthermore, the aforementioned report sent by the ONU in response to the grant request can be, but is not limited to, an MPCP report frame in an EPON system or a PLOAMu / DBRu frame in a GPON system.

[0039] It should be noted that the aforementioned ONU240 uplink logical channel identifier is uniformly assigned by the OLT220 during ONU240 registration. After successful ONU240 registration, the OLT220 allocates different uplink bandwidth time slots according to the ONU240's uplink logical channel identifier. For xPON networks, under the control of the OLT220, one or more unique logical channel identifiers are assigned to each ONU240 on a PON port according to its service configuration, serving as the ONU240's uplink channel time slot identifier. This is used so that the ONU240 forwards data only within the uplink time slots allocated by the OLT220.

[0040] It is understandable that, regarding the aforementioned uplink channel timeslot identifier, in the EPON system, the uplink channel timeslot identifier corresponds to LIID (Logical Link Identifier); in the GPON system, the uplink channel timeslot identifier corresponds to AllocID (Allocate Identifier).

[0041] based on Figure 2 xPON network, when Figure 2 When the xPON network uses TDMA access, a registration process is initiated periodically. During the registration period, only newly accessed ONU240s that have not yet registered can respond to the registration authorization frame sent by OLT220. OLT220 assigns a unique ONU identifier to each ONU, and through interaction, ONU240 finally sends a registration completion frame to complete the entire registration process. That is, in the bandwidth allocation for ONU240 registration and normal operation in the aforementioned xPON network, ONU240 only turns on the uplink emission of the optical module and responds to various messages from OLT220 within the authorized time slot. Before the authorized time slot expires or after it closes, ONU240 must turn off the uplink emission of the optical module and can only listen to downlink messages from OLT220, accepting or discarding them based on the ONU identifier in the downlink message header.

[0042] It is understood that the aforementioned registration authorization frame may be, but is not limited to, the MPCP discovery GATE frame in the EPON system or the DS Frame with valid Psync frame in the GPON system. Furthermore, the aforementioned ONU identifier may be, but is not limited to, the LLID in the EPON system or the ONU ID in the GPON system. Additionally, the aforementioned registration completion frame may be, but is not limited to, the MPCP register ack frame sent by the ONU240 in the EPON system, or the Serial_Number_ONU or Password frame sent by the ONU240 in the GPON system.

[0043] In the aforementioned xPON network, due to the dynamic allocation mechanism of the uplink logical channel identifier, when the OLT220 reclaims the uplink logical channel identifier of an ONU240, and that ONU240 (i.e., an abnormal ONU240) fails to correctly release the uplink logical channel identifier originally allocated to it by the OLT220 due to some anomaly, the OLT220 reassigns the uplink logical channel identifier to another normal ONU240 on the same link. In this situation, two ONU240s may be transmitting data in the same uplink bandwidth time slot marked by the same uplink logical channel identifier. That is, the abnormal ONU240 that failed to correctly release the uplink logical channel identifier interferes with the uplink data of the normal ONU240 that was allocated the same uplink logical channel identifier by the OLT220, resulting in uplink logical channel occupancy.

[0044] When an malfunctioning ONU240 illegally occupies the uplink logical channel identifier allocated by the OLT220 device, it directly affects the interaction between the ONU240, which is normally allocated the uplink logical channel identifier, and the OLT220 device. This leads to packet loss in the uplink services of the normally allocated ONU240, and in severe cases, disconnection, causing serious impact on services, including the following two aspects:

[0045] Firstly, due to differences in the states of different ONU240s, such as differences in signal strength or bandwidth, the manifestations of uplink logical channel occupancy are different. Furthermore, due to the non-steady-state characteristics of the ONU240 itself, it is difficult to detect uplink logical channel occupancy issues.

[0046] Secondly, in the dynamic allocation mechanism of logical channel identifiers, the problem of logical channel identifier occupancy exists implicitly, so it is difficult to locate the abnormal ONU240 with the uplink logical channel identifier occupancy.

[0047] Therefore, the above problem is caused by the abnormal operation of the ONU240 hardware and software, which leads to abnormal allocation and management of the uplink logical channel identifier in the OLT220 in the xPON network using TDMA operation mode, and interferes with the ONU240 that normally allocates this uplink logical channel identifier to the OLT220.

[0048] Based on the above, embodiments of the present invention provide a fault location detection method, a root node, a communication system topology, and a computer-readable storage medium. The fault location detection method includes, but is not limited to, the following steps: the root node in the communication system topology acquires a first communication quality parameter of a target leaf node, wherein the target leaf node is one of multiple leaf nodes in the communication system topology; when the first communication quality parameter does not meet a first preset communication quality parameter requirement, the root node acquires historical feature information of multiple leaf nodes and, based on the historical feature information, identifies a first leaf node suspected of interfering with the target leaf node; then, the root node controls the first leaf node to stop uploading data within a first uplink time slot of the target leaf node and acquires a second communication quality parameter of the target leaf node within the first uplink time slot; when the second communication quality parameter meets the second preset communication quality parameter requirement, the root node determines the first leaf node as a second leaf node interfering with the target leaf node. According to the technical solution of the embodiments of the present invention, the root node of the present invention can filter out a second leaf node, i.e., an abnormal leaf node, from multiple leaf nodes, solving the problem of the uplink logical channel of leaf nodes being occupied in the PToMP communication system topology and realizing the location of abnormal leaf nodes.

[0049] The embodiments of the present invention will be further described below with reference to the accompanying drawings.

[0050] like Figure 3 As shown, Figure 3 This is a schematic diagram of a system architecture platform 300 for performing a fault location and detection method according to an embodiment of the present invention.

[0051] exist Figure 3 In the example, the system architecture platform 300 includes a processor 310 and a memory 320, which can be connected via a bus or other means. Figure 3 Taking the example of a connection between China and Israel via a bus.

[0052] Memory 320, as a non-transitory computer-readable storage medium, can be used to store non-transitory software programs and non-transitory computer-executable programs. Furthermore, memory 320 may include high-speed random access memory, and may also include non-transitory memory, such as at least one disk storage device, flash memory device, or other non-transitory solid-state storage device. In some embodiments, memory 320 may optionally include memory remotely located relative to processor 310, and these remote memories can be connected to the system architecture platform via a network. Examples of such networks include, but are not limited to, the Internet, intranets, local area networks, mobile communication networks, and combinations thereof.

[0053] Those skilled in the art will understand that this system architecture platform can be applied to 3G communication network systems, LTE communication network systems, 5G communication network systems and subsequent evolved mobile communication network systems, etc., and this embodiment does not specifically limit it in this regard.

[0054] It will be understood by those skilled in the art that Figure 3 The system architecture platform shown does not constitute a limitation on the embodiments of the present invention, and may include more or fewer components than shown, or combine certain components, or have different component arrangements.

[0055] exist Figure 3 In the system architecture platform shown, the processor 310 can call the fault location detection program stored in the memory 320 to execute the fault location detection method.

[0056] Based on the above system architecture platform, various embodiments of the fault location and detection method of the present invention are proposed below.

[0057] like Figure 4 As shown, Figure 4 This is a flowchart of a fault location detection method provided in an embodiment of the present invention. The fault location detection method is applied to the root node in a communication system topology, wherein the communication system topology also includes multiple leaf nodes that communicate with the root node. The fault location detection method includes, but is not limited to, steps S100, S200, S300, S400 and S500.

[0058] Step S100: Obtain the first communication quality parameter of the target leaf node, wherein the target leaf node is one of multiple leaf nodes;

[0059] Step S200: When the first communication quality parameter does not meet the first preset communication quality parameter requirements, obtain the historical feature information of multiple leaf nodes;

[0060] Step S300: Based on historical feature information, determine the first leaf node of the suspected interference target leaf node among multiple leaf nodes;

[0061] Step S400: Control the first leaf node to stop uploading data in the first uplink time slot of the target leaf node, and obtain the second communication quality parameters of the target leaf node in the first uplink time slot;

[0062] Step S500: When the second communication quality parameter meets the second preset communication quality parameter requirements, determine the first leaf node as the second leaf node of the interference target leaf node.

[0063] Specifically, in the PToMP communication architecture topology using the TDMA mechanism, the root node acquires the first communication quality parameter of the target leaf node and compares it with a first preset communication quality parameter requirement. If the first communication quality parameter does not meet the first preset requirement, it indicates that the target leaf node has been interfered with by other leaf nodes, and this target leaf node is the interfered leaf node. Next, the root node acquires historical feature information from multiple leaf nodes and, based on the analysis of this information, identifies a first leaf node suspected of interfering with the target leaf node from among the remaining leaf nodes. Once the first leaf node is identified, the root node controls it to stop uploading data during the first uplink time slot of the target leaf node and acquires the second communication quality parameter of the target leaf node during that first uplink time slot. In other words, during the attempt to shut down the first leaf node, the root node observes whether the communication quality of the target leaf node recovers. When the second communication quality parameter meets the second preset communication quality parameter requirement—that is, if the communication quality of the target leaf node recovers during the shutdown period of the first leaf node—it indicates that the first leaf node that stopped uploading data is the interfering leaf node that is causing interference to the target leaf node. Therefore, the root node will determine that the first leaf node is the second leaf node interfering with the target leaf node; that is, the first leaf node is the interfering leaf node. Conversely, when the second communication quality parameter does not meet the second preset communication quality parameter requirement—that is, if the communication quality of the target leaf node does not recover during the shutdown period of the first leaf node—it indicates that the first leaf node that stopped uploading data is not the interfering leaf node that is causing interference to the target leaf node.

[0064] According to the technical solution of the embodiments of the present invention, the root node of the present invention can filter out the second leaf node that interferes with the target leaf node from multiple leaf nodes, i.e., the abnormal leaf node, thus solving the problem of the uplink logical channel of leaf nodes being occupied in the PToMP communication system topology and realizing the location of abnormal leaf nodes. Furthermore, the fault location detection method of the embodiments of the present invention can solve the problem of the uplink logical channel of leaf nodes being occupied in the PToMP communication architecture topology using the TDMA mechanism without relying on the cooperation of leaf nodes, and locate abnormal leaf nodes. In addition, since the embodiments of the present invention implement the dynamic monitoring of the uplink logical channel occupancy problem in software on the basis of existing hardware, it is simpler and more flexible, and the cost is also lower.

[0065] It should be noted that the first communication quality parameter mentioned above may include, but is not limited to, the number of times the target leaf node goes online and offline within a preset period, the number of uplink bit errors of the target leaf node within a preset period, the change in the number of times the target leaf node goes online and offline within a preset period, or the change in the number of uplink bit errors of the target leaf node within a preset period.

[0066] Additionally, it should be noted that the second communication quality parameter mentioned above may include, but is not limited to, the number of times the target leaf node goes online or offline within a preset period, the number of uplink bit errors of the target leaf node within a preset period, the change in the number of times the target leaf node goes online or offline within a preset period, or the change in the number of uplink bit errors of the target leaf node within a preset period.

[0067] Furthermore, it is understood that the aforementioned first and second preset communication quality parameter requirements include, but are not limited to, the following four situations:

[0068] The first scenario: When the first communication quality parameter and the second communication quality parameter are the number of times the user goes online or offline within a preset period, then the first preset communication quality parameter requirement and the second preset communication quality parameter requirement correspond to the threshold number of times the user goes online or offline.

[0069] The second scenario: When the first communication quality parameter and the second communication quality parameter are the uplink bit error rate within a preset period, then the first preset communication quality parameter requirement and the second preset communication quality parameter requirement correspond to the uplink bit error rate threshold.

[0070] The third scenario: When the first communication quality parameter and the second communication quality parameter are the changes in the number of online / offline cycles within a preset period, then the first preset communication quality parameter requirement and the second preset communication quality parameter requirement correspond to the threshold for the changes in the number of online / offline cycles.

[0071] The fourth scenario: When the first communication quality parameter and the second communication quality parameter are the uplink bit error rate changes within a preset period, then the first preset communication quality parameter requirement and the second preset communication quality parameter requirement correspond to the uplink bit error rate change threshold.

[0072] It should be noted that the first preset communication quality parameter requirement and the second preset communication quality parameter requirement can be the same. For example, when the first preset communication quality parameter requirement and the second preset communication quality parameter requirement are both thresholds for the number of online / offline interactions, then the thresholds for the number of online / offline interactions corresponding to the first preset communication quality parameter requirement and the second preset communication quality parameter requirement are the same. Alternatively, the first preset communication quality parameter requirement can be lower than the second preset communication quality parameter requirement. For example, when the first preset communication quality parameter requirement and the second preset communication quality parameter requirement are both thresholds for the number of online / offline interactions, then the threshold for the number of online / offline interactions corresponding to the first preset communication quality parameter requirement is lower than the threshold for the number of online / offline interactions corresponding to the second preset communication quality parameter requirement.

[0073] It is worth noting that the first uplink time slot for the aforementioned target leaf node is allocated by the root node based on the uplink logical channel identifier assigned to the target leaf node. Specifically, when the target leaf node registers, the root node assigns an uplink logical channel identifier to it. After the target leaf node completes registration, the root node also allocates a first uplink time slot to it based on the assigned uplink logical channel identifier, enabling the target leaf node to upload data within the first uplink time slot.

[0074] Additionally, it should be noted that the historical characteristic information of the aforementioned multiple leaf nodes includes, but is not limited to, the registration characteristic information of the multiple leaf nodes, or the business characteristic information that the leaf nodes have historically used.

[0075] Furthermore, step S300 above can be specifically divided into... Figure 5 or Figure 6 Two implementation methods. Among them, Figure 5 This is a flowchart illustrating the determination of the first leaf node in a fault location and detection method provided in an embodiment of the present invention. Figure 6 This is a flowchart illustrating the determination of the first leaf node in a fault location and detection method provided in another embodiment of the present invention.

[0076] like Figure 5 As shown, Figure 5 This is a flowchart illustrating the determination of the first leaf node in a fault location detection method according to an embodiment of the present invention. Step S300 includes, but is not limited to, steps S610, S620, S630, and S640.

[0077] Step S610: Control the target leaf node to stop uploading data in the second uplink time slot;

[0078] Step S620: When uplink data is obtained in the second uplink time slot but cannot be parsed, obtain the logical channel identifier corresponding to the target leaf node;

[0079] Step S630: Based on the logical channel identifier and historical feature information, determine the leaf node that matches the logical channel identifier among multiple leaf nodes as the first leaf node, wherein the historical feature information includes the logical channel identifiers of multiple leaf nodes.

[0080] Step S640: Control the target leaf node to restore the uploaded data.

[0081] Specifically, in the PToMP communication architecture topology using the TDMA mechanism, after the root node determines that the target leaf node is the interfered leaf node, in order to filter out the suspected leaf nodes that are suspected of interfering with the target leaf node from the other leaf nodes excluding the target leaf node.

[0082] First, in this embodiment of the invention, the data upload function of the target leaf node is turned off, that is, the target leaf node is controlled to stop uploading data in the second uplink time slot.

[0083] Next, the root node will determine whether it has received uplink data from the leaf node in the second uplink time slot. If it does not receive uplink data from the leaf node in the second uplink time slot, it means that the target leaf node does not have the problem of uplink logical channel identifier being occupied. If it receives uplink data from the leaf node in the second uplink time slot, it means that the target leaf node has the problem of uplink logical channel identifier being occupied.

[0084] Then, upon receiving uplink data from a leaf node, the root node parses the uplink data. If it cannot parse the uplink data, it indicates that the only way to find a suspected leaf node that might be interfering with the target leaf node is to use the logical channel identifier assigned to the target leaf node as the starting point. Specifically, in this embodiment of the invention, the logical channel identifier assigned to the target leaf node is obtained. This logical channel identifier is the identifier of the interfered logical channel. There can be one or more of the interfered logical channel identifiers. Then, the root node uses the interfered logical channel identifier as an index to search through the historical feature information of multiple leaf nodes, thereby finding the first leaf node corresponding to the logical channel identifier that is the same as the interfered logical channel identifier in the historical feature information. This first leaf node does not include the target leaf node, and this first leaf node is the suspected leaf node that might be interfering with the target leaf node.

[0085] It should be noted that the first uplink time slot mentioned above can be allocated according to preset rules. These preset rules include one of the following: bandwidth allocation rules corresponding to the priority of leaf nodes, fixed bandwidth allocation rules, and bandwidth allocation rules for multiple leaf nodes before the target leaf node stops uploading data.

[0086] In addition, it is understood that the second uplink time slot mentioned above can also be allocated according to the preset rules mentioned above. The preset rules include one of the following: bandwidth allocation rules corresponding to the priority of the leaf nodes, fixed bandwidth allocation rules, and bandwidth allocation rules for multiple leaf nodes before the target leaf node stops uploading data.

[0087] Additionally, it is worth noting that the first uplink time slot and the second uplink time slot mentioned above can be uplink time slots with the same bandwidth or uplink time slots with different bandwidths. Furthermore, the first uplink time slot and the second uplink time slot can be the same uplink time slot, or they can be two different uplink time slots.

[0088] like Figure 6 As shown, Figure 6 This is a flowchart illustrating the determination of the first leaf node in a fault location detection method provided in another embodiment of the present invention. Step S300 includes, but is not limited to, steps S710, S720, S730, and S740.

[0089] Step S710: Control the target leaf node to stop uploading data in the second uplink time slot;

[0090] Step S720: When uplink data is acquired and successfully parsed in the second uplink time slot, the feature parameters obtained from the parsed uplink data are acquired.

[0091] Step S730: Based on the feature parameters and historical feature information, determine the leaf node that matches the feature parameters among multiple leaf nodes as the first leaf node, wherein the historical feature information includes the feature parameters of multiple leaf nodes.

[0092] Step S740: Control the target leaf node to restore the uploaded data.

[0093] Specifically, in the PToMP communication architecture topology using the TDMA mechanism, after the root node determines that the target leaf node is the interfered leaf node, in order to filter out the suspected leaf nodes that are suspected of interfering with the target leaf node from the other leaf nodes excluding the target leaf node.

[0094] First, in this embodiment of the invention, the data upload function of the target leaf node is turned off, that is, the target leaf node is controlled to stop uploading data in the second uplink time slot.

[0095] Next, the root node will determine whether it has received uplink data from the leaf node in the second uplink time slot. If it does not receive uplink data from the leaf node in the second uplink time slot, it means that the target leaf node does not have the problem of uplink logical channel identifier being occupied. If it receives uplink data from the leaf node in the second uplink time slot, it means that the target leaf node has the problem of uplink logical channel identifier being occupied.

[0096] Then, upon receiving uplink data from a leaf node, the root node parses the uplink data. If the uplink data is successfully parsed, it indicates that a suspicious leaf node suspected of interfering with the target leaf node can be found using this uplink data as a starting point. Specifically, in this embodiment of the invention, feature parameters obtained from parsing the uplink data are acquired. Then, the root node uses the parsed feature parameters as an index to search through the historical feature information of multiple leaf nodes, thereby finding the first leaf node corresponding to the feature parameters that are the same as the parsed feature parameters in the historical feature information. This first leaf node does not include the target leaf node, and this first leaf node is the suspicious leaf node suspected of interfering with the target leaf node.

[0097] It should be noted that the above method of determining the leaf node that matches the feature parameters as the first leaf node among multiple leaf nodes based on feature parameters and historical feature information can be divided into the following two cases:

[0098] The first scenario: If the parsed feature parameters are the same as the currently configured feature parameters of the leaf node, then the leaf node is designated as the first leaf node, i.e., a suspicious leaf node.

[0099] The second scenario: When the parsed feature parameters cannot be the same as the currently configured feature parameters of the leaf node, the parsed feature parameters are used as the index to match and search for the feature parameters previously used by the leaf node. The matching leaf node is then selected as the first leaf node, i.e., the suspicious leaf node.

[0100] It is worth noting that, for the two scenarios described above, the historical feature information mentioned in this embodiment of the invention may include the feature information currently configured for the leaf node, or it may include the feature information previously configured for the leaf node. The currently configured feature information and the previously configured feature information may be registration feature information or business feature information.

[0101] In addition, the aforementioned feature parameters can also be registration feature information or business feature information.

[0102] It should be noted that the first uplink time slot mentioned above can be allocated according to preset rules. These preset rules include one of the following: bandwidth allocation rules corresponding to the priority of leaf nodes, fixed bandwidth allocation rules, and bandwidth allocation rules for multiple leaf nodes before the target leaf node stops uploading data.

[0103] In addition, it is understood that the second uplink time slot mentioned above can also be allocated according to the preset rules mentioned above. The preset rules include one of the following: bandwidth allocation rules corresponding to the priority of the leaf nodes, fixed bandwidth allocation rules, and bandwidth allocation rules for multiple leaf nodes before the target leaf node stops uploading data.

[0104] Additionally, it is worth noting that the first uplink time slot and the second uplink time slot mentioned above can be uplink time slots with the same bandwidth or uplink time slots with different bandwidths.

[0105] Furthermore, the step S400 above, which involves controlling the first leaf node to stop uploading data within the first uplink time slot of the target leaf node, can be specifically divided into... Figures 7 to 9 Three implementation methods. Among them, Figure 7 This is a flowchart illustrating the specific process of controlling the first leaf node to stop uploading data within the first uplink time slot of the target leaf node in a fault location and detection method provided in an embodiment of the present invention. Figure 8 This is a flowchart illustrating the specific process of controlling the first leaf node to stop uploading data within the first uplink time slot of the target leaf node in the fault location and detection method provided in another embodiment of the present invention. Figure 9 This is a flowchart illustrating the specific process of controlling the first leaf node to stop uploading data within the first uplink time slot of the target leaf node in a fault location and detection method provided in another embodiment of the present invention.

[0106] like Figure 7 As shown, Figure 7 This is a flowchart illustrating the specific process of controlling the first leaf node to stop uploading data within the first uplink time slot of the target leaf node in a fault location and detection method according to an embodiment of the present invention. The step S400 above, which involves controlling the first leaf node to stop uploading data within the first uplink time slot of the target leaf node, includes, but is not limited to, step S810.

[0107] Step S810: Obtain the current status of the first leaf node. If the current status is unregistered, send registration information to the first leaf node to switch the first leaf node from unregistered to registered online status, and control the first leaf node to stop uploading data in the first uplink time slot of the target leaf node.

[0108] like Figure 8 As shown, Figure 8This is a flowchart illustrating the specific process of controlling the first leaf node to stop uploading data within the first uplink time slot of the target leaf node in a fault location and detection method provided in another embodiment of the present invention. The control of the first leaf node to stop uploading data within the first uplink time slot of the target leaf node in step S400 includes, but is not limited to, step S820.

[0109] Step S820: Obtain the current status of the first leaf node. When the current status is registered online, control the first leaf node to stop uploading data in the first uplink time slot of the target leaf node.

[0110] like Figure 9 As shown, Figure 9 This is a flowchart illustrating the specific process of controlling the first leaf node to stop uploading data within the first uplink time slot of the target leaf node in a fault location and detection method provided in another embodiment of the present invention. The control of the first leaf node to stop uploading data within the first uplink time slot of the target leaf node in step S400 includes, but is not limited to, step S830.

[0111] Step S830: Obtain the current state of the first leaf node. If the current state is offline, control the first leaf node to stop uploading data within the first uplink time slot of the target leaf node.

[0112] In addition, one embodiment of the present invention provides a specific process for filtering out a second leaf node from the first leaf node. The process is as follows: after filtering the first leaf nodes in both the unregistered and registered states, if a second leaf node interfering with the target leaf node still cannot be selected, the embodiment of the present invention will use the first leaf node in the offline state as the second leaf node interfering with the target leaf node.

[0113] In addition, such as Figure 10 As shown, Figure 10 This is a flowchart illustrating the subsequent uploading of feature parameters of the second leaf node in a fault location detection method provided by an embodiment of the present invention. Following step S500, the method further includes, but is not limited to, steps S910 and S920.

[0114] Step S910: Obtain the feature parameters of the second leaf node;

[0115] Step S920: Send the feature parameters of the second leaf node to the fault handling platform.

[0116] Specifically, after the root node locates the second leaf node of the interfering target leaf node, the root node will obtain the feature parameters of the second leaf node and send the feature parameters of the second leaf node to the fault handling platform.

[0117] It is understood that the aforementioned fault handling platforms include, but are not limited to, network management or other operation and maintenance platforms.

[0118] In addition, it is understood that the aforementioned feature parameters include, but are not limited to, registration feature parameters or business feature parameters.

[0119] To describe more clearly Figures 4 to 10 The fault location and detection method in the present invention, exemplarily, is based on the following embodiments. Figure 2 The xPON network in this context will be explained in detail. Figure 2 The xPON network, the above Figures 4 to 10 The leaf node mentioned in the fault location and detection method can be corresponding to: Figure 2 In the xPON network, the ONU, and secondly, the root node can correspond to... Figure 2 The OLT in the xPON network.

[0120] Combination Figure 2 and Figures 4 to 10 Specifically, such as Figure 11 As shown, Figure 11 This is a flowchart of the xPON network topology authorization process provided in one embodiment of the present invention. Taking GPON as an example, other systems are similar.

[0121] Specifically, the GPON GTC (Gigabit Pon Transmission Convergence) system provides media access control for uplink service flows: downlink frames indicate the allowed position of the uplink flow in the uplink frame through BWMAP (BandWidthmap), and the uplink and downlink frames are synchronized.

[0122] The OLT sends pointers in the PCBd, indicating the start and end times of each ONU's uplink transmission. This ensures that only one ONU can access the medium at any given time, preventing collisions during normal operation. The pointers are byte-level, allowing the OLT to effectively statically control the medium at a bandwidth granularity of 64 kbit / s. However, some OLT applications may choose a larger pointer granularity to achieve better dynamic bandwidth scheduling control. Figure 11 The pointers in the example are sent in ascending order. The OLT is required to send pointers to each ONU in ascending order of their start time; it is recommended that all pointers be sent in ascending order of their start time.

[0123] BWMAP is a vector array of 8-byte allocation structures, where each entry in the array represents a bandwidth allocated to a specific T-CONT.

[0124] The Allocation ID field is 12 bits and is used to indicate the specific T-CONT corresponding to the PON uplink stream authorization time.

[0125] The Start field is 16 bits long and is used to indicate the start time of the allocated time slot. This time is in bytes, starting from 0 in the uplink frame, and the size of the uplink frame is limited to no more than 65536 bytes, which can meet the uplink rate requirement of 2.488Gb / s.

[0126] The End field is 16 bits long and is used to indicate the end time of the allocated time slot. This time is in bytes and starts from 0 in the uplink frame, indicating the last valid data byte allocated.

[0127] In addition, combined Figure 2 , Figures 4 to 10 and Figure 11 ,like Figure 12 As shown, Figure 12 This is a flowchart of a fault location and detection method in an xPON network provided by an embodiment of the present invention, including but not limited to steps S1010, S1020, S1030, S1040, S1050, S1060, S1070, S1080 and S1090.

[0128] Step S1010: The OLT maintains a list of historical ONU characteristic information based on the PON port and initializes a suspicious ONU record table and an interfering ONU record table.

[0129] Specifically, in an xPON network, the OLT central office equipment maintains a list of historical ONU characteristic information based on the PON port. The characteristic values ​​in the ONU historical characteristic information list refer to the characteristic values ​​that can uniquely identify an ONU and its registration or service on the optical link. The registration characteristic values ​​include, but are not limited to, the ONU registration MAC (Media Access Control) address, SN (Series number), LOID (Logical ONU Identifier), and registration status. The service characteristic values ​​include, but are not limited to, the LLID assigned to the ONU in the EPON network, the AllocID assigned to the ONU in the GPON network, the MAC address of the ONU carrying the service, and the VLAN (Virtual Local Area Network) of the ONU carrying the service.

[0130] The ONU historical feature information list under the PON port records the registered and authenticated ONU information based on the ONU registration identifier, taking the PON port as the unit. It records the historical feature values ​​of the ONU within a certain period. The OLT updates the historical feature values ​​of the ONU according to a certain strategy. When the ONU comes online for the first time, it records the relevant feature values ​​into the feature information list using the relevant feature values ​​of the ONU as the index. In the process of obtaining the ONU service feature values ​​and recording them into the feature value list, if the ONU service feature values ​​change, the changed values ​​are recorded into the feature information list.

[0131] It is understood that the aforementioned "certain period" includes, but is not limited to, manually specified periods or configurations based on certain policies. Furthermore, the aforementioned ONU-related characteristic values ​​include, but are not limited to, the logical channel identifier assigned to the ONU by the OLT. Additionally, the aforementioned ONU service characteristic values ​​include, but are not limited to, the logical channel identifier and VLAN. Moreover, changes to the aforementioned ONU service characteristic values ​​include, but are not limited to, adding or modifying configurations.

[0132] For new ONUs, this includes, but is not limited to, situations where the ONU's logical channel identifier may be affected when the ONU, based on its registration identifier, is first brought online to the OLT or when its configuration data on the OLT is deleted and rebuilt.

[0133] It is understandable that the ONU registration identifiers mentioned above include, but are not limited to, MAC address, SN, etc.

[0134] In addition, the root node also maintains a suspicious ONU record table and an interfering ONU record table, recording the registration and authentication information of relevant ONUs according to certain strategies; after the OLT is powered on, the suspicious ONU record table and the interfering ONU record table are initialized.

[0135] It is understood that the ONU registration and authentication information mentioned above includes, but is not limited to, ONU index, ONU registration information, and ONU service configuration information. ONU registration information includes, but is not limited to, MAC address, SN, and LOID. ONU service configuration information includes, but is not limited to, explicitly or implicitly configured logical channel identifiers and service VLANs.

[0136] Combination Figure 2 and Figures 4 to 10 , specifically, Figure 12 The ONU historical feature information list mentioned in the document can correspond to Figures 4 to 10 The historical feature information mentioned in the document can be represented by feature values.

[0137] Step S1020: The OLT maintains the first behavior characteristic threshold and the second behavior characteristic threshold for the corresponding ONU based on the PON port. When the behavior characteristic of the ONU exceeds the first behavior characteristic threshold, the ONU is set as the interfered ONU.

[0138] Specifically, in the xPON network, the OLT maintains a first behavioral characteristic threshold and a second behavioral characteristic threshold for each ONU based on the PON port. The first and second behavioral characteristic thresholds are set according to relevant parameters. The first behavioral characteristic threshold is a detection trigger threshold; when a characteristic behavior exceeds the first behavioral characteristic threshold, a fault is considered to have occurred, and the ONU is identified as an interfered ONU, thus executing step S1030. The second behavioral characteristic threshold is a fault recovery threshold; when a characteristic behavior falls below the second behavioral characteristic threshold, the fault is considered to have recovered.

[0139] It is understandable that the relevant parameters mentioned above include, but are not limited to, the absolute number of online / offline cycles for specific reasons within a certain period of the ONU, the absolute number of uplink bit errors within a certain period of the ONU, the changes in the number of online / offline cycles for specific reasons based on historical statistics, and the changes in the relative number of uplink bit errors based on historical statistics.

[0140] In addition, it is understandable that the aforementioned ONU characteristic behaviors can be queried and statistically analyzed on the OLT, specifically including but not limited to the number of online / offline cycles and uplink bit errors.

[0141] Additionally, it is understandable that the specific reasons mentioned above refer to the ONU going offline or offline due to uplink abnormalities, excluding ONU power failures, manual deactivation of ONUs, etc., when the ONU optical power indicators on the OLT side are normal.

[0142] It should be noted that the aforementioned behavioral characteristics correspond to the aforementioned communication quality parameters; the aforementioned first behavioral characteristic threshold and second behavioral characteristic threshold are respectively equivalent to the aforementioned first communication quality parameter requirements and second communication quality parameter requirements.

[0143] In step S1030, the OLT sets timer T1 and controls the interfered ONU to disable uplink illumination before T1 expires.

[0144] Specifically, the OLT in the xPON network sets a timer T1 for the specific ONU being interfered with, and disables the uplink emission of the interfered ONU before T1 expires.

[0145] It is understandable that the prohibition of uplink emission of the interfered ONU before the T1 timeout includes, but is not limited to, for ONUs in EPON networks, the OLT downlink direction shuts down the ONU uplink laser within a specified time T1 through the extended OAM protocol or requires the ONU to remain silent through the MPCP protocol: for ONUs in GPON networks, the OLT downlink direction shuts down the ONU uplink laser within a specified time T1 through the PLOAM protocol.

[0146] In step S1040, the OLT continues to authorize the interfered ONU, detects the authorization window signal, and determines whether data is received. If data is received but cannot be parsed, step S1050 is executed; if data is received and successfully parsed, step S1060 is executed; if no data is received, step S1090 is executed.

[0147] Specifically, in the xPON network, the OLT will continue to allocate uplink time slot grant windows according to certain DBA rules based on the logical channel identifier configured for the interfered ONU. The OLT checks whether there is uplink data in the uplink time slot grant window corresponding to the interfered ONU; if T1 has not timed out, it continues to allocate uplink time slot grant windows for the specified logical channel identifier according to certain DBA rules, and continues to check until T1 times out.

[0148] It should be noted that by continuing to allocate bandwidth to the uplink logical channel identifier corresponding to the interfered ONU, without changing the data on the PON port or the bandwidth allocation under fault conditions, false detection or misjudgment caused by changes in fault state can be avoided.

[0149] If a signal is detected in the aforementioned uplink time slot authorization window, but the signal data cannot be parsed, then there may be an uplink logical channel interference problem, and the process will jump to step S1050.

[0150] If a signal is detected in the aforementioned uplink time slot grant window and the signal data can be effectively parsed, then there is an uplink logical channel interference problem. In this case, the data obtained from multiple rounds of grant window allocation within the T1 timeout is recorded and compared. The ONU feature values ​​in these data are parsed, and all different feature values ​​are recorded. Then, the process jumps to step S1060.

[0151] If no signal or data is detected in the aforementioned uplink time slot authorization window and T1 times out, it is assumed that there is no uplink logical channel interference problem, and the process jumps to step S1090.

[0152] Additionally, it should be noted that the DBA rule refers to allocating bandwidth according to the high priority of each ONU under the PON port, or according to a fixed bandwidth, or according to the last bandwidth of the ONU before it was powered off, and maintaining the authorization before the T1 timeout.

[0153] In addition, after T1 timeout, the OLT restarts the uplink laser for the interfered ONU and authorizes it normally.

[0154] It is understandable that the authorization window during the T1 period mentioned above is equivalent to the second uplink time slot mentioned above.

[0155] Step S1050: Retrieve historical feature values ​​of ONUs and find all ONUs that use the same logical channel identifier as the interfered ONU, as suspected ONUs.

[0156] Specifically, when a signal is detected in the uplink time slot authorization window, but the data cannot be parsed, this embodiment of the invention will list all ONUs that have used the uplink logical channel identifier of the interfered ONU in the ONU historical feature information list under the PON port as suspicious ONUs and record them in the suspicious ONU list.

[0157] For example, firstly, the logical channel identifier of the interfered ONU is obtained and set as the interfered logical channel identifier. If the interfered ONU has multiple logical channel identifiers, all of these are set as the interfered logical channel identifier. Then, the ONU historical feature information list is searched using the interfered logical channel identifier as an index. Next, all ONUs in the ONU historical feature information list whose logical channel identifier is the same as the interfered logical channel identifier, but whose ONU registration information is different from that of the interfered ONU, are set as suspicious ONUs. Finally, all suspicious ONUs are added to the suspicious ONU list.

[0158] Step S1060: Retrieve the current feature value of the ONU and find all ONUs that use the same logical channel identifier as the interfered ONU, and identify them as suspicious ONUs.

[0159] Specifically, when data is detected within the uplink time slot authorization window and the data can be effectively parsed, this embodiment of the invention will parse the registration feature value or service feature value in the uplink data. Using the registration feature value or service feature value as an index, ONU information in the ONU historical feature value list is retrieved, and the ONU currently in use with a matching information feature value is found and added to the suspicious ONU list. Alternatively, the information carried in the uplink message is compared with the ONU historical feature value list maintained by the OLT; if a matching entry exists, the ONU is added to the suspicious ONU list.

[0160] For example, firstly, valid data is parsed from the upstream data. Then, if the registration feature value or service feature value parsed from the valid data is the same as the registration feature value or service feature value of the ONU currently configured in the OLT, the ONU is marked as a suspicious ONU. If the registration feature value parsed from the valid data cannot match the ONU data currently configured in the OLT, the historical feature information list of ONUs is queried using the registration feature value or service feature value as an index, and the corresponding matching item is found, and the relevant ONU is marked as a suspicious ONU. Finally, all suspicious ONUs are added to the suspicious ONU list.

[0161] Step S1070: Set timer T2, turn off the suspected ONU, and observe whether the fault of the interfered ONU disappears. Based on the fault of the interfered ONU, filter out the interfering ONU that causes interference to the interfered ONU from the suspected ONU.

[0162] Specifically, after T1 timeout, the OLT activates the laser for the interfered ONU, allowing the ONU to receive normal bandwidth allocation from the OLT and complete ONU online access and uplink data transmission. Simultaneously, a T2 timer is set according to a specific strategy to process suspicious ONUs in the suspicious ONU list, as follows:

[0163] If the suspected ONU is in an unregistered state, then after registering the suspected ONU, start timer T2, turn off the uplink illumination of the suspected ONU, and observe the state of the interfered ONU. If it is in a registered state or has an uplink bit error, and its behavioral characteristic value is less than the second behavioral characteristic threshold when T2 times out, then the fault is considered to have disappeared, and the suspected ONU is an interfering ONU. It is removed from the suspected ONU list and added to the interfering ONU list; otherwise, the suspected ONU is re-unregistered and removed from the suspected ONU list.

[0164] If the suspected ONU is in a registered online state, then timer T2 is started for the suspected ONU, its uplink illumination is turned off, and the state of the interfered ONU is observed. If it is in a registered state or has an uplink error, and its behavioral characteristic value is less than the second behavioral characteristic threshold when T2 times out, then the fault is considered to have disappeared, and the suspected ONU is an interfering ONU. It is removed from the suspected ONU list and added to the interfering ONU list. Otherwise, the uplink illumination of the suspected ONU is turned on again, it is authorized normally, and it is removed from the suspected ONU list.

[0165] If the suspected ONU is in an offline state, and the fault still exists after polling and processing of the suspected ONUs in the unregistered and registered online states, then the suspected ONU in the offline state will be removed from the suspected ONU list and added to the interfering ONU list; otherwise, the suspected ONU in the offline state will be removed from the suspected ONU list.

[0166] It is understandable that the authorization window during the T2 period mentioned above is equivalent to the first uplink time slot mentioned above.

[0167] Step S1080: Report the interfering ONUs in the interfering ONU list to the fault handling platform and troubleshoot the fault.

[0168] Specifically, in this embodiment of the invention, the root node will report the interfering ONUs in the above-mentioned interfering ONU list to the network management or other operation and maintenance platform through alarm messages or notification messages, and carry their information in the historical registration and authentication information table of ONUs under the PON port, and process them in combination with user ledger information.

[0169] Step S1090, End.

[0170] According to the technical solution of this embodiment of the invention, the OLT of this invention can filter out the interfering ONU that causes interference to the interfered ONU from multiple ONUs, i.e., the abnormal ONU, thus solving the problem of ONU uplink logical channel occupancy in xPON network topologies and realizing the location of abnormal ONUs. Furthermore, the fault location and detection method of this embodiment of the invention can solve the problem of ONU uplink logical channel occupancy in xPON network topologies using TDMA mechanisms without relying on the cooperation of ONUs, and locate abnormal ONUs. In addition, since this embodiment of the invention uses software to implement dynamic monitoring of uplink logical channel occupancy on the basis of existing hardware, it is simpler, more flexible, and lower in cost.

[0171] Based on the fault location and detection method described in the above embodiments, the following presents various embodiments of the root node, communication system topology, and computer-readable storage medium of the present invention.

[0172] In addition, one embodiment of the present invention provides a root node, which includes: a memory, a processor, and a computer program stored in the memory and executable on the processor.

[0173] The processor and memory can be connected via a bus or other means.

[0174] It should be noted that the root node in this embodiment can correspond to including, for example, the following: Figure 3 The memory and processor in the illustrated embodiment can constitute Figure 3 The system architecture platform shown in the embodiment is part of the same inventive concept, and therefore has the same implementation principle and beneficial effects, which will not be described in detail here.

[0175] The non-transient software program and instructions required to implement the fault location and detection method of the above embodiments are stored in memory. When executed by a processor, the fault location and detection method of the above embodiments is executed, for example, the method described above is executed. Figure 4 Method steps S100 to S500 Figure 5 Method steps S610 to S640 in the text Figure 6 Method steps S710 to S740 in the text Figure 7 Method steps S810, Figure 8 Method steps S820, Figure 9 Method steps S830, Figure 10 Method steps S910 to S920 in the text Figure 12 Method steps S1010 to S1090.

[0176] It should be noted that the specific implementation methods and technical effects of the root node in the embodiments of the present invention can be referred to the specific implementation methods and technical effects of the fault location and detection method in the above embodiments.

[0177] In addition, one embodiment of the present invention provides a communication system topology, including multiple leaf nodes and the aforementioned root node, wherein the root node communicates with the multiple leaf nodes.

[0178] It should be noted that the specific implementation methods and technical effects of the root node in the embodiments of the present invention can be referred to the specific implementation methods and technical effects of the fault location and detection method in the above embodiments.

[0179] Furthermore, one embodiment of the present invention also provides a computer-readable storage medium storing computer-executable instructions, which, when used to execute the fault location and detection method described above, for example, execute the above-described... Figure 4 Method steps S100 to S500 Figure 5 Method steps S610 to S640 in the text Figure 6 Method steps S710 to S740 in the text Figure 7 Method steps S810, Figure 8 Method steps S820, Figure 9 Method steps S830, Figure 10 Method steps S910 to S920 in the text Figure 12 Method steps S1010 to S1090.

[0180] It will be understood by those skilled in the art that all or some of the steps and systems in the methods disclosed above can be implemented as software, firmware, hardware, and suitable combinations thereof. Some or all of the physical components can be implemented as software executed by a processor, such as a central processing unit, digital signal processor, or microprocessor, or as hardware, or as an integrated circuit, such as an application-specific integrated circuit. Such software can be distributed on a computer-readable medium, which can include computer storage media (or non-transitory media) and communication media (or transient media). As is known to those skilled in the art, the term computer storage media includes volatile and non-volatile, removable and non-removable media implemented in any method or technology for storing information (such as computer-readable instructions, data structures, program modules, or other data). Computer storage media includes, but is not limited to, RAM, ROM, EEPROM, flash memory or other memory technologies, CD-ROM, digital versatile disc (DVD) or other optical disc storage, magnetic cartridges, magnetic tape, disk storage or other magnetic storage devices, or any other medium that can be used to store desired information and is accessible to a computer. Furthermore, as is known to those skilled in the art, communication media typically include computer-readable instructions, data structures, program modules, or other data in modulated data signals such as carrier waves or other transmission mechanisms, and may include any information delivery medium.

[0181] The above provides a detailed description of the preferred embodiments of the present invention. However, the present invention is not limited to the above embodiments. Those skilled in the art can make various equivalent modifications or substitutions without departing from the spirit of the present invention. All such equivalent modifications or substitutions are included within the scope defined by the claims of the present invention.

Claims

1. A fault location and detection method, applied to a root node in a communication system topology, wherein the communication system topology further includes multiple leaf nodes communicating with the root node, the method comprising: Obtain the first communication quality parameter of the target leaf node, wherein the target leaf node is one of the plurality of leaf nodes; When the first communication quality parameter does not meet the first preset communication quality parameter requirement, the historical feature information of multiple leaf nodes is obtained. The fact that the first communication quality parameter does not meet the first preset communication quality parameter requirement indicates that the target leaf node is interfered with by other leaf nodes. Based on the historical feature information, determine the first leaf node suspected of interfering with the target leaf node from among the multiple leaf nodes; Control the first leaf node to stop uploading data in the first uplink time slot of the target leaf node, and obtain the second communication quality parameter of the target leaf node in the first uplink time slot; When the second communication quality parameter meets the second preset communication quality parameter requirement, the first leaf node is determined to be the second leaf node interfering with the target leaf node; wherein, the second communication quality parameter meeting the second preset communication quality parameter requirement indicates that the communication quality of the target leaf node was restored during the shutdown of the first leaf node.

2. The method according to claim 1, characterized in that, The step of determining a first leaf node suspected of interfering with the target leaf node from among multiple leaf nodes based on the historical feature information includes: Control the target leaf node to stop uploading data in the second uplink time slot; When uplink data is acquired in the second uplink time slot and the uplink data cannot be parsed, the logical channel identifier corresponding to the target leaf node is acquired; Based on the logical channel identifier and the historical feature information, a leaf node matching the logical channel identifier is determined from among the multiple leaf nodes as the first leaf node, wherein the historical feature information includes the logical channel identifiers of the multiple leaf nodes; Control the target leaf node to resume uploading data.

3. The method according to claim 1, characterized in that, The step of determining a first leaf node suspected of interfering with the target leaf node from among multiple leaf nodes based on the historical feature information includes: Control the target leaf node to stop uploading data in the second uplink time slot; When uplink data is acquired and successfully parsed within the second uplink time slot, the feature parameters obtained from the parsed uplink data are acquired. Based on the feature parameters and the historical feature information, a leaf node that matches the feature parameters is determined from among the multiple leaf nodes as the first leaf node, wherein the historical feature information includes the feature parameters of the multiple leaf nodes; Control the target leaf node to resume uploading data.

4. The method according to claim 2 or 3, characterized in that, The first uplink time slot and / or the second uplink time slot are allocated according to a preset rule, wherein the preset rule includes one of the following: a bandwidth allocation rule corresponding to the priority of the leaf node, a fixed bandwidth allocation rule, and a bandwidth allocation rule for multiple leaf nodes before the target leaf node stops uploading data.

5. The method according to claim 1, characterized in that, The control of the first leaf node to stop uploading data in the first uplink time slot of the target leaf node includes at least one of the following: Obtain the current state of the first leaf node. If the current state is unregistered, send registration information to the first leaf node to switch the first leaf node from the unregistered state to the registered online state, and control the first leaf node to stop uploading data in the first uplink time slot of the target leaf node. Obtain the current state of the first leaf node; when the current state is registered online, control the first leaf node to stop uploading data in the first uplink time slot of the target leaf node. Obtain the current state of the first leaf node. If the current state is offline, control the first leaf node to stop uploading data in the first uplink time slot of the target leaf node.

6. The method according to claim 1, characterized in that, After determining that the first leaf node is the second leaf node interfering with the target leaf node, the method further includes: Obtain the feature parameters of the second leaf node; The characteristic parameters of the second leaf node are sent to the fault handling platform.

7. The method according to claim 1, characterized in that, The communication quality parameters include at least one of the following: The number of times a user goes online or offline within a preset period; The number of uplink bit errors within a preset period; The change in the number of times the line goes online or offline within a preset period; The change in the number of uplink bit errors within a preset period.

8. The method according to claim 3 or 6, characterized in that, The feature parameters include registration feature parameters and / or business feature parameters.

9. A root node, characterized in that, include: The system includes a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor, when executing the computer program, implements the fault location detection method as described in any one of claims 1 to 8.

10. A communication system, characterized in that, It includes multiple leaf nodes and a root node as described in claim 9, wherein the root node communicates with the multiple leaf nodes.

11. A computer-readable storage medium, characterized in that, The device stores computer-executable instructions for performing the fault location and detection method as described in any one of claims 1 to 8.

Images