A message notification method, device, and electronic device
By adopting the multi-stage push method of message push server in the new energy grid, and using the k fork tree and Gossip rumor dissemination algorithm, the real-time response problem of distributed energy storage terminals and interruptible loads is solved, and the reliable propagation and rapid delivery of regulated messages are realized.
Patent Information
- Application Number
- CN202211520118.8
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Priority Date
- 2022-11-24
- Filing Date
- 2022-11-30
- Publication Date
- 2025-07-04
- Estimated Expiration
- 2042-11-30
AI Technical Summary
In the new energy grid, it is difficult to respond to grid regulation messages in real time and incurred loads, especially in wide area networks, metropolitan area networks or mobile networks. The degree of coordination and coordination of the equipment terminals is low, resulting in a huge number of notifications and strict certainty requirements.
The method in the message push server is adopted to detect node failure and cross-region push through the first stage broadcast push and the second stage hierarchical notification method based on the k fork tree or Gossip rumor dissemination algorithm to ensure reliable transmission of messages, including broadcasting and telecommunications point-to-point push.
Real-time and reliable responses to distributed energy storage terminals and interruptible loads in the new energy grid are realized, reducing server bandwidth costs, improving the reliability and speed of message push, and ensuring that the regulatory messages arrive at each node in a timely manner.
Smart Images

Figure CN115801874B_ABST
Abstract
Description
Technical Field
[0001] This application relates to the technical field of data processing, and particularly to a message notification method and device for a distributed new energy power grid. Background Art
[0002] In a traditional power system, the power generation is mainly regulated by the rotational inertia and frequency modulation ability of the generator sets, namely the so-called "source follows load". With the large-scale popularization of new energy, new energy mainly based on solar energy and wind energy shows obvious volatility and randomness characteristics on the grid side, which greatly increases the regulation frequency of the power grid.
[0003] The main regulation methods in the power grid are frequency modulation and peak shaving. The strong volatility of new energy makes the frequency modulation response in the power grid require certainty. The connotation of certainty is on the one hand real-time performance, that is, low latency and low latency jitter, generally controlled at the millisecond level; on the other hand, high reliability, requiring the reliability of power grid regulation to reach 99.999% or even higher. During the power grid regulation process, the device ends of the "virtual power plant" that respond to the power grid regulation are distributed on the load side of the power grid, geographically dispersed and in large numbers. Among them, loads such as electric vehicles also involve mobility, multi-user coordination, low cooperation degree with the power grid, and the need for market incentives and other issues, which makes the number of notifications made by the power grid regulation huge and the certainty requirements strict. The above-mentioned device ends need to perform deterministic notification control in the scope of wide area network, metropolitan area network or mobile network, and further require each device end to be able to respond to the regulation messages of the power grid in a timely manner.
[0004] Therefore, how to ensure that these distributed energy storage ends and interruptible loads in the new energy power grid can respond to the regulation messages of the power grid in real time has become an urgent technical problem to be solved at present. Summary of the Invention
[0005] This application provides a message notification method, device and electronic device, which are applied to a message push server and are used to ensure that distributed energy storage ends and interruptible loads in the new energy power grid can respond to the regulation messages of the power grid in real time and reliably.
[0006] A message notification method is provided in the first aspect of the present application, which is applied to a message push server. The method includes: in response to a regulation action of a regulation terminal, performing a first-stage push, where the first-stage push is used to push a regulation message to a first node group; detecting the number of rounds of the first-stage push; when the number of rounds of the first-stage push is greater than or equal to a preset push number of rounds, performing a second-stage push, where the second-stage push is used to push the regulation message to a second node group; detecting the efficiency of the second-stage push; determining that the efficiency of the second-stage push is less than or equal to a preset push efficiency, and sending a pull notification to a third node group, where the pull notification is used to control the third node group to pull the regulation message; when the third node group completes pulling the regulation message, determining that the node has completed receiving the regulation message, and the node includes any one of the first node group, the second node group, and the third node group.
[0007] By adopting the above method, the present application enables distributed energy storage segments and interruptible loads in a new energy power grid to respond to grid regulation messages in a real-time and reliable manner, ensuring that the regulation messages can reach each node in a timely manner.
[0008] Optionally, performing the second-stage push specifically includes: performing the second-stage push by using a hierarchical notification approach, where the hierarchical notification approach includes one or both of a hierarchical notification approach based on a k-ary tree and a hierarchical notification approach based on the Gossip rumor spreading algorithm.
[0009] By adopting the above method, in the second stage of message push, the present application uses a hierarchical notification approach based on a k-ary tree or a hierarchical notification approach based on the Gossip rumor spreading algorithm, balancing the message propagation speed while improving the reliability of message push through redundant design and reducing the bandwidth cost of the push server.
[0010] Optionally, the method further includes: detecting failed nodes among the nodes involved in network push, where a failed node is a node that fails to receive a regulation message or cannot complete the push of a regulation message; and notifying nearby nodes of the failed nodes to perform cross-region push.
[0011] By adopting the above method, by detecting failed nodes among the nodes involved in network push and notifying nearby nodes of the failed nodes to perform cross-region push, the present application ensures that when there are failed nodes and message push cannot be completed, remedies can be taken, thereby improving the reliability of the message push process.
[0012] Optionally, sending a pull notification to the third node group specifically includes: sending the pull notification to the third node group by using one or more of a broadcast push approach, a hierarchical push approach, or a telecommunications point-to-point push approach.
[0013] By adopting the above method, the present application improves the speed of sending pull requests by the third node group.
[0014] Optionally, determining that the node has completed receiving the regulation message specifically includes: in response to the feedback notification of the node, obtaining the proportion of the number of nodes that have received the regulation message among the nodes; determining whether the proportion at the preset time point is greater than or equal to a preset first proportion; when the proportion at the preset time point is greater than or equal to the preset first proportion, determining that the node has completed receiving the regulation message.
[0015] By adopting the above method, the present application enables the message push server to determine the proportion of the number of nodes that have received the regulation message.
[0016] Optionally, the method further includes: when the proportion at the preset time point is less than a preset second proportion, detecting whether the first central node is damaged, where the first central node is used to transmit the feedback notification and perform summarization; when the first central node is damaged, invoking the second central node to transmit the feedback notification and perform summarization.
[0017] By adopting the above method, when it is detected that the proportion at the preset time point is less than the preset second proportion, the message server adjusts the way of transmitting the feedback notification by detecting whether the first central node is damaged.
[0018] Optionally, performing the first-stage push specifically includes adopting one or more of a broadcast push approach, a telecommunications point-to-point push approach, and a hierarchical notification push approach.
[0019] By adopting the above method, the present application provides a push approach for implementing the first-stage push.
[0020] Optionally, the sending approach for sending the pull notification includes adopting one or more of a broadcast push approach, a telecommunications point-to-point push approach, and a hierarchical notification push approach.
[0021] By adopting the above method, the present application provides a sending approach for sending the pull notification.
[0022] The second aspect of the present application provides a message determination device based on a distributed new energy power grid. The device includes a first push module, a first detection module, a second push module, a second detection module, a notification module, and a confirmation module. The first push module is configured to execute a first-stage push in response to a regulation action of a regulation terminal. The first-stage push is used to push a regulation message to a first node group. The first detection module is configured to detect the number of rounds of the first-stage push. The second push module is configured to execute a second-stage push when the number of rounds of the first-stage push is greater than or equal to a preset push round. The second-stage push is used to push the regulation message to a second node group. The second detection module is configured to detect the efficiency of the second-stage push. The notification module is configured to determine that the efficiency of the second-stage push is less than or equal to a preset push efficiency, and send a pull notification to a third node group. The pull notification is used to control the third node group to pull the regulation message. The confirmation module is configured to determine that a node has completed receiving the regulation message when the third node group has completed pulling the regulation message. The node includes any one of the first node group, the second node group, and the third node group.
[0023] The third aspect of the present application provides an electronic device. The electronic device includes a processor, a memory, a user interface, and a network interface. The memory is used to store instructions. The user interface and the network interface are used to communicate with other devices. The processor is configured to execute the instructions stored in the memory so that the electronic device executes the method in any one of the above.
[0024] The fourth aspect of the present application provides a computer-readable storage medium. The computer-readable storage medium stores instructions. When the instructions are executed, the method in any one of the above is executed.
[0025] Compared with the related art, the beneficial effects of the present application are as follows: It realizes that the distributed energy storage end and the interruptible load in the new energy power grid can respond to the regulation message of the power grid in real time and reliably, ensuring that the regulation message can reach each node in time. In the first stage of message push, the use of broadcast push channels and telecom point-to-point push channels can effectively avoid the cold start stage in the hierarchical notification channel, improving the initial propagation speed. In the second stage, the use of a hierarchical notification channel based on a k-ary tree or a hierarchical notification channel based on the Gossip rumor spreading algorithm improves the reliability of message push and reduces the server bandwidth cost. Through redundant push channel design or detecting failed nodes among the nodes involved in network push and notifying nearby nodes of the failed nodes for cross-region push, it is ensured that when a message push cannot be completed due to the existence of failed nodes, remedies can be made, thereby improving the reliability of the message push process. It improves the speed of the third node group pulling messages. A deterministic notification network is directly implemented on the existing communication network architecture in the new energy power grid. Description of the Drawings
[0026] Figure 1It is a schematic diagram of the principle of a message propagation node of a message pushing method provided by an embodiment of the present application;
[0027] Figure 2 It is a schematic flowchart of a message pushing method provided by an embodiment of the present application;
[0028] Figure 3 It is a schematic diagram of a scenario of a message pushing method provided by an embodiment of the present application;
[0029] Figure 4 It is a schematic flowchart of a message pushing method provided by an embodiment of the present application;
[0030] Figure 5 It is a schematic flowchart of a message pushing method provided by an embodiment of the present application;
[0031] Figure 6 It is a schematic diagram of a scenario of a message pushing method provided by an embodiment of the present application;
[0032] Figure 7 It is a schematic structural diagram of a message pushing device provided by an embodiment of the present application;
[0033] Figure 8 It is a schematic structural diagram of an electronic device provided by an embodiment of the present application.
[0034] Reference numerals: 11, control end; 12, first node group; 13, failed node; 14, node that has not received the control message. Detailed implementation manners
[0035] In order to enable those skilled in the art to better understand the technical solutions in this specification, the technical solutions in the embodiments of this specification will be clearly and completely described below in conjunction with the accompanying drawings in the embodiments of this specification. Obviously, the described embodiments are only a part of the embodiments of the present application, rather than all the embodiments.
[0036] In the description of the embodiments of the present application, words such as "exemplary", "for example" or "for illustration" are used to indicate examples, illustrations or explanations. Any embodiment or design solution described as "exemplary", "for example" or "for illustration" in the embodiments of the present application should not be construed as being more preferred or having more advantages than other embodiments or design solutions. Rather, the use of words such as "exemplary", "for example" or "for illustration" is intended to present related concepts in a specific manner.
[0037] In the description of the embodiments of the present application, the term "and / or" merely describes the associated relationship of associated objects and indicates that three relationships may exist. For example, A and / or B may represent three situations: A exists alone, B exists alone, and A and B exist simultaneously. Additionally, unless otherwise specified, the meaning of the term "plurality" refers to two or more. For example, a plurality of systems refers to two or more systems, and a plurality of screen terminals refers to two or more screen terminals. Furthermore, the terms "first" and "second" are only used for descriptive purposes and cannot be understood as indicating or implying relative importance or implicitly specifying the indicated technical features. Thus, the features defined with "first" and "second" may explicitly or implicitly include one or more of such features. The terms "include", "comprise", "have" and their variants all mean "including but not limited to", unless otherwise specifically emphasized in other ways.
[0038] In the embodiments of the present application, the control end can be a power generation end or a control end that, in the context of a distributed new energy power grid, manually or automatically adjusts parameters in the power system, resulting in changes in the transmission of grid operation information, including but not limited to various substations, various types of power plants, and power energy control centers. It should be clear that the control end referred to in the embodiments of the present application is only given exemplarily and is not a limitation on the control end.
[0039] In the embodiments of the present application, the nodes can be each distributed energy storage end, various types of interruptible loads, and power consumption terminals that receive control information, and can also be the power generation end and the control end in the power system. It should be noted that the nodes can also be established artificially according to the requirements in the actual message push and transmission process.
[0040] Based on the development of the distributed new energy power grid, the present application guarantees the certainty and reliability of the message requirements of various power consumption terminals in the existing or upcoming new energy power generation scenarios. In addition, the present application can also be applied to other types of message requirement scenarios.
[0041] As Figure 1 shown, the embodiments of the present application provide a distribution diagram of the number of effectively spread rumors of a hierarchical notification network based on the Gossip rumor spreading algorithm varying with the number of spreading rounds. Among them, Effective Gossip represents the number of effectively spread rumors; round represents the number of spreading rounds. Figure 1The notification network involved is self-organized based on the rumor-spreading network. The common communication method in the rumor-spreading network is "eager push, lazy pull". The main resource competition in the notification network system lies in the forwarding bandwidth of each node. In the initial stage of the system, the push efficiency is high, and nodes pull back to avoid competing for bandwidth with the push. As the push progresses, due to the existence of something like an "immune barrier", the push efficiency decreases. For example, in stage three, the "immune barrier" may cause some nodes to not be pushed to for a long time. Finally, in stage three, the notification network can rely on nodes to actively pull messages to ensure that all nodes are notified. For example Figure 1 , when 1,000,000 nodes adopt the push method with a forwarding number of 2, the number of effective propagation nodes in each push round can be divided into three stages. The first stage is exponential growth, basically a multiple of 2. However, when it reaches the 11th round, the number of effective propagation nodes is no more than 2048, and this part of the nodes is a very small proportion relative to 1,000,000, which is the so-called "cold start". The second stage is when the rumor-spreading is in the most effective stage of propagation, which is when the number of transmissions is the largest, but its "immune barrier" effect begins to show. As the push rounds progress, the propagation efficiency decreases significantly. In the third stage, the push has entered the ineffective time, and a large number of messages pushed are transmitted to the known notified nodes. Since the number of unnotified nodes is very small in the third stage and it is difficult to be discovered by the push method, stage three needs to rely on nodes to actively pull messages to complete the notification of all nodes finally.
[0042] Figure 2 It is a schematic flowchart of a method for determining messages based on a distributed new energy power grid provided by an embodiment of the present application. For example Figure 2 As shown, it includes steps S101 - S106.
[0043] Step S101, in response to the regulation action of the regulation terminal, perform the first-stage push, and the first-stage push is used to push the regulation message to the first node group.
[0044] For example Figure 3 As shown, in response to the regulation action generated by the regulation terminal 11, the message confirmation server sends a regulation message to the first node group 12. The regulation message in the embodiment of the present application can be various parameters such as the change of real-time electricity price, the change of real-time power, or the change of frequency in the power grid.
[0045] In a possible implementation manner, performing the first-stage push specifically includes using one or more of the broadcast push path, the telecom point-to-point push path, and the hierarchical notification push path.
[0046] Step S102, detect the first-stage push round.
[0047] For example, when the message confirmation server sends a regulation message to the first node group 12 during the first-phase push, it needs to perform multiple rounds of pushing to push the regulation message to each node in the first node group 12.
[0048] Step S103, when the number of rounds of the first-phase push is greater than or equal to the preset number of push rounds, perform the second-phase push, and the second-phase push is used to push the regulation message to the second node group.
[0049] In a possible implementation, the preset number of push rounds is configured as one round of push, that is, during the first-phase push, the regulation message is directly pushed to each node in the first node group. As already mentioned in the description of Figure 1 in this specification, during the first phase, it is the initial stage of the propagation of the regulation message. During the first phase, even through multiple rounds of propagation, the number of nodes that have completed the push of the regulation message is still small. Therefore, when the number of notified nodes in the network is small, during the process of the first phase, the regulation message can be directly pushed to the first node group, thereby increasing the speed of the first-phase push.
[0050] In a possible implementation, the preset number of push rounds is configured as multiple rounds of push, and the actual number of push rounds can be determined according to the number of nodes and the number of important nodes in the notified network. When performing multiple rounds of notification, it is necessary to consider both the economic cost of achieving the push and the push speed.
[0051] In a possible implementation, the important nodes are configured as the first node group. The important nodes are the nodes that play an important role in the notified network. Since the first node group is the node that is preferentially pushed the regulation message. Therefore, configuring the important nodes as the first node group can enable the important nodes to obtain the push at the initial stage of the propagation of the regulation message. In the embodiments of the present application, the configuration process of the important nodes is not specifically described. It should be understood that the important nodes can be specifically set according to the actual needs of the user.
[0052] In a possible implementation, performing the second-phase push specifically includes: performing the second-phase push by using a hierarchical notification path, and the hierarchical notification path includes a hierarchical notification path based on a k-ary tree or a hierarchical notification path based on the Gossip rumor spreading algorithm.
[0053] For example, the hierarchical notification path based on a k-ary tree is used for network push in the second-phase push, and the hierarchical notification path based on the Gossip rumor spreading algorithm is used for wireless network push in the second-phase push.
[0054] Step S104, detect the efficiency of the second-phase push.
[0055] For example, as Figure 1As shown in Figure 2, in the second stage, during the push rounds round11-round23, when executing the second stage push, the push efficiency of each round can be determined by the ratio of the number of valid propagation nodes in this round to the number of valid propagation nodes in the previous round. In the early stage of the second stage, when the hierarchical notification approach is used to execute the second stage push, in each push round, a single node pushes out K times ( Figure 1 The K value is set to 2), and the push efficiency is very close to 2 in the early stage of the second stage. As the push rounds increase, the efficiency gradually decreases. Among them, the efficiency of round 23 is μ 23 ; The push efficiency calculation formula is as follows:
[0056] μ 23 =n 23 / n 22 , about 20.8%. Among them, n 23 is the number of effective propagation nodes in round 23, n 22 is the number of effective transmission nodes in round 22. The above is a scenario with message confirmation feedback, and there is also a scenario without message feedback. In this case, if the total number of nodes and forwarding numbers, the probability of successful message transmission, etc. are known, a mathematical model can be established to calculate the round at which the second stage ends.
[0057] It should be noted that in the embodiment of the present application, the k value in the hierarchical notification path based on the k-ary tree can be dynamically changed according to the actual message push requirements. The embodiment of the present application is only given as an example and is not limited to this.
[0058] Step S105: determine that the second-stage push efficiency is less than or equal to the preset push efficiency, and send a pull notification to the third node group, where the pull notification is used to control the third node group to pull the control message.
[0059] For example, the preset push efficiency is configured as 21%, and the second-stage push efficiency is determined to be less than or equal to the preset push efficiency, and a pull notification is sent to the third node group, and the pull notification is used to control the third node group to pull the regulation message. The preset push efficiency is only given as an example in the embodiment of the present application, and can be determined according to the specific requirements of the notification network in actual application.
[0060] In a possible implementation, sending the pull notification to the third node group specifically includes: simultaneously using a push approach among a broadcast push approach, a hierarchical push approach, and a telecommunications point-to-point push approach to send the pull notification to the third node group.
[0061] For example, the broadcast channels adopted in the embodiments of the present application include analog broadcast, digital broadcast, broadcast of the type integrating broadcast and telecommunication protocols such as 5G broadcast (FeMBMS, Further evolved Multimedia Broadcast Multicast Service), multicast / broadcast in telecommunication network devices, broadcast in power line carrier communication, and so on. The telecommunication point-to-point push channel is based on the telecommunication network and uses the point-to-point method to simulate the notification from one point to multiple points, such as various notification channels in the Android and Apple ecosystems.
[0062] Step S106, when the third node group finishes pulling the control message, it is determined that the node has completed receiving the control message, where the node includes any one of the first node group, the second node group, and the third node group.
[0063] In a possible implementation manner, determining that the node has completed receiving the control message specifically includes: in response to the feedback notification of the node, obtaining the proportion of the number of nodes that have received the control message to the total number of nodes; determining whether the proportion at the preset time point is greater than or equal to the preset first proportion; when the proportion at the preset time point is greater than or equal to the preset first proportion, it is determined that the node has completed receiving the control message.
[0064] As Figure 4 shown, determining that the node has completed receiving the control message specifically includes steps S201 - S2031.
[0065] Step S201, in response to the feedback notification of the node, obtaining the proportion of the number of nodes that have received the control message to the total number of nodes.
[0066] For example, after pushing the control message to the node, the node that has received the control message will return a feedback notification, and the message confirmation server determines the proportion of the number of nodes that have received the control message to the total number of nodes according to the number of received feedback notifications.
[0067] Step S202, determining whether the proportion at the preset time point is greater than or equal to the preset first proportion.
[0068] Step S2031, when the proportion at the preset time point is greater than or equal to the preset first proportion, it is determined that the node has completed receiving the control message.
[0069] For example, when the proportion at the preset time point is greater than or equal to the preset first proportion, it is determined that the node has completed receiving the control message. The preset first proportion is 99.999%. The higher the preset first proportion, the higher the required reliability. In the embodiments of the present application, the time delay can be controlled within 300 milliseconds. According to the preset time delay actually required by the notification network, the preset time point is determined. Specifically, the preset time point can be expressed as the time point reached after adding the preset time delay to the time point when the message starts to be notified.
[0070] In a possible implementation, as Figure 5 shown, the method further includes steps S2032 - S204.
[0071] Step S2032, when the quantity ratio of preset time points is less than a preset second ratio, detect whether the first central node is damaged. The first central node is used to transmit feedback notifications and perform summarization.
[0072] Step S204, when the first central node is damaged, call the second central node to transmit feedback notifications and perform summarization.
[0073] For example, for steps S2032 - S204, according to the above description of the preset time points, when the quantity ratio of preset time points is less than the preset second ratio, it means that within the preset time delay in the notification network, the central node has not received feedback notifications sent by nodes of the preset second ratio. At this time, it can be considered in the notification network that there is a situation where the central node is damaged. When the first central node is damaged, call the second central node to transmit feedback notifications and perform summarization. In practice, multiple central nodes can be set as backups.
[0074] In a possible implementation, the method further includes: detecting failed nodes among the nodes involved in network push. A failed node is a node that fails to receive a regulation message or cannot complete the push of a regulation message; notifying nearby nodes of the failed node to perform cross - region push.
[0075] For example, as Figure 6 shown, when the failed node 13 cannot complete the push for the next - level node, nearby nodes that have completed the push of the regulation message re - transmit and perform cross - region push. Push the regulation message to the failed node 13, thereby realizing the message push to the node 14 that has not completed the reception of the regulation message. In the embodiments of the present application, the number of failed nodes for testing is configured to be 10%. Among them, the Internet push simulation still maintains a 100 - ms delay and a 90% message normal propagation rate (10% of the messages require mutual assistance and re - transmission between nodes). The size of a common data table (Packet) on the Internet is 1.5K, and the mainstream value of the size of the power grid dispatching message after encryption is 50KB - 500KB. Taking 150KB, 0.1%, and assuming that the packet loss before and after is independent for simplifying the test model, then the message normal propagation rate = 99.9 ^ (150 / 1.5) = 90%. Therefore, the message normal propagation rate is taken as 90%.
[0076] In a possible implementation, in the initial message propagation path, a cross - region push and pull path is added in the k - ary tree and the Gossip algorithm.
[0077] Below, taking the satellite channel, which has the longest delay among broadcast channels, as an example, the Internet push method that only uses the Gossip rumor spreading algorithm and the push method of Internet + satellite data broadcast are analyzed;
[0078] 1. Satellite data broadcast channel
[0079] 1. Delay: Multiplexer (~<400ms), satellite channel (270ms);
[0080] 2. Normal message propagation rate: The bit error rate of the satellite channel should be the main factor. Calculated with a relatively good bit error rate of 10-7, the normal message propagation rate is:
[0081] 5KB small file 0.9999999^40000=99.6% 50KB file 0.9999999^400000=96.1% 500KB file 0.9999999^4000000=67.0%
[0082] 2. Internet + satellite data broadcast
[0083] 3. Delay: Take the minimum value (Internet rumor spreading transmission delay, satellite data broadcast delay);
[0084] 4. Normal message propagation rate. Since the Internet and satellite data broadcast are parallel and the two channels are independent and not related. The propagation rates of different sized files can be obtained as follows:
[0085]
[0086] It can be seen that for rumor spreading communication enhanced by satellite data broadcast, even in the scenario where the satellite data broadcast success rate is as low as 67.0% when the message file is extremely large, Internet + satellite data broadcast can still be helpful for message transmission, reducing the pressure of mutual retransmission between nodes and accelerating the message propagation speed. Applied to a distributed new energy power grid, it improves the reliability and real-time performance of the control message propagation.
[0087] In a possible implementation manner, a push method based on Gossip rumor spreading is used to perform the first-stage push, the second-stage push, and send a pull notification to the third node group.
[0088] This application uses the blockchain testing tool Project Caliper to test the embodiments provided by this application. The embodiments of this application are based on the Project caliper testing framework, and record the number of messages processed per second (TPS, Transaction Per Second) and latency in the test results. Among them, empty-contract-submit, create-asset-1000, and range-query-submit in the embodiments of this application are all project names set based on the testing tool.
[0089] Table 1 is a parameter setting table for the first test case based on the Gossip rumor spreading push path.
[0090]
[0091] Table 1
[0092] The test results of the first test case are shown in Table 2:
[0093]
[0094] Table 2 and Table 3 are parameter setting tables for the second test case based on Gossip rumor spreading and data broadcast push paths.
[0095]
[0096] Table 3
[0097] The test results of the second test case are shown in Table 4:
[0098]
[0099] Table 4
[0100] From the test results of the above two test cases, it can be seen that compared with the first test case, in the second test case, the maximum delay, average delay, and delay jitter are all significantly reduced.
[0101] The beneficial effects that can be achieved by the present application by adopting the above method are as follows: It realizes that the distributed energy storage section and interruptible load in the new energy power grid can respond to the dispatching messages of the power grid in real time and reliably, ensuring that the control messages can reach each node in time. In the second stage of message push, a hierarchical notification path based on the k-ary tree or a hierarchical notification path based on the Gossip rumor spreading algorithm is adopted, improving the reliability of message push. By detecting the failed nodes in the nodes involved in network push and notifying the nearby nodes of the failed nodes for cross-region push, it is ensured that when message push cannot be completed due to the existence of failed nodes, remedies can be made, thereby improving the reliability of the message push process. It improves the speed when sending pull notifications to the third node group. The message confirmation server can determine the proportion of nodes that have received the control message. When it is detected that the proportion at the preset time point is less than the preset second proportion, the message server adjusts the way of transmitting feedback notifications by detecting whether the first central node is damaged.
[0102] An embodiment of the present application provides a message determination device based on a distributed new energy power grid, such as Figure 7As shown in the figure, the device includes a first push module 701, a first detection module 702, a second push module 703, a second detection module 704, a notification module 705, and a confirmation module 706. The first push module 701 is used to execute a first-stage push in response to a regulation action of a regulation terminal. The first-stage push is used to push a regulation message to a first node group. The first detection module 702 is used to detect the number of rounds of the first-stage push. The second push module 703 is used to execute a second-stage push when the number of rounds of the first-stage push is greater than or equal to a preset push round. The second-stage push is used to push the regulation message to a second node group. The second detection module 704 is used to detect the efficiency of the second-stage push. The notification module 705 is used to determine that the efficiency of the second-stage push is less than or equal to a preset push efficiency, and send a pull notification to a third node group. The pull notification is used to control the third node group to pull the regulation message. The confirmation module 706 is used to determine that the node has completed receiving the regulation message when the third node group has completed pulling the regulation message. The node includes any one of the first node group, the second node group, and the third node group.
[0103] In a possible implementation manner, the second push module 703 includes a second push unit. The second push unit is used to execute the second-stage push by using a hierarchical notification path. The hierarchical notification path includes a hierarchical notification path based on a k-ary tree or a hierarchical notification path based on a Gossip rumor spreading algorithm.
[0104] In a possible implementation manner, the device further includes a failed node detection module and a cross-region push module. The failed node detection module is used to detect failed nodes among the nodes involved in the second-stage push. A failed node is a node that fails to receive the regulation message or cannot complete the push of the regulation message. The cross-region push module is used to notify nearby nodes of the failed node to perform cross-region push.
[0105] In a possible implementation manner, the notification module 705 includes a notification unit. The notification unit is used to send a pull notification to the third node group by using one or more push paths among a broadcast push path, a hierarchical push path, or a telecom point-to-point push path.
[0106] In a possible implementation manner, the confirmation module 706 includes a first confirmation unit, a second confirmation unit, and a third confirmation unit. The first confirmation unit is used to obtain the proportion of the number of nodes that have received the regulation message to the total number of nodes in response to a feedback notification of the node. The second confirmation unit is used to determine whether the proportion at a preset time point is greater than or equal to a preset first proportion. The third confirmation unit is used to determine that the node has completed receiving the regulation message when the proportion at the preset time point is greater than or equal to the preset first proportion.
[0107] In a possible implementation, the confirmation module 706 includes a fourth confirmation unit and a fifth confirmation unit. The fourth confirmation unit is configured to detect whether the first central node is damaged when the quantity ratio at a preset time point is less than a preset second ratio, where the first central node is used to transmit feedback notifications and perform summarization. The fifth confirmation unit is configured to, when the first central node is damaged, call the second central node to transmit feedback notifications and perform summarization.
[0108] In a possible implementation, the first push module 701 includes a first push unit. The first push unit is configured to perform a first-stage push by using one or more of a broadcast push approach, a telecommunications point-to-point push approach, and a hierarchical notification push approach.
[0109] It should be noted that: when the device provided in the above embodiment implements its functions, only the division of the above function modules is used for illustration. In actual applications, the above functions can be allocated to different function modules according to needs, that is, the internal structure of the device is divided into different function modules to complete all or part of the functions described above. In addition, the device and method embodiments provided in the above embodiments belong to the same concept, and the specific implementation process can be seen in the method embodiment, which will not be elaborated here.
[0110] Please refer to Figure 8 , which is a schematic structural diagram of an electronic device provided by an embodiment of the present application. As Figure 8 shown, the electronic device 800 may include: at least one processor 801, at least one network interface 804, a user interface 803, a memory 805, and at least one communication bus 802.
[0111] Among them, the communication bus 802 is used to realize the connection and communication between these components.
[0112] Among them, the user interface 803 may include a display screen (Display) and a camera (Camera). Optionally, the user interface 803 may further include a standard wired interface and a wireless interface.
[0113] Among them, the network interface 804 may optionally include a standard wired interface and a wireless interface (such as a WI-FI interface).
[0114] Among them, the processor 801 may include one or more processing cores. The processor 801 connects various parts within the entire server through various interfaces and lines. By running or executing instructions, programs, code sets, or instruction sets stored in the memory 805, and by calling the data stored in the memory 805, it performs various functions of the server and processes data. Optionally, the processor 801 may be implemented in at least one hardware form of digital signal processing (DSP), field-programmable gate array (FPGA), or programmable logic array (PLA). The processor 801 may integrate a combination of one or more of a central processing unit (CPU), a graphics processing unit (GPU), and a modem, etc. Among them, the CPU mainly processes the operating system, user interface, application programs, etc.; the GPU is responsible for rendering and drawing the content to be displayed on the display screen; the modem is used to process wireless communication. It can be understood that the above-mentioned modem may not be integrated into the processor 801 and may be implemented separately by a single chip.
[0115] Among them, the memory 805 may include random access memory (RAM) and may also include read-only memory. Optionally, the memory 805 includes a non-transitory computer-readable storage medium. The memory 805 can be used to store instructions, programs, code, code sets, or instruction sets. The memory 805 may include a program storage area and a data storage area. Among them, the program storage area may store instructions for implementing the operating system, instructions for at least one function (such as touch function, sound playback function, image playback function, etc.), instructions for implementing the above-mentioned various method embodiments, etc.; the data storage area may store the data involved in the above-mentioned various method embodiments. Optionally, the memory 805 may also be at least one storage device located far from the aforementioned processor 801. As Figure 8 shown, the memory 805, as a computer storage medium, may include an operating system, a network communication module, a user interface module, and an application program for a message notification method.
[0116] In Figure 8In the electronic device 800 shown, the user interface 803 is mainly used to provide an interface for the user to input and obtain the data input by the user; and the processor 801 can be used to call an application program storing a message notification method in the memory 805. When executed by one or more processors, the electronic device is caused to execute one or more of the methods as described in the foregoing embodiments.
[0117] An electronic device-readable storage medium stores instructions. When executed by one or more processors, the electronic device is caused to execute one or more of the methods as described in the foregoing embodiments.
[0118] It should be noted that, for the foregoing method embodiments, for simplicity of description, they are all expressed as a series of action combinations. However, those skilled in the art should know that this application is not limited by the described action sequence, because according to this application, certain steps can be performed in other sequences or simultaneously. Secondly, those skilled in the art should also know that the embodiments described in the specification are all preferred embodiments, and the actions and modules involved are not necessarily essential to this application.
[0119] In the foregoing embodiments, the descriptions of the various embodiments each have their own focuses. For the parts not detailed in a certain embodiment, reference can be made to the relevant descriptions of other embodiments.
[0120] In several embodiments provided by this application, it should be understood that the disclosed device can be implemented in other ways. For example, the device embodiments described above are merely illustrative. For example, the division of the units is only a logical function division. In actual implementation, there can be other division methods. For example, multiple units or components can be combined or integrated into another system, or some features can be ignored or not executed. Another point is that the displayed or discussed mutual coupling or direct coupling or communication connection can be through some service interfaces. The indirect coupling or communication connection of the device or unit can be in an electrical or other form.
[0121] The units described as separate components may or may not be physically separated. The components displayed as units may or may not be physical units, that is, they can be located in one place or distributed to multiple network units. Some or all of the units can be selected according to actual needs to achieve the purpose of the solution of this embodiment.
[0122] In addition, in each embodiment of this application, the various functional units can be integrated in a processing unit, or each unit can exist physically alone, or two or more units can be integrated in one unit. The above-mentioned integrated units can be implemented in the form of hardware or in the form of software functional units.
[0123] If the integrated unit is implemented in the form of a software functional unit and sold or used as an independent product, it can be stored in a computer-readable memory. Based on this understanding, the technical solution of this application, in essence, or the part that contributes to the prior art, or all or part of this technical solution, can be embodied in the form of a software product. This computer software product is stored in a memory and includes several instructions for causing a computer device (which can be a personal computer, a server, or a network device, etc.) to execute all or part of the steps of the methods described in various embodiments of this application. The aforementioned memory includes: various media such as USB flash drives, mobile hard disks, magnetic disks, or optical discs that can store program codes.
[0124] The above are only exemplary embodiments of the present disclosure and should not be used to limit the scope of the present disclosure. That is, any equivalent changes and modifications made in accordance with the teachings of the present disclosure still fall within the scope covered by the present disclosure. Those skilled in the art will easily think of other implementation schemes of the present disclosure after considering the specification and the disclosure of the practical truth. This application aims to cover any variations, uses, or adaptive changes of the present disclosure, and these variations, uses, or adaptive changes follow the general principles of the present disclosure and include common general knowledge or conventional technical means in the technical field not recorded in the present disclosure.
Claims
1. A message notification method, characterized in that, In an application message push server, the method includes: In response to a regulation action of a regulation terminal, perform a first-stage push, where the first-stage push is used to push a regulation message to a first node group; Detect the first-stage push round; When the first-stage push round is greater than or equal to a preset push round, perform a second-stage push, where the second-stage push is used to push the regulation message to a second node group. Performing the second-stage push includes: performing the second-stage push using a hierarchical notification approach, where the hierarchical notification approach includes one or both of a hierarchical notification approach based on a k-ary tree and a hierarchical notification approach based on the Gossip rumor spreading algorithm; Detect the second-stage push efficiency. Detecting the second-stage push efficiency includes: determining the push efficiency of each round based on the ratio of the number of effective propagation nodes in this round to the number of effective propagation nodes in the previous round; When it is determined that the second-stage push efficiency is less than or equal to a preset push efficiency, send a pull notification to a third node group, where the pull notification is used to control the third node group to pull the regulation message; When the third node group finishes pulling the regulation message, determine that the node has finished receiving the regulation message, where the node includes any one of the first node group, the second node group, and the third node group.
2. The method according to claim 1, wherein The method further includes: Detect failed nodes among the nodes involved in the second-stage push, where the failed nodes are nodes that fail to receive the regulation message or cannot complete the push of the regulation message; Notify nearby nodes of the failed nodes to perform cross-region push.
3. The method according to claim 1, wherein The sending the pull notification to the third node group specifically includes: Sending the pull notification to the third node group using one or more of a broadcast push approach, a hierarchical push approach, or a telecommunications point-to-point push approach.
4. The method according to claim 1, characterized in that The determining that the node has finished receiving the regulation message specifically includes: In response to a feedback notification of the node, obtain the proportion of the number of nodes that have received the regulation message to the total number of nodes; Judge whether the proportion at a preset time point is greater than or equal to a preset first proportion; When the proportion at the preset time point is greater than or equal to the preset first proportion, determine that the node has finished receiving the regulation message.
5. The method according to claim 4, wherein The method further includes: When the proportion at the preset time point is less than a preset second proportion, detect whether a first central node is damaged, where the first central node is used to transmit the feedback notification and perform summarization; When the first central node is damaged, call a second central node to transmit the feedback notification and perform summarization.
6. The method according to claim 1, wherein The performing the first-stage push specifically includes using one or more of a broadcast push approach, a telecommunications point-to-point push approach, and a hierarchical notification push approach.
7. The method according to claim 1, characterized in that The sending approach of the pull notification includes one or more of a broadcast push approach and a telecommunications point-to-point push approach.
8. A message notification device, characterized in that, The device includes a first push module, a first detection module, a second push module, a second detection module, a notification module, and a confirmation module; The first push module is configured to perform a first-stage push in response to a regulation action of a regulation terminal, and the first-stage push is used to push a regulation message to a first node group; The first detection module is configured to detect the first-stage push round; The second push module is configured to perform a second-stage push when the first-stage push round is greater than or equal to a preset push round. The second-stage push is used to push the regulation message to a second node group. Performing the second-stage push includes: performing the second-stage push by using a hierarchical notification path, and the hierarchical notification path includes one or both of a hierarchical notification path based on a k-ary tree and a hierarchical notification path based on a Gossip rumor spreading algorithm; The second detection module detects the second-stage push efficiency. Detecting the second-stage push efficiency includes: the push efficiency of each round is determined based on the ratio of the number of effective propagation nodes in this round to the number of effective propagation nodes in the previous round; The notification module is configured to determine that the second-stage push efficiency is less than or equal to a preset push efficiency, and send a pull notification to a third node group, and the pull notification is used to control the third node group to pull the regulation message; The confirmation module is configured to determine that a node has completed receiving the regulation message when the third node group has completed pulling the regulation message, and the node includes any one of the first node group, the second node group, and the third node group.
9. An electronic device, characterized in that, It includes a processor, a memory, a user interface, and a network interface. The memory is used to store instructions, the user interface and the network interface are used to communicate with other devices, and the processor is used to execute the instructions stored in the memory so that the electronic device executes the method according to any one of claims 1-7.
Citation Information
Patent Citations
Configuration center information synchronization method and system
CN113703866A
Communication mode coordination method, device, equipment, system and medium in Gossip algorithm based on data broadcasting
CN115051924A