A distribution network coordination networking device and method fusing a pole-mounted circuit breaker FTU and a ring main unit DTU

Abstract

The application discloses a distribution network cooperative networking device fusing a pole-mounted circuit breaker FTU and a ring network box DTU, and the device comprises a memory and a processor, and the memory and the processor are configured to perform the following operations: obtaining a data packet to be sent; judging whether the proportion of non-forwarding data packets and forwarding data packets is less than a proportion threshold; if yes, performing enhanced scheduling sorting on a sending cache queue, and the enhanced scheduling sorting comprises: selecting data packets from the sending cache queue to construct a sending window according to a preset window entry quota; and for the data packets entering the sending window, reordering the data packets in the sending window based on the remaining time limit, the freshness, the closed-loop correlation, the fair compensation value and whether the data packet is a forwarding data packet of each data packet. The application can improve the adaptability of the sending order to a mixed service scenario, and takes into account the timeliness, the closed-loop service demand and the sending fairness, thereby improving the rationality and reliability of data uploading.

Description

Technical Field

[0001] This invention relates to the field of power grid monitoring technology, and in particular to a distribution network collaborative networking device and method that integrates pole-mounted circuit breaker (FTU) and ring main unit (DTU). Background Technology

[0002] With the development of distribution automation and smart distribution networks, the collaborative networking technology of pole-mounted circuit breaker (FTU) and ring main unit (DTU) is gradually being applied. Typically, FTUs are deployed on the pole-mounted switch and circuit breaker side of overhead lines to collect line operating status, fault information, and switch position information; DTUs are deployed on the ring main unit, substation, or ring main cabinet side to collect multi-circuit operating data and perform control. By integrating FTUs and DTUs into a unified distribution automation system, line status monitoring, fault location, fault isolation, and power restoration to non-faulty areas can be achieved. This is widely used in scenarios involving mixed power supply of overhead and cable lines, automation upgrades of suburban distribution networks, and scenarios with high power supply reliability requirements. For example, the existing technology CN101924391A adopts a distribution network feeder automation system based on a wireless ad hoc network. It connects to a host computer SCADA monitoring system with the wireless ad hoc network, forming a two-layer network. Using DSR and DSDV routing protocols, combined with remote control terminals, distribution transformer terminals, and relay routes, it achieves wireless information transmission and fault monitoring and management.

[0003] In the aforementioned collaborative networking scenario, both the FTU and DTU need to send data to the master station. When the DTU only needs to send data packets generated by itself to the master station, it is usually feasible to sort and send the data packets in order according to existing communication protocols or protocol layer standards. This is because, in this scenario, the source of the data packets to be sent is relatively singular, and existing communication protocols can complete basic sorting based on general communication rules such as priority, Quality of Service (QoS), or queue order, thereby meeting general data upload requirements. However, the inventors of this application have discovered that in the distribution network collaborative networking scenario of merging pole-mounted circuit breaker (FTU) and ring network box (DTU), in addition to sending its own generated data packets to the master station, the DTU may also need to forward data packets sent from the FTU to the DTU to the master station. At this time, the DTU's sending buffer queue contains both non-forwarded data packets and forwarded data packets. The sorting algorithms provided by existing communication protocols are mainly designed for general communication transmission scenarios, and usually only sort data packets based on basic attributes at the communication layer, making it difficult to adapt to this type of mixed sending scenario. Specifically, existing communication protocols typically cannot further optimize the transmission order by considering factors such as whether a data packet is a forwarded packet, the timeliness differences of the services carried by the data packet, its relevance to fault handling or control loops, and the fairness of transmission between data packets from different sources. Therefore, directly sending data according to the existing communication protocol's ordering results makes it difficult to accommodate the different transmission needs of DTU local data packets and FTU forwarded data packets in actual service operations.

[0004] Therefore, optimizing the sorting of data packets in the sending buffer queue when the DTU simultaneously sends its own generated data packets and forwarded data packets, in order to improve the rationality of data transmission in mixed sending scenarios, has become an urgent technical problem to be solved. Summary of the Invention

[0005] To address existing needs, this application proposes a distribution network collaborative networking method integrating pole-mounted circuit breaker (FTU) and ring main unit (DTU). The method includes: first, acquiring the data packets to be sent from the transmission buffer queue and determining the ratio of non-forwarded data packets to forwarded data packets; when the ratio is less than a threshold, initiating enhanced scheduling and sorting, constructing a transmission window using a preset ingress quota, and reordering the data packets within the window based on remaining time, freshness, closed-loop correlation, fair compensation value, and whether they are forwarded data packets before transmission; when the ratio is greater than or equal to the threshold, transmitting directly according to the current sorting order. Through these technical means, when the DTU simultaneously transmits local data packets and the FTU forwards data packets, the adaptability of the transmission order to mixed service scenarios can be improved, taking into account timeliness, closed-loop service requirements, and transmission fairness, thereby enhancing the rationality and reliability of data transmission.

[0006] This application provides a distribution network collaborative networking device that integrates a pole-mounted circuit breaker (FTU) and a ring main unit (DTU). The device is installed at the DTU and includes:

[0007] Memory; and

[0008] A processor coupled to memory, the memory and processor being configured to perform the following operations:

[0009] Retrieve the data packets to be sent from the send buffer queue;

[0010] Determine whether the ratio of non-forwarded data packets to forwarded data packets in the send buffer queue is less than a ratio threshold. Forwarded data packets are data packets sent from the FTU to the DTU, while non-forwarded data packets are data packets generated by the DTU.

[0011] If the ratio of non-forwarded packets to forwarded packets in the transmit buffer queue is less than a ratio threshold, then enhanced scheduling and sorting are performed on the transmit buffer queue. Enhanced scheduling and sorting include:

[0012] Based on the preset inbound quota, select data packets from the send buffer queue to construct the send window;

[0013] For data packets entering the sending window, the data packets in the sending window are reordered based on the remaining time limit, freshness, closed-loop correlation, fair compensation value and whether they are forwarded data packets, to obtain the sending order;

[0014] Based on the sending order, the data packets within the sending window are sent to the main station.

[0015] In a preferred embodiment, the memory and processor are further configured to perform the following operations:

[0016] If the ratio of non-forwarded data packets to forwarded data packets in the sending buffer queue is greater than or equal to the ratio threshold, then data packets are sent to the main station according to the current sorting order of the sending buffer queue.

[0017] In a preferred embodiment, selecting data packets from the send buffer queue to construct a send window according to a preset ingress window quota includes:

[0018] Read the packet category identifier for each packet in the send buffer queue;

[0019] The category of each packet in the send buffer queue is determined based on the packet category identifier;

[0020] Based on the inbound quota and the category of each data packet in the send buffer queue, a portion of the data packets in the send buffer queue are placed into the send window, where the inbound quota is associated with the category of the data packet.

[0021] In a preferred embodiment, the memory and processor are further configured to perform the following operations:

[0022] The remaining time limit is determined based on the remaining time between the current moment and the latest allowed time for data transmission.

[0023] Freshness is determined based on the timeliness of the data carried by the data packet relative to the current moment;

[0024] The closed-loop correlation is determined based on the degree of correlation between the data packet and at least one of the fault handling closed-loop, remote control closed-loop, and protection action feedback closed-loop.

[0025] The fair compensation value is determined based on the degree of compensation for data packets sent within a preset statistical range.

[0026] In a preferred embodiment, reordering data packets within the sending window based on the remaining time limit, freshness, closed-loop correlation, fair compensation value, and whether the data packet is a forwarding data packet includes:

[0027] The ranking value of each data packet is determined based on its remaining time limit, freshness, closed-loop correlation, fair compensation value, and whether it is a forwarded data packet.

[0028] The data packets within the sending window are reordered based on their sorting values ​​to obtain the sending order;

[0029] The data packets within the sending window are sent to the main station based on the sending order.

[0030] This application also provides a method for coordinated networking of a distribution network integrating a pole-mounted circuit breaker (FTU) and a ring main unit (DTU). The method is executed by the DTU and includes:

[0031] Retrieve the data packets to be sent from the send buffer queue;

[0032] Determine whether the ratio of non-forwarded data packets to forwarded data packets in the send buffer queue is less than a ratio threshold. Forwarded data packets are data packets sent from the FTU to the DTU, while non-forwarded data packets are data packets generated by the DTU.

[0033] If the ratio of non-forwarded packets to forwarded packets in the transmit buffer queue is less than a ratio threshold, then enhanced scheduling and sorting are performed on the transmit buffer queue. Enhanced scheduling and sorting include:

[0034] Based on the preset inbound quota, select data packets from the send buffer queue to construct the send window;

[0035] For data packets entering the sending window, the data packets in the sending window are reordered based on the remaining time limit, freshness, closed-loop correlation, fair compensation value and whether they are forwarded data packets, to obtain the sending order;

[0036] Based on the sending order, the data packets within the sending window are sent to the main station.

[0037] In a preferred embodiment, the method further includes:

[0038] If the ratio of non-forwarded data packets to forwarded data packets in the sending buffer queue is greater than or equal to the ratio threshold, then data packets are sent to the main station according to the current sorting order of the sending buffer queue.

[0039] In a preferred embodiment, selecting data packets from the send buffer queue to construct a send window according to a preset ingress window quota includes:

[0040] Read the packet category identifier for each packet in the send buffer queue;

[0041] The category of each packet in the send buffer queue is determined based on the packet category identifier;

[0042] Based on the inbound quota and the category of each data packet in the send buffer queue, a portion of the data packets in the send buffer queue are placed into the send window, where the inbound quota is associated with the category of the data packet.

[0043] In a preferred embodiment, the method further includes:

[0044] The remaining time limit is determined based on the remaining time between the current moment and the latest allowed time for data transmission.

[0045] Freshness is determined based on the timeliness of the data carried by the data packet relative to the current moment;

[0046] The closed-loop correlation is determined based on the degree of correlation between the data packet and at least one of the fault handling closed-loop, remote control closed-loop, and protection action feedback closed-loop.

[0047] The fair compensation value is determined based on the degree of compensation for data packets sent within a preset statistical range.

[0048] In a preferred embodiment, reordering data packets within the sending window based on the remaining time limit, freshness, closed-loop correlation, fair compensation value, and whether the data packet is a forwarding data packet includes:

[0049] The ranking value of each data packet is determined based on its remaining time limit, freshness, closed-loop correlation, fair compensation value, and whether it is a forwarded data packet.

[0050] The data packets within the sending window are reordered based on their sorting values ​​to obtain the sending order;

[0051] The data packets within the sending window are sent to the main station based on the sending order.

[0052] Compared with the prior art, the present invention has the following advantages: when the DTU sends local data packets and the FTU forwards data packets at the same time, the present invention can improve the adaptability of the sending order to mixed service scenarios, take into account timeliness, closed-loop service requirements and sending fairness, thereby improving the rationality and reliability of data uploading. Attached Figure Description

[0053] Figure 1 This is a schematic diagram of the system architecture of one embodiment of the present invention.

[0054] Figure 2 This is a logic block diagram of a DTU according to an embodiment of the present invention.

[0055] Figure 3 This is a flowchart of a method according to an embodiment of the present invention.

[0056] Figure 4 This is a schematic diagram of a send buffer queue according to an embodiment of the present invention.

[0057] Figure 5 This is a schematic diagram of a sending window according to an embodiment of the present invention.

[0058] Figure 6 This is a schematic diagram illustrating the reordering of data packets within a sending window according to an embodiment of the present invention. Detailed Implementation

[0059] The specific embodiments of the present invention will now be described in detail with reference to the accompanying drawings, but it should be understood that the scope of protection of the present invention is not limited to the specific embodiments.

[0060] Figure 1This is a schematic diagram of the system architecture of one embodiment of the present invention. As shown in the figure, the system of the present invention includes a feeder terminal unit (FTU) 105, a distribution terminal unit (DTU) 110, and a master station 115. The FTU 105 is typically configured on the primary equipment side of overhead distribution lines, such as pole-mounted circuit breakers and pole-mounted switches, to collect information related to line operation status, switch status, and faults. The DTU 110 is typically configured on the equipment side of ring main units, ring main cabinets, substations, or other distribution sites to collect relevant operating data within the station or unit and to interact with the master station 115. The master station 115 can be a distribution automation master station, a dispatch master station, or other upper-level monitoring platform, used for centralized reception, processing, analysis, and management of data uploaded by distribution network terminal equipment. As shown in the figure, the FTU 105 and DTU 110 constitute a distribution network collaborative networking structure. Specifically, FTU 105 focuses on data sensing and status acquisition at the front end of the distribution line and on pole-mounted equipment, while DTU 110 focuses on data aggregation, processing, and uploading at the ring network box or site side. Through collaborative networking, they can jointly support distribution network operation monitoring, fault analysis, and information transmission. Furthermore, data generated by FTU 105 can be sent directly to master station 115 via its own communication link, or it can be sent to DTU 110 first, and then forwarded to master station 115 by DTU 110. Therefore, in actual operation, DTU 110 not only needs to send its own generated data to master station 115, but may also need to forward data from FTU 105 to master station 115, thus forming a mixed data transmission scenario on the DTU 110 side.

[0061] Figure 2 This is a logical block diagram of a DTU according to an embodiment of the present invention. As shown, the DTU of the present invention includes a ratio judgment module 205, used to determine whether the ratio of non-forwarded data packets to forwarded data packets in the transmission buffer queue is less than a ratio threshold. When the judgment result is yes, the enhanced scheduling and sorting module 210 is activated. The enhanced scheduling and sorting module 210 includes an inbound quota module 215 and a transmission window 220. The inbound quota module 215 is used to select data packets from the transmission buffer queue to enter the transmission window 220 according to a preset inbound quota; it also includes a reordering module 225, which reorders the data packets in the transmission window based on the remaining time limit, freshness, closed-loop correlation, fair compensation value, and whether it is a forwarded data packet output by the parameter determination module 230, to obtain the transmission order. When the ratio judgment module 205 determines that the ratio is greater than or equal to the ratio threshold, the sequential transmission module 235 sends the data packets according to the current sorting order of the transmission buffer queue. If enhanced scheduling and sorting are used, the transmission module 240 finally sends the corresponding data packets to the master station.

[0062] It should be understood that Figure 2 The proportion judgment module 205, enhanced scheduling and sorting module 210, window quota module 215, sending window 220, reordering module 225, parameter determination module 230, sequential sending module 235, and sending module 240 shown are logical functional modules divided only for the purpose of illustrating the technical solution of the present invention, and are not intended to limit the specific implementation of the present invention. In specific implementation, the above functional modules can be implemented by hardware, software, firmware, or any combination thereof.

[0063] For example, in some embodiments, one or more of the above-mentioned functional modules can be implemented by a processor executing program instructions stored in memory; in other embodiments, one or more of the above-mentioned functional modules can also be implemented by dedicated hardware circuits, such as application-specific integrated circuits (ASICs), field-programmable gate arrays (FPGAs), programmable logic devices (PLDs), digital signal processors (DSPs), microcontrollers, state machines, combinational logic circuits, etc.; in still other embodiments, one or more of the above-mentioned functional modules can also be implemented through a hardware and software collaborative approach. Furthermore, the above-mentioned functional modules can be integrated into a single functional entity or decomposed into multiple functional entities; they can be implemented by the same processing unit or by multiple processing units respectively; they can be implemented using a centralized deployment method or a distributed deployment method. Those skilled in the art should understand that, without departing from the concept of the present invention, the specific division of the above-mentioned functional modules is not fixed and can be adaptively adjusted according to actual needs.

[0064] Figure 3 This is a flowchart of a method according to an embodiment of the present invention. As shown in the figure, the method of the present invention includes the following steps:

[0065] Step 1: Retrieve the data packets to be sent from the send buffer queue; an example of a send buffer queue can be found here. Figure 4 As shown in the figure, the send buffer queue has N data packets to be sent. It can be understood that the N data packets to be sent may include data packets generated by the DTU itself, or data packets sent by the FTU to the DTU in the expectation that the DTU will forward them to the master station. The data packets in the send buffer queue may have been sorted by existing communication protocols, such as based on priority, quality of service (QoS), or queue order.

[0066] Step 2: Determine whether the ratio of non-forwarded data packets to forwarded data packets in the send buffer queue is less than a ratio threshold. Forwarded data packets are those sent from the FTU to the DTU, while non-forwarded data packets are those generated by the DTU. In one specific implementation, when scheduling data packet transmission, the DTU first retrieves the data packets to be sent from the send buffer queue. The data packets to be sent include both non-forwarded and forwarded data packets. Preferably, the "ratio of non-forwarded data packets to forwarded data packets" is the ratio of the number of data packets, specifically defined as the ratio of the number of non-forwarded data packets to the number of forwarded data packets in the send buffer queue. To facilitate comparison by the processor, this ratio is represented as an integer in this embodiment, with the decimal part discarded. For example, when there are 92 non-forwarded data packets and 11 forwarded data packets in the send buffer queue, the ratio is 8; when there are 120 non-forwarded data packets and 8 forwarded data packets in the send buffer queue, the ratio is 15. Preferably, the ratio is only determined when both the number of non-forwarded data packets and the number of forwarded data packets are greater than 0; when the number of either type of data packet is 0, they can be sent directly according to the current sorting order of the send buffer queue.

[0067] In this embodiment, the ratio threshold is used to determine whether the forwarded data packets have reached the point where enhanced scheduling and sorting need to be initiated. The principle for determining the ratio threshold is as follows: on the one hand, considering that the number of non-forwarded data packets generated by the DTU itself is usually significantly greater than the number of forwarded data packets by the FTU, the ratio threshold should not be set too small; on the other hand, when the number of forwarded data packets in the sending buffer queue is already considerable, if they are still sent in the current sorting order of the existing communication protocol, the service characteristics of the forwarded data packets may not be reflected. Based on the above considerations, the ratio threshold in this embodiment is preferably set to 10. That is, when the ratio of the number of non-forwarded data packets to the number of forwarded data packets in the sending buffer queue is less than 10, it is considered that the forwarded data packets have reached the point where they need to participate in enhanced scheduling and sorting, and enhanced scheduling and sorting are initiated; when the ratio is greater than or equal to 10, it is considered that the current sending buffer queue is still dominated by non-forwarded data packets, and they can continue to be sent in the current sorting order.

[0068] Step 3: If the ratio of non-forwarded data packets to forwarded data packets in the sending buffer queue is less than the ratio threshold, then perform enhanced scheduling sorting on the sending buffer queue;

[0069] Step 4: Based on the preset inbound quota, select data packets from the sending buffer queue to construct the sending window; in one specific implementation, enhanced scheduling and sorting first executes quota-based inbound windowing. The "inbound quota" refers to the fixed upper limit of the number of data packets of a certain category allowed to enter the sending window during a single sending window construction process. The purpose of the sending window is to limit the reordering range in the global sending buffer queue to a local window, thereby avoiding a global reordering of the entire queue, reducing computational load, and improving sending efficiency. The inbound quota ensures that data packets of different categories have the opportunity to enter the sorting process within the same sending window.

[0070] In this embodiment, the data packets in the transmission buffer queue are divided into five fixed categories. Category A data packets are remote control / protection / fault handling closed-loop packets, such as remote control execution confirmation packets, protection action feedback packets, fault isolation completion feedback packets, and power restoration completion feedback packets; Category B data packets are fault event / state change / alarm packets, such as fault event codes, switch position change packets, undervoltage and overvoltage alarm packets; Category C data packets are critical telemetry update packets, such as packets transmitting changes in current, voltage, power, and fault indication quantities at critical measurement points; Category D data packets are ordinary periodic data packets, such as regular telemetry transmission packets generated according to a fixed sampling period; and Category E data packets are log / statistics / maintenance packets, such as equipment operation log packets, statistical report packets, and maintenance status packets. Preferably, each data packet carries a data packet category identifier, which can be represented by a 3-bit binary field, where 001 represents Category A, 010 represents Category B, 011 represents Category C, 100 represents Category D, and 101 represents Category E. For forwarded data packets sent from the FTU to the DTU, the DTU can directly read the category identifier to determine its category. For non-forwarded data packets generated by the DTU itself, the DTU can automatically fill in the category identifier based on the data packet source, event type field, service code, and collection trigger reason. In some cases, when the DTU cannot identify the category of a data packet according to preset rules, it defaults to classifying the data packet into Class E to ensure that any data packet can be classified into one of the categories from A to E. After the DTU classifies an unidentifiable data packet into Class E, it can generate an exception log. Engineers can then manually reclassify this type of unidentifiable data based on the exception log (e.g., classify it into Class D). When the DTU receives data packets of this type in the future, it can classify this type of data packet into Class D based on the reclassification result. The FTU classifies the data packets generated by the FTU in a similar way to the DTU.

[0071] In this embodiment, the unit of the sending window is also the number of data packets. Preferably, one sending window contains 16 data packets. Correspondingly, the preset window quota can adopt a fixed quota rule: 4 for Class A, 4 for Class B, 3 for Class C, 3 for Class D, and 2 for Class E. The above quota rule is simple and fixed, and easy to implement through programmatic fixation. Among them, Class A and Class B correspond to higher business urgency, so they are each set to 4; Class C is a critical telemetry update packet, set to 3; Class D is a normal periodic data packet, set to 3; and Class E is a log / statistics / maintenance packet, set to 2. When the number of data packets of a certain category is less than its fixed quota, the category enters the sending window according to the actual number. Unfilled window positions can be filled by data packets of other categories according to the current sorting order of the sending buffer queue, but the fixed quota value of the category itself is not changed. In addition, it is understood that, for example, when selecting 4 Class A data packets for the window, 4 Class A data packets should be selected sequentially according to the current sorting order of the sending buffer queue. An example of the sending window can be found in [reference needed]. Figure 5 . Figure 5 The dashed box in the image represents the sending window of this application.

[0072] Step 5: For data packets entering the sending window, based on the remaining time limit, freshness, closed-loop correlation, fair compensation value, and whether it is a forwarded data packet, the data packets in the sending window are reordered to obtain the sending order;

[0073] Step 6: Based on the sending order, send the data packets in the sending window to the main station.

[0074] In a preferred embodiment, the method further includes:

[0075] If the ratio of non-forwarded data packets to forwarded data packets in the sending buffer queue is greater than or equal to the ratio threshold, then data packets are sent to the main station according to the current sorting order of the sending buffer queue.

[0076] In a preferred embodiment, selecting data packets from the send buffer queue to construct a send window according to a preset ingress window quota includes:

[0077] Read the packet category identifier for each packet in the send buffer queue;

[0078] The category of each packet in the send buffer queue is determined based on the packet category identifier;

[0079] Based on the inbound quota and the category of each data packet in the send buffer queue, a portion of the data packets in the send buffer queue are placed into the send window, where the inbound quota is associated with the category of the data packet.

[0080] In a preferred embodiment, the method further includes:

[0081] The remaining time limit is determined based on the remaining time between the current time and the latest allowed transmission time for the data packet. In one specific embodiment, the remaining time limit is the remaining time between the current scheduling time and the latest allowed transmission time. Preferably, the latest allowed transmission time can be preset according to the data packet type: 100 milliseconds for type A, 300 milliseconds for type B, 1000 milliseconds for type C, 5000 milliseconds for type D, and 10000 milliseconds for type E. For example, if a type A data packet has been queued for 30 milliseconds, its remaining time limit is 70 milliseconds; if a type C data packet has been queued for 250 milliseconds, its remaining time limit is 750 milliseconds. To facilitate ranking, this embodiment further maps the remaining time limit to five levels: 5 for a remaining time limit of no more than 100 milliseconds; 4 for a remaining time limit greater than 100 milliseconds but no more than 300 milliseconds; 3 for a remaining time limit greater than 300 milliseconds but no more than 1000 milliseconds; 2 for a remaining time limit greater than 1000 milliseconds but no more than 5000 milliseconds; and 1 for a remaining time limit greater than 5000 milliseconds. Therefore, the shorter the remaining time limit, the higher the corresponding level value.

[0082] Freshness is determined based on the timeliness of the data carried by the data packet relative to the current time; freshness represents the timeliness of the data carried by the data packet relative to the current scheduling time. In this embodiment, freshness is determined by "data age," which is the time difference between the time when data collection is completed or when data is generated and the current scheduling time. For example, if a data packet is generated 40 milliseconds before the current scheduling time, its data age is 40 milliseconds; if another data packet is generated 1200 milliseconds before the current scheduling time, its data age is 1200 milliseconds. For sorting purposes, this embodiment maps freshness to 5 levels: 5 for data age no greater than 100 milliseconds; 4 for data age greater than 100 milliseconds but no greater than 300 milliseconds; 3 for data age greater than 300 milliseconds but no greater than 1000 milliseconds; 2 for data age greater than 1000 milliseconds but no greater than 3000 milliseconds; and 1 for data age greater than 3000 milliseconds. The smaller the data age, the fresher the data, and the higher the corresponding freshness level value.

[0083] The closed-loop correlation is determined based on the degree of correlation between data packets and at least one of the following closed-loop mechanisms: fault handling, remote control, and protection action feedback. Closed-loop correlation represents the degree of association between data packets and these mechanisms. It is considered because, in distribution automation scenarios, some data packets directly determine whether the next action in the closed loop can continue, such as remote control execution confirmation packets, protection action feedback packets, and fault isolation result packets. Delayed transmission of these data packets directly affects the efficiency of closed-loop processing. To ensure quantifiable implementation, this embodiment divides the closed-loop correlation into four levels. A correlation value of 3 indicates that the data packet directly carries the execution result of the current closed-loop task, and this execution result is a necessary prerequisite for subsequent actions, such as a remote control trip confirmation packet. A correlation value of 2 indicates that the data packet has the same closed-loop task identifier as the current closed-loop task and is generated within 2 seconds after the completion of the current closed-loop action, used to confirm the effect of the action, such as a status change confirmation packet after the action. A correlation value of 1 indicates that the data packet belongs to the same feeder or the same terminal as the current closed-loop task and is generated within 5 seconds after the occurrence of the current closed-loop event, but is not a necessary prerequisite for the next action, such as an auxiliary measurement packet of the same feeder. A correlation value of 0 indicates that the data packet is not directly related to the current closed-loop task. For example, a remote control execution confirmation packet can take the correlation value of 3, a switch status confirmation packet within 2 seconds after a fault can take the correlation value of 2, a normal update packet of the same feeder can take the correlation value of 1, and a maintenance log packet can take the correlation value of 0. In some implementations, the DTU may be unable to directly determine the loop closure correlation of a data packet. For example, the data packet may not carry a loop closure task identifier, action result identifier, or loop closure stage identifier, or the identifier fields may be missing, abnormal, or conflicting, preventing the DTU from determining its correlation degree based on the complete loop closure context. In response, when the loop closure correlation of a data packet cannot be determined, the DTU further determines it based on the data packet's category, the data source device, and the time relationship between its generation time and the most recent loop closure event. Specifically, if the data packet belongs to category A and the source device is the same as the device corresponding to the current loop closure task, the default loop closure correlation value is 2; if the data packet belongs to category B, the source feeder is the same as the feeder corresponding to the current loop closure task, and its generation time is within 5 seconds of the most recent loop closure event, the default loop closure correlation value is 1; if the above conditions are not met, or the DTU still cannot determine the correspondence between the data packet and the current loop closure task, the default loop closure correlation value of the data packet is set to 0.

[0084] The fair compensation value is determined based on the degree of compensation for data packets within a preset statistical range. The fair compensation value is used to prevent data packets from certain sources from not being sent for extended periods. To achieve quantification, in this embodiment, the "preset statistical range" is defined as the most recent 10 sending windows; each sending window contains 16 data packets. The "compensation degree" is defined as: within the most recent 10 sending windows, the number of times a data stream with the same source type and category identifier as the current data packet has data packets to be sent in the sending buffer queue but has not been selected for a sending window. For example, "forwarding Class A" is one data stream, and "non-forwarding Class C" is another data stream. If a data stream has data packets to be sent in 5 of the most recent 10 sending windows but none are sent, its compensation degree is 5 times. This embodiment further divides the fair compensation value into 4 levels: when the compensation degree is 0 or 1 time, the fair compensation value is 0; when the compensation degree is 2 or 3 times, the fair compensation value is 1; when the compensation degree is 4 to 6 times, the fair compensation value is 2; and when the compensation degree is 7 to 10 times, the fair compensation value is 3. In this way, data streams that have not been scheduled for a long time will receive a higher fair compensation value, thus being compensated in subsequent sorting.

[0085] In a preferred embodiment, reordering data packets within the sending window based on the remaining time limit, freshness, closed-loop correlation, fair compensation value, and whether the data packet is a forwarding data packet includes:

[0086] The ranking value of each data packet is determined based on its remaining time limit, freshness, closed-loop correlation, fair compensation value, and whether it is a forwarded data packet.

[0087] The data packets within the sending window are reordered based on their sorting values ​​to obtain the sending order. It should be noted that the impact of each factor in the sorting value formula on the final sorting result depends not only on the magnitude of the corresponding coefficient but also on the value range of the factor itself. Specifically, considering that the remaining time limit directly determines whether a data packet is about to expire, the actual contribution corresponding to the remaining time limit should be the highest; considering that closed-loop correlation directly affects the subsequent execution of fault handling closed-loop, remote control closed-loop, or protection action feedback closed-loop, while freshness directly affects the effectiveness of data received by the master station, the actual contributions corresponding to closed-loop correlation and freshness are preferably set to the second-highest level; considering that "whether it is a forwarding data packet" is a specific distinguishing factor introduced by this invention for the mixed transmission scenario of FTU and DTU, it should have a clear impact on the sorting result, and is set as an adjustment factor lower than the remaining time limit, closed-loop correlation, and freshness but higher than the fair compensation value; considering that the fair compensation value is mainly used to prevent a certain type of data stream from being unable to be sent for a long time, its function is compensation rather than dominating the sorting, its actual contribution is preferably set to a lower level.

[0088] Based on the above considerations, in this embodiment, the sorting value V is preferably determined in the following manner:

[0089] V = 28×R + 18×N + 30×L + 4×G + 20×Z.

[0090] Where R represents the remaining time limit level value, which ranges from 1 to 5; N represents the freshness level value, which ranges from 1 to 5; L represents the closed-loop association value, which ranges from 0 to 3; G represents the fair compensation value, which ranges from 0 to 3; and Z represents the forwarding tag value, which ranges from 0 to 1.

[0091] According to the above formula, the maximum contribution of each factor to the ranking value is as follows: remaining time limit is 140, closed-loop correlation is 90, freshness is 90, forwarding mark is 20, and fair compensation value is 12. Therefore, in this embodiment, remaining time limit has the highest actual impact, closed-loop correlation and freshness are at the second level, forwarding mark, as a specific adjustment factor for mixed transmission scenarios, is at the third level, and fair compensation value, as a compensation factor to prevent long-term starvation, is at the fourth level.

[0092] In a more specific example Figure 5 Data packet 3 is a Class A forwarding data packet, which has been waiting for 30 milliseconds, corresponding to a remaining time limit of 70 milliseconds, so R is 5; the data age is 40 milliseconds, so N is 5; it is a remote control execution confirmation packet, so L is 3; the corresponding data stream has not entered the window in 4 of the last 10 sending windows, so G is 2; it is a forwarding data packet, so Z is 1. Thus, the sorting value is 348.

[0093] Figure 5 Data packet 2 is a Class B non-forwarded data packet, having waited for 60 milliseconds, with a remaining time limit of 240 milliseconds, therefore R is set to 4; the data age is 150 milliseconds, therefore N is set to 4; it is a fault event alarm packet and is related to the same task identifier as the current closed-loop task, but it is not a necessary prerequisite for the next action, therefore L is set to 2; the corresponding data stream has not entered the window in 2 of the last 10 sending windows, therefore G is set to 1; it is a non-forwarded data packet, therefore Z is set to 0. Thus, the sorting value is 248.

[0094] Figure 5 Data packet 1 is a Class C forwarded data packet, which has been waiting for 250 milliseconds, with a remaining time limit of 750 milliseconds, so R is set to 3; the data age is 220 milliseconds, so N is set to 4; it is a critical telemetry update packet on the same feeder, but not a necessary feedback for the closed loop, so L is set to 1; the corresponding data stream did not enter the window in 7 out of the last 10 sending windows, so G is set to 3; it is a forwarded data packet, so Z is set to 1. Thus, the sorting value is 218.

[0095] Figure 5Data packet 4 is a Class D non-forwarding data packet, which has been waiting for 1000 milliseconds, with a remaining time limit of 4000 milliseconds, so R is set to 2; the data age is 1200 milliseconds, so N is set to 2; it is not directly related to the current closed-loop task, so L is set to 0; the corresponding data stream has not entered the window 0 times in the last 10 sending windows, so G is set to 0; it is a non-forwarding data packet, so Z is set to 0. Therefore, the sorting value is 92.

[0096] After obtaining the sorting values ​​of the four data packets, the DTU sorts the data packets within the sending window in descending order of their sorting values. Thus, data packet 3 is sorted first, data packet 2 second, data packet 1 third, and data packet 4 fourth. The state of the sending window after this reordering of the four data packets can be found in [link to relevant documentation]. Figure 6 It will be understood by those skilled in the art that this specification, for the purpose of clarity and brevity, only shows an embodiment of reordering four data packets. In an actual DTU, this embodiment can be used to reorder 16 data packets.

[0097] The data packets within the sending window are sent to the main station based on the sending order.

[0098] This application provides a distribution network collaborative networking device that integrates a pole-mounted circuit breaker (FTU) and a ring main unit (DTU). The device is installed at the DTU and includes:

[0099] Memory; and

[0100] A processor coupled to memory, the memory and processor being configured to perform the following operations:

[0101] Retrieve the data packets to be sent from the send buffer queue;

[0102] Determine whether the ratio of non-forwarded data packets to forwarded data packets in the send buffer queue is less than a ratio threshold. Forwarded data packets are data packets sent from the FTU to the DTU, while non-forwarded data packets are data packets generated by the DTU.

[0103] If the ratio of non-forwarded packets to forwarded packets in the transmit buffer queue is less than a ratio threshold, then enhanced scheduling and sorting are performed on the transmit buffer queue. Enhanced scheduling and sorting include:

[0104] Based on the preset inbound quota, select data packets from the send buffer queue to construct the send window;

[0105] For data packets entering the sending window, the data packets in the sending window are reordered based on the remaining time limit, freshness, closed-loop correlation, fair compensation value and whether they are forwarded data packets, to obtain the sending order;

[0106] Based on the sending order, the data packets within the sending window are sent to the main station.

[0107] In a preferred embodiment, the memory and processor are further configured to perform the following operations:

[0108] If the ratio of non-forwarded data packets to forwarded data packets in the sending buffer queue is greater than or equal to the ratio threshold, then data packets are sent to the main station according to the current sorting order of the sending buffer queue.

[0109] In a preferred embodiment, selecting data packets from the send buffer queue to construct a send window according to a preset ingress window quota includes:

[0110] Read the packet category identifier for each packet in the send buffer queue;

[0111] The category of each packet in the send buffer queue is determined based on the packet category identifier;

[0112] Based on the inbound quota and the category of each data packet in the send buffer queue, a portion of the data packets in the send buffer queue are placed into the send window, where the inbound quota is associated with the category of the data packet.

[0113] In a preferred embodiment, the memory and processor are further configured to perform the following operations:

[0114] The remaining time limit is determined based on the remaining time between the current moment and the latest allowed time for data transmission.

[0115] Freshness is determined based on the timeliness of the data carried by the data packet relative to the current moment;

[0116] The closed-loop correlation is determined based on the degree of correlation between the data packet and at least one of the fault handling closed-loop, remote control closed-loop, and protection action feedback closed-loop.

[0117] The fair compensation value is determined based on the degree of compensation for data packets sent within a preset statistical range.

[0118] In a preferred embodiment, reordering data packets within the sending window based on the remaining time limit, freshness, closed-loop correlation, fair compensation value, and whether the data packet is a forwarding data packet includes:

[0119] The ranking value of each data packet is determined based on its remaining time limit, freshness, closed-loop correlation, fair compensation value, and whether it is a forwarded data packet.

[0120] The data packets within the sending window are reordered based on their sorting values ​​to obtain the sending order;

[0121] The data packets within the sending window are sent to the main station based on the sending order.

[0122] The above description is merely a preferred embodiment of the present invention, used to illustrate the technical solution of the present invention, and is not intended to limit the scope of protection of the present invention. For those skilled in the art, various modifications, substitutions, combinations, or equivalent improvements can be made to the technical solution of the present invention without departing from the spirit and substance of the present invention, and all such modifications, substitutions, combinations, or equivalent improvements should fall within the scope of protection of the present invention. The scope of protection of the present invention should be determined by the content defined in the claims, and the specific embodiments in the specification and drawings can be used to interpret the claims. The expressions "preferred," "for example," and "in some embodiments" mentioned in the specification are only used to help understand the present invention and do not constitute a limitation of the present invention.

Claims

1. A distribution network collaborative networking device integrating a pole-mounted circuit breaker (FTU) and a ring main unit (DTU), the device being installed at the DTU, the device comprising: Memory; as well as A processor coupled to the memory, the memory and the processor being configured to perform the following operations: Retrieve the data packets to be sent from the send buffer queue; Determine whether the ratio of non-forwarded data packets to forwarded data packets in the sending buffer queue is less than a ratio threshold, wherein the forwarded data packets are data packets sent from the FTU to the DTU, and the non-forwarded data packets are data packets generated by the DTU; If it is determined that the ratio of non-forwarded data packets to forwarded data packets in the sending buffer queue is less than a ratio threshold, then enhanced scheduling and sorting are performed on the sending buffer queue. The enhanced scheduling and sorting includes: According to the preset window quota, data packets are selected from the sending buffer queue to construct a sending window; For data packets entering the sending window, the data packets in the sending window are reordered based on the remaining time limit, freshness, closed-loop correlation, fair compensation value and whether they are forwarded data packets, to obtain the sending order; Based on the sending order, the data packets within the sending window are sent to the main station. The memory and the processor are also configured to perform the following operations: If the ratio of non-forwarded data packets to forwarded data packets in the sending buffer queue is greater than or equal to the ratio threshold, then data packets are sent to the main station according to the current sorting order of the sending buffer queue. Selecting data packets from the sending buffer queue to construct a sending window according to a preset ingress quota includes: Read the packet category identifier of each packet in the send buffer queue; The category of each data packet in the send buffer queue is determined based on the data packet category identifier; Based on the inbound quota and the category of each data packet in the sending buffer queue, a portion of the data packets in the sending buffer queue are placed into the sending window, wherein the inbound quota is associated with the category of the data packets.

2. The apparatus according to claim 1, wherein, The memory and the processor are also configured to perform the following operations: The remaining time limit is determined based on the remaining time between the current moment and the latest allowed transmission time for the data packet. The freshness is determined based on the timeliness of the data carried by the data packet relative to the current moment; The closed-loop correlation is determined based on the degree of correlation between the data packet and at least one of the fault handling closed-loop, remote control closed-loop, and protection action feedback closed-loop. The fair compensation value is determined based on the degree of compensation for data packets sent within a preset statistical range.

3. The apparatus according to claim 2, wherein, The reordering of data packets within the sending window, based on the remaining time limit, freshness, closed-loop correlation, fair compensation value, and whether each data packet is a forwarded data packet, includes: The sorting value of each data packet is determined based on the remaining time limit, freshness, closed-loop correlation, fair compensation value, and whether it is a forwarded data packet. The data packets within the sending window are reordered based on their sorting values ​​to obtain the sending order; Based on the sending order, the data packets within the sending window are sent to the main station.

4. A method for coordinated networking of a distribution network integrating a pole-mounted circuit breaker (FTU) and a ring main unit (DTU), wherein the method is executed by the DTU, and the method includes: Retrieve the data packets to be sent from the send buffer queue; Determine whether the ratio of non-forwarded data packets to forwarded data packets in the sending buffer queue is less than a ratio threshold, wherein the forwarded data packets are data packets sent from the FTU to the DTU, and the non-forwarded data packets are data packets generated by the DTU; If it is determined that the ratio of non-forwarded data packets to forwarded data packets in the sending buffer queue is less than a ratio threshold, then enhanced scheduling and sorting are performed on the sending buffer queue. The enhanced scheduling and sorting includes: According to the preset window quota, data packets are selected from the sending buffer queue to construct a sending window; For data packets entering the sending window, the data packets in the sending window are reordered based on the remaining time limit, freshness, closed-loop correlation, fair compensation value and whether they are forwarded data packets, to obtain the sending order; Based on the sending order, the data packets within the sending window are sent to the main station. The method further includes: If the ratio of non-forwarded data packets to forwarded data packets in the sending buffer queue is greater than or equal to the ratio threshold, then data packets are sent to the main station according to the current sorting order of the sending buffer queue. Selecting data packets from the sending buffer queue to construct a sending window according to a preset ingress quota includes: Read the packet category identifier of each packet in the send buffer queue; The category of each data packet in the send buffer queue is determined based on the data packet category identifier; Based on the inbound quota and the category of each data packet in the sending buffer queue, a portion of the data packets in the sending buffer queue are placed into the sending window, wherein the inbound quota is associated with the category of the data packets.

5. The method according to claim 4, wherein, The method further includes: The remaining time limit is determined based on the remaining time between the current moment and the latest allowed transmission time for the data packet. The freshness is determined based on the timeliness of the data carried by the data packet relative to the current moment; The closed-loop correlation is determined based on the degree of correlation between the data packet and at least one of the fault handling closed-loop, remote control closed-loop, and protection action feedback closed-loop. The fair compensation value is determined based on the degree of compensation for data packets sent within a preset statistical range.

6. The method according to claim 5, wherein, The reordering of data packets within the sending window, based on the remaining time limit, freshness, closed-loop correlation, fair compensation value, and whether each data packet is a forwarded data packet, includes: The sorting value of each data packet is determined based on the remaining time limit, freshness, closed-loop correlation, fair compensation value, and whether it is a forwarded data packet. The data packets within the sending window are reordered based on their sorting values ​​to obtain the sending order; Based on the sending order, the data packets within the sending window are sent to the main station.

Images