Broadcasting method, apparatus and communication device based on star system

Abstract

The application provides a broadcast method and device based on a star map system and a communication device. The method comprises: obtaining parameter information of each node in the star map system; taking any node as a reference center, recursively dividing the star map system into multiple layers of star areas until the number of layers of the star areas reaches a preset broadcast layer number; projecting each node to a corresponding star area; determining a node with the minimum path propagation cost in each star area as a key node according to the parameter information; selecting any one node from each node to initiate a broadcast outward according to the number of layers of the star areas, so that the key nodes of each star area in the current layer receive broadcast data and broadcast to the remaining nodes in the corresponding star area, while continuously broadcasting to the key nodes of the next layer of star areas until the current broadcast layer number reaches the preset broadcast layer number. The technical scheme can complete the network-wide broadcast within a time limit, and the path is matched with the actual link quality in real time, solving the problems of path deviation, uncontrollable depth and long convergence in the prior art.

Description

TECHNICAL FIELD

[0001] The present application relates to the technical field of network communication, and particularly relates to a broadcast method and device based on a star map system and a communication device. BACKGROUND

[0002] In the prior art, when a distributed network (such as a P2P network or a blockchain overlay network) performs network-wide broadcasting, a static adjacency list or a single routing tree is usually used: a global shortest path is first calculated, and then the root node forwards the broadcast message level by level. Such a method does not take the real-time network state (such as round-trip delay, packet loss rate, and bandwidth utilization) of each node into account when selecting a path, which causes the shortest path to deviate from the actual fastest path. In addition, the broadcast depth has no upper limit on the number of layers, and when the scale is large, problems such as loop and long convergence time are likely to occur. SUMMARY

[0003] The present application provides a broadcast method and device based on a star map system and a communication device, which recursively divides star areas layer by layer, dynamically selects key nodes in the star areas, and limits the number of preset broadcast layers, so that the network-wide broadcast path is real-time matched with the actual link quality.

[0004] In a first aspect, the present application provides a broadcast method based on a star map system, which comprises: acquiring parameter information of each node in the star map system, wherein the parameter information comprises a node address and network state data; recursively dividing the star map system into multiple layers of star areas with any node as a reference center until the number of star area layers reaches a preset broadcast layer number; projecting each node to a corresponding star area; determining a node with the minimum path propagation cost in each star area as a key node according to the parameter information; and initiating a broadcast from any one of the nodes according to the number of star area layers, so that the key nodes of each star area in the current layer receive broadcast data and broadcast to the remaining nodes in the corresponding star area, while continuously broadcasting to the key nodes of the next layer of star areas until the current broadcast layer number reaches the preset broadcast layer number.

[0005] In a second aspect, the embodiment of the present application provides a broadcasting device based on a star graph system, which comprises a parameter acquisition module, a star region division module, a projection module, a key node acquisition module and a broadcasting module. The parameter acquisition module is configured to acquire parameter information of each node in the star graph system, wherein the parameter information comprises node address and network state data. The star region division module is configured to divide the star graph system into multiple layers of star regions recursively with any node as a reference center until the number of star region layers reaches a preset broadcasting layer number. The projection module is configured to project each node to a corresponding star region. The key node acquisition module is configured to determine a node with minimum path propagation cost in each star region as a key node according to the parameter information. The broadcasting module is configured to initiate broadcasting from any one of the nodes according to the number of star region layers, so that the key nodes of each star region in the current layer receive the broadcast data and broadcast to the remaining nodes in the corresponding star region, while continuously broadcasting to the key nodes of the next layer of star regions until the current broadcasting layer number reaches the preset broadcasting layer number.

[0006] In a third aspect, the embodiment of the present application provides a communication device, which is configured with the broadcasting device based on the star graph system.

[0007] The broadcasting method, device and communication device based on the star graph system have the advantages that the star region is recursively divided, the key nodes are dynamically weighted and selected in the star region, and the preset broadcasting layer number is limited, so that the network data is diffused within a time limit, the path matches the real-time link quality, the path deviation, uncontrollable depth and long convergence are avoided, and high-speed and stable network broadcasting is achieved. BRIEF DESCRIPTION OF DRAWINGS

[0008] In order to more clearly illustrate the technical solutions in the embodiments of the present application or the prior art, the drawings needed in the embodiments or prior art description will be briefly introduced. Obviously, the drawings in the following description are only some embodiments of the present application, and other drawings can be obtained by those skilled in the art without creative labor.

[0009] Figure 1 The first flowchart of the broadcasting method based on the star graph system provided by the embodiment of the present application.

[0010] Figure 2 The flowchart of the step S102 sub-step provided by the embodiment of the present application.

[0011] Figure 3 The flowchart of the step S103 sub-step provided by the embodiment of the present application.

[0012] Figure 4 The flowchart of the step S104 sub-step provided by the embodiment of the present application.

[0013] Figure 5 Flow chart of sub-step of step S1041 provided for the embodiment of the present application.

[0014] Figure 6 Flow chart of sub-step of step S1042 provided for the embodiment of the present application.

[0015] Figure 7 Flow chart of sub-step of step S105 provided for the embodiment of the present application.

[0016] Figure 8 Second flow chart of broadcasting method based on star map system provided for the embodiment of the present application.

[0017] Figure 9 Schematic diagram of parameter information of each node in star map system provided for the embodiment of the present application.

[0018] Figure 10 First schematic diagram of virtual node set provided for the embodiment of the present application.

[0019] Figure 11 Second schematic diagram of virtual node set provided for the embodiment of the present application.

[0020] Figure 12 Structure block diagram of broadcasting device based on star map system provided for the embodiment of the present application.

[0021] Figure 13 Structure block diagram of communication equipment provided for the embodiment of the present application.

[0022] The implementation, functional features and advantages of the present application will be further explained with reference to the embodiments and the accompanying drawings. DETAILED DESCRIPTION

[0023] In order to make the objectives, technical solutions and advantages of the present application clearer, further detailed description will be made to the present application with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are only used to explain the present application, and are not used to limit the present application. Based on the embodiments in the present application, all other embodiments obtained by those skilled in the art without creative labor fall within the scope of protection of the present application.

[0024] The terms "first", "second", "third", "fourth" etc. (if any) in the description, claims, and drawings of the present application, if and as the case can be, are utilized merely to distinguish a like reference from another, and do not necessarily have to describe a particular chronological or relative order. It is to be understood that data so used can be interchanged, where appropriate, to refer to other than the data described in which case they are refened to or the embodiments described are carried out in other than the order described, or both. Furthermore, the terms "comprising" and "including" and any of their derivations, also encompass the case of

[0025] It is to be noted that the terms "first", "second", etc. in the description of the present application are only for the purpose of description and can not be understood as indicating or implying their relative importance or implicitly indicating the number of the technical features indicated. Therefore, the features defined as "first", "second" can explicitly or implicitly include one or more of the features. In addition, the technical solutions of various embodiments can be combined with each other, but it must be based on the fact that a person skilled in the art can realize it, when the combination of technical solutions contradicts each other or cannot be realized, it should be considered that the combination of technical solutions does not exist, nor within the protection scope required by the present application.

[0026] Please refer to Figure 1 , which is the first flowchart of the broadcast method based on the star map system provided by the embodiments of the present application. The present application provides a broadcast method based on a star map system, which aims to limit the number of propagation layers within the preset broadcast layer number, that is, to complete the data diffusion of each node in the star map system, so that the full-network broadcast path is real-time matched with the actual link quality. The star map system is a virtual topology network running on a decentralized physical network. Each node is a data receiving and transmitting terminal, and can also undertake routing, relay and broadcast forwarding functions. The broadcast method comprises steps S101-S105.

[0027] In step S101, the parameter information of each node in the star map system is obtained.

[0028] In step S101, the parameter information includes node address and network state data. The node address includes the physical address and the virtual address obtained by address projection. The network state data can be one or more of round-trip delay, packet loss rate, bandwidth utilization, etc. In the present application, each node encapsulates the physical address, virtual address and the above network state data of the node and its neighbors into parameter information through periodic neighbor link detection.

[0029] As shown in Figure 9 , Figure 9The different dimensions (X, Y, Z axis) of the node and the corresponding network state data are illustrated. Among them, the coordinate values of X and Y axis direction represent the physical position of the node in the star system, and then feedback the distribution of each node in the star system. The peak-shaped part corresponding to each node in the Z axis direction is used to reflect the corresponding statistical network state data. For example, when Figure 9 When the round-trip delay (unit: ms) of each node is counted, the height of the peak-shaped part of each node in the Z axis direction can correspondingly feedback the size of the current network delay of the star system.

[0030] Step S102, recursively divide the star system into multiple layers of star regions with any node as the reference center, until the number of star region layers reaches the preset broadcast layer number. Please refer to Figure 2 , which is a flowchart of the sub-step S102 of the embodiment of the application. Recursively divide the star system into multiple layers of star regions with any node as the reference center, until the number of star region layers reaches the preset broadcast layer number, including steps S1021-S1022.

[0032] Step S1021, divide the star system into the current layer of star regions according to the preset number of parts with the reference center as the origin and update the current number of star region layers.

[0033] In step S1021, with the reference center as the origin, the system first divides the three-dimensional coordinate space by the preset number of parts (for example, 64 parts) for the first time to form 64 star regions in the first layer. At the same time, record the current number of star region layers as 1. This division can be based on Hilbert curve or fixed angle / distance step to ensure that each star region is continuous in space and the volume is approximately equal, providing a uniform grid for subsequent projection.

[0034] Step S1022, divide each current layer of star regions into the next layer of star regions according to the preset number of parts and update the current number of star region layers until the number of star region layers reaches the preset broadcast layer number.

[0035] In step S1022, each k-th layer of star regions is again divided by the same preset number of parts (for example, 64 parts) to generate the k+1-th layer of sub-star regions, and the current number of star region layers is updated to k+1; repeat the process until the cumulative number of layers reaches the preset broadcast layer number (for example, 4 layers). Thus, a hierarchical structure of 64→64 2 →64 3 →64 4 is formed, each layer maintains the same number of parts, ensuring that the broadcast hop count is controllable and easy to implement in parallel with hardware.

[0036] Step S103, project each node into the corresponding star region.

[0037] In step S103, each node is projected to the corresponding star area, and the mapping of "physical node → virtual node → star area grid" is completed, providing a unified coordinate basis for subsequent key node calculation in the star area.

[0038] Please refer to Figure 3 , which is a flowchart of the sub-step S103 of step S103 provided by the embodiment of the application. Projecting each node to the corresponding star area includes steps S1031-S1032.

[0039] In step S1031, the virtual address corresponding to the projection coordinates is obtained through a preset address projection function with the physical address as the input.

[0040] In step S1031, the virtual address corresponding to the projection coordinates is obtained through a preset address projection function (such as Hilbert three-dimensional hash or reversible hash) with the physical address as the input; the coordinates are globally unique in the star map system and maintain a fixed relative relationship with the reference center, ensuring that the node can be repeatedly projected to the same virtual coordinates at any time and in any position, avoiding mapping drift.

[0041] In step S1032, the star area corresponding to each node is determined according to the projection coordinates and the reference center.

[0042] In step S1032, the star area corresponding to each node is determined according to the projection coordinates and the reference center. Since there are multiple layers of star areas, the fast positioning can be completed through top-down comparison layer by layer until the bottom layer of star area, providing accurate boundaries for subsequent star area weighted graph generation and key node selection.

[0043] In step S104, the node with the minimum path propagation cost in each star area is determined as the key node according to the parameter information.

[0044] Please refer to Figure 4 , which is a flowchart of the sub-step S104 of step S104 provided by the embodiment of the application. Determining the node with the minimum path propagation cost in each star area as the key node according to the parameter information includes steps S1041-S1043.

[0045] In step S1041, the network state weighted graph of the corresponding star area is generated according to the network state data of each node in each star area.

[0046] In step S1041, each node forms a physical node set composed of physical addresses and its corresponding connection path set, and a virtual node set composed of virtual addresses and its corresponding connection path set through physical addresses and virtual addresses, and assigns appropriate weights to each connection path to generate a network state weighted graph in the subsequent step.

[0047] Please refer to Figure 5which is a flow chart of the sub-step S1041 provided by the embodiment of the present application. The network state weighted graph of the corresponding star region is generated according to the network state data of each node in each star region, including steps S10411-S10413.

[0048] In step S10411, the network state data of each node in each star region is taken as input to construct a virtual node set corresponding to each node in the corresponding star region and construct a virtual connection path set corresponding to the virtual nodes, so that the virtual node set and the virtual connection path set form a virtual topology framework.

[0049] In step S10411, the projection mapping ensures that the same physical node can be projected to the same virtual coordinate at any time, and the coordinates of the virtual node set obtained therefrom are as shown in Figure 10 and Figure 11 The positions of each "star point" in the virtual node set form a virtual topology space decoupled from the physical topology. Specifically, Figure 10 and Figure 11 The projection coordinates of each virtual node and the star region in different dimension directions (X, Y axis) are shown in

[0050] In step S10412, each connection path in the virtual topology framework is assigned a corresponding weight value.

[0051] In step S10412, the weight value is used to represent the time consumed in the corresponding connection path propagation. Each connection path in the connection path set corresponding to the virtual node set is assigned a corresponding weight value to obtain the measured indicators of the underlying physical path in real time. Specifically, the weight value in the present application is used to represent the time consumed in the corresponding connection path propagation. Figure 10 and Figure 11 The corresponding value of the Z axis in

[0052] In step S10413, the network state weighted graph of the corresponding star region is generated based on the virtual topology framework and the corresponding weight value.

[0053] In step S10413, the virtual node set of the corresponding star region, the connection path set corresponding to the virtual node set, and the real-time weight value of each connection path are encapsulated as a weighted adjacency matrix to form a network state weighted graph. Specifically, the node address can be represented as:

[0054] wherein represents a node address, , respectively represent a physical node set and its corresponding connection path set of a corresponding star region, , respectively represent a virtual node set and its corresponding connection path set of a corresponding star region. The present application assigns a corresponding weight value to each connection path in the connection path set corresponding to the virtual node set of the corresponding star region to represent the time consumed in the corresponding connection path propagation.

[0055] In step S1042, a shortest path matrix of the corresponding star region is formed by obtaining the shortest path result between any two nodes in the corresponding star region according to the network state weighted graph of the corresponding star region.

[0056] Please refer to Figure 6 which is a flow chart of the sub-step S1042 of the step S1042 provided by the embodiments of the present application. Obtaining the shortest path result between any two nodes in the corresponding star region according to the network state weighted graph of the corresponding star region to form the shortest path matrix of the corresponding star region includes steps S10421-S10422.

[0057] In step S10421, path calculation is performed on the virtual node set according to the network state weighted graph of the corresponding star region to obtain a distance matrix and a successor node matrix.

[0058] In step S10421, the path calculation can be calculated by the Floyd-Warshall algorithm. The distance matrix is used to reflect the path propagation cost between any two nodes in the corresponding star region. The successor node matrix is used to record the minimum path propagation cost and the corresponding two nodes in the path propagation cost of the corresponding star region.

[0059] In step S10422, the shortest path matrix of the corresponding star region is generated based on the distance matrix and the successor node matrix.

[0060] In step S10422, for each node of the corresponding star region, the present application characterizes whether the node is associated with each connection path by defining an associated variable. The associated variable includes a first variable representing an association and a second variable representing no association. In the present application, the associated variable can be a binary value, specifically, the first variable can be 1 and the second variable can be 0, which is convenient for subsequent path calculation. After determining the association between each node and each connection path, the shortest path of the virtual node between any two nodes in each node can be represented as:

[0061] ,

[0062] ,in, This represents the shortest path between any two nodes. Indicates a related variable. This represents the set of self-nodes in the connection path set corresponding to the set of virtual nodes. To the node The weights of the connection paths are assigned. This application can assign corresponding weights to each connection path in the set of connection paths corresponding to the set of virtual nodes, which can omit the full detection of the star map system at the physical layer, reduce the amount of computation, and improve the update speed.

[0063] In other embodiments, each connection path in the connection path set corresponding to the physical node set can also be selected. Also assign corresponding weights At this point, after determining the relationships between each physical node and each connection path, as well as the relationships between each virtual node and each connection path, the shortest path between any two physical nodes can be represented as follows:

[0064] ,

[0065] .in, Represents the set of self-nodes in the connection path set corresponding to the set of physical nodes. To the node The weight of the connection path.

[0066] This application can also simultaneously assign corresponding weights to each connection path in the connection path set corresponding to the virtual node set and the connection path set corresponding to the physical node set. When a sudden change in weight or projection distortion occurs in the connection path set corresponding to the virtual node set, the weights of each connection path in the connection path set corresponding to the physical node set can be recalculated immediately, ensuring that the virtual shortest path is consistent with the underlying actual optimal link and improving the robustness of the star map system.

[0067] Step S1043: Based on the shortest path matrix of the corresponding star region, determine the node with the minimum path propagation cost within the corresponding star region as the key node.

[0068] In step S1043, using the shortest path matrix, the node that can cover the most remaining nodes at once and has the lowest cumulative path propagation cost is selected from the virtual node set of the corresponding star region as the key node, until a preset number is reached, ensuring maximum broadcast fan-out and minimum total cost. This application can perform steps S1041-S1043 for each star region of the current layer to obtain the key nodes of each star region of the current layer.

[0069] Further, for the selected key nodes in the current layer, the cost summation is performed on each selected key node and its corresponding path propagation cost, to obtain the theoretical maximum propagation time required for traversing all remaining nodes when any node in the corresponding star region is taken as the initiating node for broadcasting, i.e., the expected time period. When the expected time period is greater than the preset propagation period, the expected time period can be adjusted by increasing the preset number of key nodes in the current layer, and steps S1041-S1043 are re-executed until the new expected time period is less than or equal to the preset propagation period. That is, the application can ensure that the total broadcast time is always compressed within the business allowable range through dynamic expansion, while avoiding the risk of timeout caused by the increase or decrease of nodes or link mutation. After the time limit calibration is completed, the current finally determined number of key nodes and its corresponding star region list can be used as the initial parameters of the next broadcast period.

[0070] Step S105, any one node is selected from each node to initiate broadcast outward according to the star region layer number, so that the key nodes of each star region in the current layer receive broadcast data, broadcast to the remaining nodes in the corresponding star region, and continue to broadcast to the key nodes of the next layer star region, until the current broadcast layer number reaches the preset broadcast layer number.

[0071] Please refer to Figure 7 , which is a flowchart of the sub-step S105 of the step S105 provided by the embodiment of the application. Any one node is selected from each node to initiate broadcast outward according to the star region layer number, so that the key nodes of each star region in the current layer receive broadcast data, broadcast to the remaining nodes in the corresponding star region, and continue to broadcast to the key nodes of the next layer star region, until the current broadcast layer number reaches the preset broadcast layer number, including steps S1051-S1053.

[0072] Step S1051, the high-speed broadcast algorithm is used to initiate broadcast to the key nodes of the current layer.

[0073] In step S1051, the high-speed broadcast algorithm is expressed as:

[0074] ;

[0075] , wherein, the path propagation cost of the initial layer is zero; and respectively represent the minimum path propagation cost from the key nodes of the current layer to the next layer, represents the path propagation cost from node to node , represents a connection parameter, which is used to judge whether node and node Whether they are directly connected. It is understandable that the minimum path propagation cost of the current layer is greater than that of the previous layer, so that the broadcast propagation direction always advances along the wider and farther connection path in the connection path set corresponding to the virtual node set, avoiding repeated coverage of the same node, thereby completing the full network convergence within the star map system within the preset number of broadcast layers.

[0076] Step S1052: When the initial layer propagates the data to be broadcast to the key nodes of the current layer at the same time, the distance matrix and the successor node matrix are used to select the key nodes required for the next layer from each node until the current propagation layer reaches the preset broadcast layer.

[0077] Step S1052: When the broadcast to the key nodes of each star region in the current layer is completed, control the key nodes of each star region in the current layer to broadcast to the remaining nodes in the corresponding star region.

[0078] Step S1053: Using the distance matrix and the successor node matrix, broadcasts are initiated from the key nodes of each star sector in the current layer to the key nodes of each star sector in the next layer until the current propagation layer reaches the preset broadcast layer.

[0079] In step S1053, after the current layer key node completes the broadcast to each node in each star region within the current layer, the current layer key node is immediately used as the source, and the broadcast to the next layer key node is executed locally using the distance matrix and the successor node matrix, until the current propagation layer reaches the preset broadcast layer, so that each layer only jumps outward once and each jump only selects a key node.

[0080] In some feasible embodiments, the broadcasting method further includes the following steps: 1) statistically analyzing the propagation time of each connection path when the key nodes in the current layer receive the corresponding data to be broadcast; 2) adjusting the weights of connection paths whose propagation time exceeds a preset propagation period and updating the network state weighted graph, so as to avoid nodes corresponding to connection paths whose propagation time exceeds the preset propagation period when adjusting the preset number. Specifically, when each key node in the current layer receives the data to be broadcast, it immediately records the actual arrival timestamp of each connection path and subtracts it from the sending time of the initiating node to obtain the propagation time of the corresponding connection path. The statistically obtained propagation time is compared with the preset propagation period. If a propagation time exceeds the preset propagation period, an incremental penalty is applied to the corresponding weight according to a preset penalty coefficient, and the network state weighted graph is updated. Due to the change in the corresponding weights, subsequent broadcasts can automatically avoid penalized high-weight connection paths, achieving self-optimization and ensuring that subsequent broadcasts always occur within a low-latency region.

[0081] Please refer to Figure 8 This is a second flowchart of the broadcasting method based on a star map system provided in the embodiments of this application. The broadcasting method further includes steps S201-S203.

[0082] Step S201: When a new node is added to the star map system, the physical address of the new node is used as input, and the projected coordinates of the new node are obtained through a preset address projection function.

[0083] In step S201, when the star map system detects a new node coming online, it immediately uses its physical address as input and generates globally unique projection coordinates through a preset address projection function. These coordinates serve as the unique mapping of the new node in the virtual space, ensuring that subsequent star region positioning uses the same projection reference as existing nodes, thus avoiding coordinate drift or duplication.

[0084] Step S202: Compare the path propagation cost between the projected coordinates and the center nodes of each star region in turn to determine the target star region to which the new node belongs.

[0085] In step S202, the target star region is the star region corresponding to the center node with the minimum path propagation cost. In this application, the path propagation cost between the projected coordinates and the center nodes of each layer of star regions is compared layer by layer from top to bottom. Specifically, the real-time path propagation cost between the projected coordinates of the new node and the 64 center nodes of the first layer is first calculated, and it is assigned to the large star region corresponding to the center node with the minimum path propagation cost; then, within this large star region, it continues to be compared with the 64 sub-center nodes of the second layer, repeating the "minimum path propagation cost - falling into star region" process until the bottom layer star region. The final determined target star region is the star region where the new node will fall in the multi-layer grid.

[0086] Step S203: Regenerate the network state weighted graph within the target star region and update the shortest path matrix to update the key nodes of the target star region.

[0087] In step S203, a local update is triggered only within the target star region. Specifically, network state data for all nodes (including new nodes) within the star region is reacquired, a new weighted network state graph is generated, and the distance matrix and successor node matrix are recalculated; subsequently, an updated list of key nodes is obtained. The weighted graphs, shortest path matrices, and key nodes for the remaining star regions remain unchanged.

[0088] Please refer to Figure 12 This is a structural block diagram of a broadcasting device based on a star map system provided in an embodiment of this application. This application also provides a broadcasting device 10 based on a star map system. The broadcasting device 10 includes a parameter acquisition module 1, a star region division module 2, a projection module 3, a key node acquisition module 4, and a broadcasting module 5.

[0089] The parameter acquisition module 1 is used to acquire parameter information of each node in the star map system. The parameter information includes node address and network status data.

[0090] The star region division module 2 is configured to divide the star map system into multiple layers of star regions recursively with any node as a reference center until the number of layers of star regions reaches the preset broadcast layer number.

[0091] The projection module 3 is configured to project each node to a corresponding star region.

[0092] The key node acquisition module 4 is configured to determine a node with the minimum path propagation cost in each star region as a key node according to the parameter information.

[0093] The broadcast module 5 is configured to initiate a broadcast from any node to the outside according to the number of layers of star regions, so that the key nodes of the star regions in the current layer receive the broadcast data and broadcast to the remaining nodes in the corresponding star region, and the broadcast is continued to the key nodes of the star regions in the next layer until the current broadcast layer number reaches the preset broadcast layer number.

[0094] Please refer to Figure 13 The present application further provides a communication device 100. The communication device 100 is configured with the broadcast device 10 based on the star map system. The communication device 100 can be a router, a server, etc. The specific features of the broadcast device 10 based on the star map system have been described in detail above, and are not repeated here.

[0095] In the above embodiments, the system, device and unit can be realized by software, hardware or any combination thereof. When realized by software, the system, device and unit can be realized in the form of a computer program product.

[0096] Those skilled in the art can clearly understand that, for the convenience and brevity of description, the specific working process of the system, device and unit described above can refer to the corresponding process in the foregoing method embodiments, which will not be repeated here.

[0097] In the several embodiments provided by the present application, it should be understood that the disclosed system, device and method can be implemented in other ways. For example, the device embodiments described above are only schematic. The division of the units is only a logical function division. There can be another division manner for actual implementation. For example, a plurality of units or components can be combined or integrated into another system, or some features can be ignored or not executed. In addition, the displayed or discussed mutual couplings or direct couplings or communication connections between the units can be indirect couplings or communication connections through some interfaces, devices or units, and can be electrical, mechanical or in other forms.

[0098] The units described as separate components may or may not be physically separate, and the components displayed as units may or may not be physical units, i.e., they may be located in one place, or they may be distributed on multiple network units. Some or all of the units may be selected to achieve the purposes of the embodiments of the present application according to actual needs.

[0099] In addition, the functional units in each embodiment of the present application can be integrated in one processing unit, or each unit can exist independently, or two or more units can be integrated in one unit. The integrated unit can be realized in the form of hardware, or in the form of a software functional unit.

[0100] In the above embodiments, through star area recursive division, dynamic weighted selection of key nodes in the star area, and limitation of the preset broadcast layer number, the network data is diffused within the time limit, the path matches the real-time link quality, the path deviation, uncontrollable depth and long convergence are avoided, and high-speed and stable network broadcast is realized.

[0101] Obviously, those skilled in the art can make various modifications and variations to the present application without departing from the spirit and scope of the present application. Thus, if these modifications and variations of the present application fall within the scope of the claims of the present application and their equivalent technologies, the present application also intends to include these modifications and variations.

[0102] It should be understood that although each step in the flowchart of the accompanying drawings is displayed in sequence according to the direction of the arrow, these steps are not necessarily executed in sequence according to the direction of the arrow. Unless otherwise specified herein, the execution of these steps is not strictly limited in sequence, and they can be executed in other orders. Moreover, at least part of the steps in the flowchart of the accompanying drawings can include multiple sub-steps or multiple stages, which are not necessarily executed at the same time, but can be executed at different times, and the execution order is not necessarily sequential, but can be alternately or alternately executed with at least part of other steps or sub-steps or stages of other steps.

[0103] The above-mentioned is only the preferred embodiment of the present application, and of course cannot limit the scope of the rights of the present application, so the equivalent changes made according to the claims of the present application still belong to the scope covered by the present application.

Claims

1. A broadcasting method based on a star map system, characterized in that, The broadcasting method includes: Obtain parameter information for each node in the star map system, including node address and network status data; Using any node as a reference center, the star map system is recursively divided into multiple star regions until the number of star region layers reaches the preset broadcast layer number; Project each node onto its corresponding star region; Based on the parameter information, the node with the lowest path propagation cost within each star region is determined as the key node. Select any node from each node to initiate a broadcast outward according to the star sector layer number, so that the key nodes of each star sector in the current layer receive the broadcast data and broadcast it to the remaining nodes in the corresponding star sector, while continuing to broadcast to the key nodes of the next star sector, until the current broadcast layer number reaches the preset broadcast layer number. Based on the parameter information, the node with the lowest path propagation cost within each star region is determined as the key node, including: Based on the network state data of each node in each star region, a weighted network state graph for the corresponding star region is generated, specifically including: Using the network status data of each node in each star region as input, virtual nodes corresponding to each node are constructed in the corresponding star region to form a set of virtual nodes, and connection paths corresponding to the virtual nodes are constructed to form a set of virtual connection paths, so that the set of virtual nodes and the set of virtual connection paths are combined to form a virtual topology framework. Each connection path in the virtual topology framework is assigned a corresponding weight, which is used to characterize the time consumed in propagation along the corresponding connection path; Based on the virtual topology framework and the corresponding weights, a network state weighted graph for the corresponding star region is generated.

2. The broadcasting method as described in claim 1, characterized in that, Using any node as a reference center, the star map system is recursively divided into multiple star regions until the number of star region layers reaches a preset broadcast layer number, including: Using the reference center as the origin, the star map system is divided into current-layer star regions according to a preset number of parts, and the current star region layer number is updated. The process involves dividing each current star region into the next star region according to the preset number of parts and updating the current star region layer number until the star region layer number reaches the preset broadcast layer number.

3. The broadcasting method as described in claim 1, characterized in that, The node address includes a physical address and a virtual address obtained by address projection; projecting each node to a corresponding star region includes: Using the physical address as input, the projected coordinates corresponding to the virtual address are obtained through a preset address projection function; Based on the projected coordinates and the reference center, the star region corresponding to each node is determined.

4. The broadcasting method as described in claim 3, characterized in that, Based on the parameter information, the node with the lowest path propagation cost within each star region is determined as the critical node, which also includes: Based on the network state weighted graph of the corresponding star region, the shortest path result between any two nodes in the corresponding star region is obtained to form the shortest path matrix of the corresponding star region; Based on the shortest path matrix of the corresponding star region, the node with the minimum path propagation cost within the corresponding star region is determined as the key node.

5. The broadcasting method as described in claim 4, characterized in that, Based on the network state weighted graph of the corresponding star region, the shortest path results between any two nodes within the corresponding star region are obtained to form the shortest path matrix of the corresponding star region, including: Based on the network state weighted graph of the corresponding star region, path calculation is performed on the set of virtual nodes to obtain a distance matrix and a successor node matrix; the distance matrix is ​​used to reflect the path propagation cost between any two nodes in the corresponding star region; the successor node matrix is ​​used to record the minimum path propagation cost among all path propagation costs in the corresponding star region and the two nodes corresponding to it; Based on the distance matrix and the successor node matrix, the shortest path matrix for the corresponding star sector is generated.

6. The broadcasting method as described in claim 5, characterized in that, From each node, any node is selected to initiate a broadcast outward according to the stated star sector layer number. This allows key nodes in each star sector of the current layer to receive the broadcast data, which is then broadcast to the remaining nodes within the corresponding star sector. Simultaneously, the broadcast continues to the key nodes of the next lower star sector, until the current broadcast layer number reaches the preset broadcast layer number, including: A high-speed broadcast algorithm is used to initiate a broadcast to the key nodes of the current layer. The high-speed broadcast algorithm is expressed as follows: ； ,in, This indicates that the path propagation cost of the initial layer is zero; Indicates from node To the node The cost of path propagation, Indicates connection parameters, used to determine nodes. and nodes Whether they are directly connected; the minimum path propagation cost of the current layer is less than the minimum path propagation cost of the next layer; When the broadcast to the key nodes of each star region in the current layer is completed, control the key nodes of each star region in the current layer to broadcast to the remaining nodes in the corresponding star region; Using the distance matrix and the successor node matrix, broadcasts are initiated from the key nodes of each star region in the current layer to the key nodes of each star region in the next layer, until the current propagation layer reaches the preset broadcast layer.

7. The broadcasting method as described in claim 6, characterized in that, The broadcasting method further includes: When a new node is added to the star map system, the physical address of the new node is used as input, and the projected coordinates of the new node are obtained through the preset address projection function; The path propagation cost between the projected coordinates and the center nodes of each star region is compared sequentially to determine the target star region to which the new node belongs. The target star region is the star region corresponding to the center node with the lowest path propagation cost. Within the target star region, a network state weighted graph is regenerated and the shortest path matrix is ​​updated to update the key nodes of the target star region.

8. A broadcasting device based on a star map system, characterized in that, The broadcasting device includes: The parameter acquisition module is used to acquire parameter information of each node in the star map system. The parameter information includes node address and network status data. The star region division module is used to recursively divide the star map system into multiple star regions with any node as the reference center, until the number of star region layers reaches the preset broadcast layer. The projection module is used to project each node onto the corresponding star region; The critical node acquisition module is used to determine the node with the lowest path propagation cost in each star region as the critical node based on the parameter information. The broadcast module is used to select any node from each node and initiate a broadcast outward according to the star sector layer number, so that the key nodes of each star sector in the current layer receive the broadcast data, broadcast to the remaining nodes in the corresponding star sector, and continue to broadcast to the key nodes of the next lower star sector until the current broadcast layer number reaches the preset broadcast layer number. Based on the parameter information, the node with the lowest path propagation cost within each star region is determined as the key node, including: Based on the network state data of each node in each star region, a weighted network state graph for the corresponding star region is generated, specifically including: Using the network status data of each node in each star region as input, virtual nodes corresponding to each node are constructed in the corresponding star region to form a set of virtual nodes, and connection paths corresponding to the virtual nodes are constructed to form a set of virtual connection paths, so that the set of virtual nodes and the set of virtual connection paths are combined to form a virtual topology framework. Each connection path in the virtual topology framework is assigned a corresponding weight, which is used to characterize the time consumed in propagation along the corresponding connection path; Based on the virtual topology framework and the corresponding weights, a network state weighted graph for the corresponding star region is generated.

9. A communication device, characterized in that, The communication device is equipped with a broadcasting device based on a star map system as described in claim 8.

Images