CN114490129A - Message broadcasting method, device and storage medium in cluster - Google Patents
Message broadcasting method, device and storage medium in cluster Download PDFInfo
- Publication number
- CN114490129A CN114490129A CN202210103003.2A CN202210103003A CN114490129A CN 114490129 A CN114490129 A CN 114490129A CN 202210103003 A CN202210103003 A CN 202210103003A CN 114490129 A CN114490129 A CN 114490129A
- Authority
- CN
- China
- Prior art keywords
- message
- cluster
- node
- source node
- nodes
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 49
- 238000004891 communication Methods 0.000 claims description 21
- 230000000644 propagated effect Effects 0.000 claims description 20
- 230000001902 propagating effect Effects 0.000 claims description 6
- 230000008859 change Effects 0.000 claims description 4
- 238000010586 diagram Methods 0.000 description 19
- 230000007246 mechanism Effects 0.000 description 14
- 238000004590 computer program Methods 0.000 description 11
- 238000012545 processing Methods 0.000 description 9
- 238000005516 engineering process Methods 0.000 description 8
- 230000005540 biological transmission Effects 0.000 description 7
- 238000007726 management method Methods 0.000 description 6
- 230000006870 function Effects 0.000 description 5
- 230000008569 process Effects 0.000 description 5
- 230000015556 catabolic process Effects 0.000 description 3
- 238000006731 degradation reaction Methods 0.000 description 3
- 230000003287 optical effect Effects 0.000 description 3
- 230000004048 modification Effects 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000003068 static effect Effects 0.000 description 2
- 230000003247 decreasing effect Effects 0.000 description 1
- 230000001419 dependent effect Effects 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 230000006872 improvement Effects 0.000 description 1
- 238000004519 manufacturing process Methods 0.000 description 1
- 238000010295 mobile communication Methods 0.000 description 1
- XLYOFNOQVPJJNP-UHFFFAOYSA-N water Substances O XLYOFNOQVPJJNP-UHFFFAOYSA-N 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/46—Multiprogramming arrangements
- G06F9/54—Interprogram communication
- G06F9/542—Event management; Broadcasting; Multicasting; Notifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/46—Multiprogramming arrangements
- G06F9/50—Allocation of resources, e.g. of the central processing unit [CPU]
- G06F9/5005—Allocation of resources, e.g. of the central processing unit [CPU] to service a request
- G06F9/5027—Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resource being a machine, e.g. CPUs, Servers, Terminals
- G06F9/505—Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resource being a machine, e.g. CPUs, Servers, Terminals considering the load
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/46—Multiprogramming arrangements
- G06F9/50—Allocation of resources, e.g. of the central processing unit [CPU]
- G06F9/5083—Techniques for rebalancing the load in a distributed system
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/46—Multiprogramming arrangements
- G06F9/54—Interprogram communication
- G06F9/546—Message passing systems or structures, e.g. queues
Landscapes
- Engineering & Computer Science (AREA)
- Software Systems (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Multimedia (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The embodiment of the application provides a method, equipment and a storage medium for broadcasting messages in a cluster. The method comprises the steps that a cluster topological structure generated by organizing a cluster by taking each node as a root node is configured for each node in the cluster, and based on the cluster topological structure, for any node in the cluster, after a message to be broadcasted is received, the cluster topological structure corresponding to a source node to which the message belongs can be determined; in a cluster topological structure corresponding to a source node, determining a child node associated with a target node; and propagates the message to the child nodes. Therefore, for a message, the broadcast work of the message does not depend on the source node to which the message belongs completely, but a plurality of nodes in the cluster perform relay broadcast according to the cluster topological structure corresponding to the source node to share the message broadcast load, so that the message broadcast load of a single node is not increased excessively due to the expansion of the cluster scale, and the better expansibility of the cluster can be supported.
Description
Technical Field
The present application relates to the field of network technologies, and in particular, to a method, a device, and a storage medium for broadcasting messages in a cluster.
Background
In a cluster, when a message has to be propagated to all nodes, it is usually sent to all nodes by broadcasting to ensure that each node can receive the message.
Currently, a conventional broadcast scheme is to send messages separately by a single node to other nodes in the cluster. Under the broadcast scheme, when the scale of the nodes of the cluster is gradually increased, the single node needs to send messages to more nodes, the message transmission pressure of the single node is continuously increased, message transmission work occupies a large amount of processing resources on the single node, the performance of the single node is affected, and the scale of the nodes of the cluster is limited finally.
Disclosure of Invention
Aspects of the present application provide a method, device and storage medium for message broadcasting in a cluster, so as to reduce the message broadcasting load impact on a single node caused by cluster expansion.
The embodiment of the application provides a message broadcasting method in a cluster, which is suitable for a target node in the cluster, and the method comprises the following steps:
receiving a message to be broadcasted;
determining a cluster topology structure corresponding to a source node to which the message belongs, wherein each node in the cluster is configured with the cluster topology structure generated by organizing the cluster by taking the node as a root node;
determining child nodes associated with the target nodes in the cluster topological structure corresponding to the source nodes;
and transmitting the message to the child node, so that the child node continuously transmits the message according to the cluster topology structure corresponding to the source node until the message is transmitted to all nodes in the cluster topology structure corresponding to the source node.
The embodiment of the application also provides a node, which comprises a memory, a processor and a communication component;
the memory is to store one or more computer instructions;
the processor, coupled with the memory and the communication component, to execute the one or more computer instructions to:
receiving, by the communication component, a message to be broadcast;
determining a cluster topology structure corresponding to a source node to which the message belongs, wherein each node in the cluster is configured with a cluster topology structure generated by organizing the cluster by taking the node as a root node;
determining child nodes associated with the target nodes in the cluster topological structure corresponding to the source nodes;
and transmitting the message to the child node through the communication component, so that the child node continuously transmits the message according to the cluster topological structure corresponding to the source node until the message is transmitted to all nodes in the cluster topological structure corresponding to the source node.
Embodiments of the present application also provide a computer-readable storage medium storing computer instructions, which, when executed by one or more processors, cause the one or more processors to perform the foregoing method of message broadcasting in a cluster.
In the embodiment of the application, each node in the cluster is configured with a cluster topological structure generated by organizing the cluster by taking the node as a root node, and based on the cluster topological structure, for any node in the cluster, after receiving a message to be broadcasted, the cluster topological structure corresponding to a source node to which the message belongs can be determined; in a cluster topological structure corresponding to a source node, determining a child node associated with a target node; and propagates the message to the child nodes. Therefore, for a message, the broadcast work of the message does not depend on the source node to which the message belongs completely, but a plurality of nodes in the cluster perform relay broadcast according to the cluster topological structure corresponding to the source node to share the message broadcast load, so that the message broadcast load of a single node is not increased excessively due to the expansion of the cluster scale, and the better expansibility of the cluster can be supported.
Drawings
The accompanying drawings, which are included to provide a further understanding of the application and are incorporated in and constitute a part of this application, illustrate embodiment(s) of the application and together with the description serve to explain the application and not to limit the application. In the drawings:
fig. 1 is a flowchart illustrating a message broadcasting method in a cluster according to an exemplary embodiment of the present application;
FIG. 2 is a logic diagram of a method for broadcasting messages in a cluster according to an exemplary embodiment of the present application;
fig. 3 is a schematic diagram of an application scenario of a message broadcasting method in a cluster according to an exemplary embodiment of the present application;
fig. 4a is a schematic structural diagram of a node sequence according to an exemplary embodiment of the present application;
FIG. 4b is a schematic illustration of a propagation sequence provided by an exemplary embodiment of the present application;
fig. 5 is a schematic diagram of a cluster topology according to an exemplary embodiment of the present application;
fig. 6 is a schematic structural diagram of a node according to another exemplary embodiment of the present application.
Detailed Description
In order to make the objects, technical solutions and advantages of the present application more apparent, the technical solutions of the present application will be described in detail and completely with reference to the following specific embodiments of the present application and the accompanying drawings. It should be apparent that the described embodiments are only some of the embodiments of the present application, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present application.
At present, the message broadcasting pressure in the cluster is concentrated on the source node, when the cluster scale is increased, the message broadcasting load of a single node is overlarge, the performance is poor, and the node scale of the cluster is limited in turn. To this end, in some embodiments of the present application: configuring a cluster topological structure generated by organizing a cluster by taking each node as a root node for each node in the cluster, and determining the cluster topological structure corresponding to a source node to which a message belongs after receiving the message to be broadcasted for any node in the cluster; in a cluster topological structure corresponding to a source node, determining a child node associated with a target node; and propagates the message to the child nodes. Therefore, for a message, the broadcast work is not completely dependent on the source node to which the message belongs, but a plurality of nodes in the cluster carry out relay broadcast according to the cluster topological structure corresponding to the source node to share the message broadcast load, so that the message broadcast load of a single node is not excessively increased due to the expansion of the cluster scale, and the better expansibility of the cluster can be supported.
The technical solutions provided by the embodiments of the present application are described in detail below with reference to the accompanying drawings.
Fig. 1 is a flowchart illustrating a method for broadcasting a message in a cluster according to an exemplary embodiment of the present disclosure, and fig. 2 is a logic diagram illustrating the method for broadcasting a message in a cluster according to an exemplary embodiment of the present disclosure. The method may be performed by a data processing apparatus, which may be implemented as a combination of software and/or hardware, which may be integrated in any node in a cluster. Referring to fig. 1, the method includes:
102, determining child nodes associated with a target node in a cluster topological structure corresponding to a source node;
and 103, transmitting the message to the child node so that the child node continuously transmits the message according to the cluster topological structure corresponding to the source node until the message is transmitted to all nodes in the cluster topological structure corresponding to the source node.
In this embodiment, the cluster may be a distributed cluster, for example, a Redis cluster, but it should be understood that an application scenario, a scale, and the like of the cluster are not limited in this embodiment. In a cluster there are often messages that must be propagated to all nodes, i.e. messages that need to be broadcast to ensure that each node in the cluster can receive them. For example, a subscription-consumption mechanism may be used in a cluster to manage messages, and all nodes in the cluster may subscribe to the same channel, in which case, messages appearing on the channel need to be propagated to all nodes in the cluster, that is, messages that need to be broadcasted. For the messages that need to be broadcasted in the cluster, this embodiment provides a message broadcasting scheme, which can make the message broadcasting load of a single node in the cluster not receive an excessive influence of the cluster scale.
For convenience of description, in this embodiment, a message broadcasting scheme will be described by taking a target node in a cluster as an example, and it should be understood that the target node may be any node in the cluster.
Referring to fig. 1 and 2, in step 100, a target node may receive a message to be broadcast. The message may be from a user terminal communicating with the cluster, or from other clusters, and the source of the message is not limited in this embodiment. In addition, the present embodiment does not limit the message types, actual contents, and the like in the message, and the present embodiment mainly focuses on whether the message entering the cluster needs to be propagated to all nodes, that is, whether the message needs to be broadcast, and does not limit other dimensions of the message too much.
In step 101, a cluster topology corresponding to a source node to which the message belongs may be determined. The source node is a node that receives a message first in the cluster, and the node is usually directly oriented to a sender of the message, for example, when a user a initiates a message, a node B in the cluster is oriented to the user a to receive the message, and the node B receives the message first, and is the source node to which the message belongs. In this embodiment, the message may include a source node identifier, and the target node may determine whether the source node of the message is the target node itself according to the source node identifier of the message.
Here, the cluster topology is understood to be a propagation path of a message in a cluster, for example, the cluster topology may be a tree structure, a mesh structure, or the like. In this embodiment, a cluster topology structure in which each node in the cluster is a root node may be configured. For example, if the cluster includes N nodes, N cluster topologies may be organized, each node corresponds to one cluster topology, and the cluster topology of the ith node takes the ith node as a root node, so that the N cluster topologies are different from each other. Thus, for the cluster topology structure corresponding to the target node, the target node is used as the root node, and other nodes in the cluster are organized to generate a non-discrete topology structure, that is, starting from the root node, each other node in the cluster has at least one propagation path which can penetrate through to the root node.
Based on this, in step 101, the determined cluster topology structure corresponding to the source node takes the source node as a root node, and each other node in the cluster has at least one propagation path which can penetrate through to the root node. Thus, in step 102, the target node may determine its associated child node in the cluster topology corresponding to the source node. Here, the child node is a node located after the target node and directly related to the target node when the root node is used as the propagation starting point.
Referring to fig. 1 and fig. 2, in step 103, the target node may propagate the message to the child node, so that the child node continues to propagate the message according to the cluster topology corresponding to the source node. It can be known that the target node shares the message broadcasting pressure of the source node, and the source node no longer needs to propagate the message to the child node associated with the target node, but the target node undertakes the part of the work. And the child nodes of the target node continue relaying, and the message continues to be transmitted backwards until the message is transmitted to all nodes in the cluster topological structure corresponding to the source node. For the source node to which the message belongs, the message is only required to be transmitted to the child node associated with the source node in the cluster topological structure corresponding to the source node, and for other nodes in the cluster, the message broadcasting pressure of the source node can be shared under the condition of receiving the message, and the message is transmitted to the child node associated with the source node according to the cluster topological structure corresponding to the source node. In the whole broadcasting process of the message, all nodes in the cluster share the message broadcasting pressure, all the nodes are based on the cluster topological structure corresponding to the source node to which the message belongs, and the subsequent nodes continuously relay and propagate the message to all the nodes in the cluster from the source node, so that a relay propagation mode is formed, and a plurality of nodes in the cluster share the broadcasting work of the message and are not concentrated on the source node, so that the message propagation load of the source node can be effectively relieved. Even if the cluster size is expanded, the message propagation complexity of the source node is not excessively increased, and therefore the method has better adaptability to the cluster size.
Preferably, in this embodiment, except for the source node in the cluster topology structure corresponding to the source node, other nodes in the cluster may have only one propagation entry, which may ensure that each node in the cluster receives the message only once, thereby avoiding the problem of repeated broadcasting. The number of the propagation outlets of each node in the cluster topology structure corresponding to the source node is not limited, and can be adaptively determined according to the topology structure type adopted by the cluster topology structure corresponding to the source node.
Fig. 3 is a schematic diagram of an application scenario of a message broadcasting method in a cluster according to an exemplary embodiment of the present application. Referring to fig. 3, for a target node, if it is determined that a source node to which a message belongs is the target node itself, a child node associated with the target node itself may be determined in a cluster topology structure corresponding to the target node itself; and transmitting the message to the child node so that the child node continuously transmits the message according to the cluster topological structure corresponding to the target node until the message is transmitted to all nodes in the cluster topological structure corresponding to the target node. In this case, the target node is the source node to which the message belongs, the target node may propagate the message to the child nodes associated with the target node itself according to the cluster topology structure corresponding to the target node, and the child nodes will continue to propagate the message backward according to the cluster topology structure corresponding to the target node until the message is broadcast to all nodes in the cluster. The target node may also add various information required for subsequent relay propagation to the message, including but not limited to a source node identifier, a message sequence number, a cluster topology type or a cluster version number of the source node, etc., for reference by other nodes in the cluster.
In addition, referring to fig. 3, in the present embodiment, a propagation mode switching mechanism may be introduced. In this embodiment, at least two propagation modes may be provided, namely a first mode shown in fig. 1 and a second mode in which messages are conventionally propagated to other nodes in the cluster by a single node, respectively. Of course, more propagation modes can be added in the embodiment to adapt to different application scene requirements. Therefore, in this embodiment, a propagation mode identifier may be configured for each propagation mode, and propagation mode identifiers corresponding to different propagation modes are different. Based on this, in a possible design, the propagation mode switching logic may be deployed in the message receiving layer, that is, the message may carry the propagation mode identifier, and a node receiving the message may know which propagation mode needs to be adopted for the message according to the propagation mode identifier.
Referring to fig. 3, in this embodiment, after receiving the message, the propagation mode identifier included in the message may be identified, so as to determine which propagation mode to use:
if the propagation mode required by the message is determined to be the first mode according to the propagation mode identifier contained in the message, judging whether a source node to which the message belongs is a target node and performing subsequent operation;
if the propagation mode required by the message is determined to be the second mode according to the propagation mode identifier contained in the message, the message is propagated to other nodes in the cluster respectively, and the judgment of whether the source node to which the message belongs is the target node and the subsequent operation are not executed.
It should be understood herein that the propagation mode determination operation described above may be performed regardless of whether the target node is the source node to which the message belongs, thereby determining the propagation mode that should be taken by itself for the message.
In the embodiment, the introduction of the propagation mode switching mechanism can enable the technical scheme to have unrivaled compatibility and freedom. For example, if all the existing clusters are old target nodes, if there is no propagation mode switching mechanism, the propagation mode can only be upgraded after the nodes are completely replaced, and online upgrade cannot be achieved; after a propagation mode switching mechanism is introduced, the default mode can be set to be the second mode, the method is compatible with the old version target node, the first mode can be seamlessly switched after all the nodes are successfully upgraded, and more types of propagation modes can be accessed. Thus, introducing a propagation mode switching mechanism may help to select a propagation mode that is better for message broadcast performance in different situations. For example, the user may select the first mode and configure the propagation mode identifier of the first mode in the message when the cluster size is considered to be too large, so as to reduce the load of the single node in the cluster, and may select the second mode and configure the propagation mode identifier of the second mode in the message when the cluster size is considered to be small, so as to broadcast the message through the single node.
Therefore, in this embodiment, for a message, the broadcast work is not completely performed by depending on the source node to which the message belongs, but the relay broadcast is performed by the nodes in the cluster according to the cluster topology structure corresponding to the source node, and the message broadcast load is shared, so that the message broadcast load of a single node is not excessively increased due to the expansion of the cluster scale, and thus the better expansibility of the cluster can be supported; moreover, because a plurality of nodes in the cluster perform relay broadcasting according to the cluster topological structure of the source node, the total amount of message packets actually generated in the message transmission process is not increased, and the problem of repeated broadcasting cannot occur, so that the processing resources are effectively saved, and the broadcasting efficiency is ensured.
In the above or following embodiments, the target node may employ various implementations to determine the cluster topology corresponding to the source node.
In an alternative implementation: a node sequence established for the cluster can be obtained; determining the position of a source node (possibly the target node itself or other nodes in the cluster) in the node sequence; sequentially moving nodes positioned in front of the source node to the tail part of the node sequence to generate a propagation sequence corresponding to the source node; and organizing the clusters according to the propagation sequence corresponding to the source node to generate a cluster topological structure corresponding to the source node.
The node sequence refers to a queue generated after nodes in the cluster are arranged according to a certain sequence. Fig. 4a is a schematic structural diagram of a node sequence according to an exemplary embodiment of the present application. Referring to fig. 4a, the cluster includes 5 nodes in total, and the nodes in the node sequence are node No. 0, node No. 1, node No. 2, node No. 3, and node No. 4 in sequence. In this implementation, the node order in the node sequence may be determined by sorting the nodes according to the globally unique encoded UUID of each node, and of course, the basis for sorting is not limited to the UUID, and the nodes may be sorted according to other bases.
Preferably, in this implementation, the cluster topology corresponding to each node in the cluster may all originate from the same node sequence, that is, each node in the cluster recognizes and follows the same node sequence to perform the determination operation of the cluster topology of itself or other nodes. In practical application, each node can conform to the same node sequence by only providing the node sequence established for the cluster to each node in the cluster by the management and control center in the cluster. And under the condition that the nodes in the cluster are increased/decreased, the management and control center can synchronize the updated node sequence to each node in the cluster so as to ensure that the nodes follow the same and latest node sequence. Of course, this embodiment is not limited to this, and different node sequences may also be configured for different source nodes, but for the same source node, each node in the cluster needs to construct a cluster topology structure corresponding to the source node according to the same node sequence, so as to ensure that each node can perform message relay propagation according to the same cluster topology structure.
On this basis, in this implementation, the position of the source node in the node sequence can be determined. Referring to fig. 4a, if node No. 2 is the source node of the message, the position of node No. 2 in the node sequence may be determined. Then, the nodes located before the source node can be sequentially moved to the end of the node sequence to generate a propagation sequence corresponding to the source node. Fig. 4b is a schematic diagram of a propagation sequence provided in an exemplary embodiment of the present application, and referring to fig. 4b, in a case that node No. 2 in fig. 4a is a source node, after node movement, a propagation sequence may be obtained, it can be known that node No. 0 and node No. 1 which are located before node No. 2 are sequentially moved to the tail of the node sequence, and the node sequence in the propagation sequence is node No. 2, node No. 3, node No. 4, node No. 0, and node No. 1 in turn, and obviously, the node sequence has changed.
In this implementation, the clusters may be organized according to the propagation sequence corresponding to the source node to generate a cluster topology corresponding to the source node. It should be understood here that the generated cluster topology only needs to ensure that the messages can be received by each node in turn according to the node order in the propagation sequence, and the shape of the cluster topology is not limited. As previously submitted, the cluster topology may be a tree structure, a mesh structure, etc. Taking the tree structure as an example, in this implementation: nodes in the cluster can be organized into a tree structure according to the propagation sequence corresponding to the source node in sequence, and the tree structure is used as a cluster topological structure corresponding to the source node. Fig. 5 is a schematic diagram of a cluster topology according to an exemplary embodiment of the present application. Referring to fig. 5, the node sequence in fig. 4b is carried, and the message can be received by each node in turn according to the node sequence in the propagation sequence as a target, so as to construct a tree structure as shown in fig. 5. The cluster topology structure corresponding to the source node may also adopt a tree structure, which may be an N-ary tree, where N may be an integer greater than or equal to 2, and thus, the binary tree structure shown in fig. 5 is only exemplary, and the cluster topology structure of the source node may also adopt a ternary tree, a quaternary tree, and so on. In order to ensure that each node in the cluster uses the same cluster topology structure for the same source node, preferably, the message may carry the cluster topology structure type, such as a tree structure type, adopted by the source node, so that for the target node, the nodes in the cluster may be organized in sequence into the cluster topology structure conforming to the cluster topology structure type according to the propagation sequence corresponding to the source node and the adopted cluster topology structure type. Or taking a tree structure as an example, the target node may organize the nodes in the cluster into a tree structure conforming to the tree structure type in sequence according to the propagation sequence corresponding to the source node and the tree structure type adopted. Referring to fig. 5, the message may carry an identifier corresponding to a binary tree structure, so that the target node may organize the nodes in the cluster into the binary tree structure shown in fig. 5 in sequence according to the propagation sequence corresponding to the source node.
Accordingly, in the implementation manner, each node in the cluster can calculate the cluster topology structure corresponding to the source node in real time on the basis of the node sequence, and for the same source node, each node in the cluster can calculate the same cluster topology structure, which can ensure that each node in the cluster relays and propagates the same message according to the same cluster topology structure, so as to ensure the comprehensiveness of message broadcasting and avoid repeatability.
Of course, in this embodiment, the target node may also determine the cluster topology structure corresponding to the source node by using other implementation manners, for example, the cluster topology structure may be established in advance for each node in the cluster, the cluster topology structures corresponding to all the nodes in the cluster may be stored in each node, and the nodes do not need to calculate the cluster topology structure in real time. For another example, a management and control center may be configured to store a cluster topology for each node in the cluster, and each node may request the cluster topology corresponding to the source node from the management and control center when needed. These implementations are also merely exemplary, and the present embodiment is not limited thereto.
In this embodiment, each node in the cluster may respectively determine the cluster topology structure corresponding to the source node to which the message belongs, and the cluster topology structures determined by each node are consistent, which ensures that each node can relay and propagate the message according to the same cluster topology structure, so as to ensure that the message can be propagated to all nodes in the cluster.
In the above or below described embodiments, a compensation mechanism may also be introduced.
Referring to fig. 3, an exemplary compensation scheme for the target node may be: if the message is transmitted to the child node overtime, determining the next-level node of the child node associated with the target node in the cluster topological structure corresponding to the source node; and transmitting the message to the next-level node so that the next-level node continuously transmits the message according to the cluster topological structure corresponding to the source node. That is, in this embodiment, the parent node may provide compensation for the child node, that is, in a case that the child node fails to cause the parent node to propagate the message overtime, the parent node may directly propagate the message to a node next to the failed child node beyond the child node, so as to ensure that other nodes in the topology branch where the failed child node is located can normally receive the message. For example, referring to the cluster topology corresponding to the source node shown in fig. 5, if node 2 is overtime when propagating a message to node 3, node 2 may propagate a message to node 0 beyond node 3.
Introducing a compensation mechanism, there will be a case: the message may have been propagated over time, but the message recipient may have just experienced a slow query, and not have failed, and has actually received the message, at which point the problem of repeated broadcasts may arise. To avoid repeated broadcasts, in this embodiment, a deduplication mechanism may be introduced.
For the target node, an exemplary deduplication scheme may be: the message carries a source node identifier and a message sequence number, and based on the source node identifier and the message sequence number, a message propagation record maintained for the source node can be searched, wherein the message propagation record comprises the message sequence number of the message propagated for the source node; if the message sequence number contained in the message already exists in the message propagation record, determining that the message is a repeated message and is not propagated any more; and if the message sequence number contained in the message does not exist in the message propagation record, writing the message sequence number contained in the message into the message propagation record after finishing the operation of propagating the message to the child node. In this exemplary scheme, the target node may maintain the message propagation records for other nodes in the cluster, so that it may be accurately determined whether the message sequence number of the message already exists in the message propagation record of the source node to which the message belongs, thereby accurately finding the problem of repeated broadcast.
Of course, in this embodiment, other deduplication schemes may also be employed, for example, the message sequence number of the message sent by the source node may be incremented for the source node, based on which, when the target node receives the message, the message sequence number included in the message may be compared with the latest message sequence number stored for the source node to which the message belongs in the target node, if the message sequence number included in the message is less than or equal to the latest message sequence number stored for the source node to which the message belongs in the target node, the message may be determined to be a duplicate message, otherwise, the message may be determined not to be a duplicate message, and the latest message sequence number stored for the source node to which the message belongs in the target node is updated to the message sequence number included in the message. Under the exemplary scheme, the target node only needs to store the message sequence numbers of the latest messages which are propagated for all nodes in the cluster, and the message sequence numbers of all the propagated messages are not needed to be stored, so that the storage pressure of the nodes can be effectively reduced.
In addition, in this embodiment, an overload protection mechanism may also be introduced.
An exemplary overload protection scheme for a target node may be: detecting the number of unprocessed messages in a message queue on a target node by using a message counter on the target node; if the number of unprocessed messages exceeds a preset threshold, discarding the first message in the message queue and not propagating the first message. For example, assuming that the message pushing capability of the target node is W/sec, that is, W messages (unprocessed callbacks) are accumulated in the message queue when the child node cannot reply to the target node itself within one second, the extreme case is that 2W messages are accumulated when the message delivery to the descendant node is completely failed, and the extreme case is that a large amount of messages are accumulated. By setting the message counter, one can be added when the target node receives the message, and one can be subtracted when the target node successfully propagates the message, so that the number of unprocessed messages in the message queue of the target node can be detected through the message counter, and when the number of the unprocessed messages exceeds a preset threshold value, a high-water-level callback can be set, and at the moment, the transmission work of the first message in the message queue can be directly rejected, so that the overload problem can be solved from the source. In addition, in the exemplary overload protection scheme, a notification may be sent to the user to which the first message in the discarded message queue belongs, and in this case, the user may receive the processing result and may also reinitiate the broadcast request for the discarded message.
Through an overload protection mechanism, the problem that overload occurs to a single node due to single message congestion can be avoided, and therefore the phenomenon that other functions on the single node are influenced due to the fact that processing resources on the single node are seized by message broadcast overload is avoided.
In this embodiment, a propagation mode degradation mechanism may also be introduced in the case that each node needs to calculate the cluster topology corresponding to the source node in real time.
Referring to fig. 3, an exemplary propagation pattern degradation mechanism for a target node may be: the message contains a cluster version number which is used for indicating a cluster scale change event, so that before the cluster topological structure corresponding to the source node is determined, whether the cluster version number contained in the message is consistent with the latest cluster version number recorded by the target node can be judged, if not, the message is respectively transmitted to other nodes in the cluster, and the cluster topological structure corresponding to the source node and subsequent operations are not determined.
For a target node, if the current cluster version number of the target node is not consistent with the cluster version number in the message, the target node may calculate a cluster topology structure corresponding to the source node according to a node sequence different from that of the source node, and then the target node may not propagate the message according to the latest cluster topology structure corresponding to the source node, however, other nodes in the cluster may propagate the message according to the latest cluster topology structure corresponding to the source node, which may cause the situation that cluster topology structures according to which each node in the cluster propagates the message are not consistent, and thus a part of nodes in the cluster may not receive the message, that is, the problem of incomplete broadcast occurs. Therefore, in the exemplary propagation mode degradation mechanism, if the target node finds that the current cluster version number of the target node is inconsistent with the cluster version number in the message, the target node will not propagate the message according to the message broadcasting scheme provided by this embodiment, but degrade the message to the conventional propagation mode, that is, the message is propagated to other nodes in the cluster, so as to ensure that all nodes in the cluster can receive the message. The message propagation scheme provided by this embodiment is recovered after the cluster version number is transmitted to all nodes in the cluster.
It should be noted that in some of the flows described in the above embodiments and the drawings, a plurality of operations are included in a specific order, but it should be clearly understood that the operations may be executed out of the order presented herein or in parallel, and the sequence numbers of the operations, such as 101, 102, etc., are merely used for distinguishing different operations, and the sequence numbers do not represent any execution order per se. Additionally, the flows may include more or fewer operations, and the operations may be performed sequentially or in parallel. It should be noted that, the descriptions of "first", "second", etc. in this document are used for distinguishing different modes, etc., and do not represent the order of precedence, nor limit the types of "first" and "second" that are different.
Fig. 6 is a schematic structural diagram of a node according to another exemplary embodiment of the present application. As shown in fig. 6, the computing device includes: memory 60, processor 61, and communications component 62.
A processor 61, coupled with the memory 60 and the communication component 62, for executing computer programs in the memory 60 for:
receiving a message to be broadcast by the communication component 62;
determining a cluster topological structure corresponding to a source node, wherein each node in the cluster is configured with a cluster topological structure generated by organizing the cluster by taking the node as a root node;
in a cluster topological structure corresponding to a source node, determining a child node associated with a target node;
and the message is propagated to the child node through the communication component 62, so that the child node continues to propagate the message according to the cluster topology structure corresponding to the source node until the message is propagated to all nodes in the cluster topology structure corresponding to the source node.
The node in this embodiment may be any node in a cluster, and it should be understood that the node in the cluster may be a virtual node, may also be an actual physical server, and the like.
In an alternative embodiment, the processor 61 is further configured to:
if the source node to which the message belongs is the target node, determining a child node associated with the target node in a cluster topological structure corresponding to the target node;
and transmitting the message to the child node so that the child node continuously transmits the message according to the cluster topological structure corresponding to the target node until the message is transmitted to all nodes in the cluster topological structure corresponding to the target node.
In an alternative embodiment, the message includes a propagation mode identifier, and the processor 61, after receiving the message to be broadcasted, is further configured to:
if the propagation mode required by the message is determined to be the first mode according to the propagation mode identifier contained in the message, judging whether a source node to which the message belongs is a target node and performing subsequent operation;
if the propagation mode required by the message is determined to be the second mode according to the propagation mode identifier contained in the message, the message is propagated to other nodes in the cluster respectively, and the judgment of whether the source node to which the message belongs is the target node and the subsequent operation are not executed.
In an optional embodiment, the processor 61, when determining the cluster topology corresponding to the source node to which the message belongs, is configured to:
acquiring a node sequence established for a cluster;
determining the position of a source node in a node sequence;
sequentially moving nodes positioned in front of the source node to the tail part of the node sequence to generate a propagation sequence corresponding to the source node;
and organizing the clusters according to the propagation sequence corresponding to the source node to generate a cluster topological structure corresponding to the source node.
In an alternative embodiment, the cluster topology corresponding to each node in the cluster is derived from the same node sequence.
In an alternative embodiment, the processor 61, when organizing the clusters according to the propagation sequence to generate the cluster topology corresponding to the source node, is configured to:
and organizing the nodes in the cluster into a tree-like structure in sequence according to the propagation sequence corresponding to the source node, and using the tree-like structure as a cluster topological structure corresponding to the source node.
In an optional embodiment, the message includes a tree structure type used by the source node, and the processor 61, when organizing the nodes in the cluster into a tree structure in sequence according to the propagation sequence corresponding to the source node, is configured to:
and organizing the nodes in the cluster into a tree structure according to the propagation sequence corresponding to the source node and the adopted tree structure type in sequence.
In an alternative embodiment, the processor 61 is further configured to:
if the message is transmitted to the child node overtime, determining the next-level node of the child node associated with the target node in the cluster topological structure corresponding to the source node;
and transmitting the message to the next-level node so that the next-level node continuously transmits the message according to the cluster topological structure corresponding to the source node.
In an optional embodiment, the message includes a source node identifier and a message sequence number, and the processor 61 is further configured to:
searching a message transmission record maintained for the source node, wherein the message transmission record comprises a message serial number of a message transmitted by the source node;
if the message sequence number contained in the message already exists in the message propagation record, determining that the message is a repeated message and is not propagated any more;
and if the message sequence number contained in the message does not exist in the message propagation record, writing the message sequence number contained in the message into the message propagation record after finishing the operation of propagating the message to the child node.
In an alternative embodiment, a message counter is configured on each node in the cluster, and the processor 61 is further configured to:
detecting the number of unprocessed messages in a message queue on a target node by using a message counter on the target node;
if the number of unprocessed messages exceeds a preset threshold, discarding the first message in the message queue and not propagating the first message.
In an optional embodiment, the message includes a cluster version number, where the cluster version number is used to indicate a cluster scale change event, and before determining a cluster topology corresponding to a source node to which the message belongs, the processor 61 is further configured to:
if the cluster version number contained in the message is inconsistent with the latest cluster version number recorded by the target node, the message is respectively transmitted to other nodes in the cluster, and the cluster topology structure corresponding to the source node to which the message belongs is not determined and the subsequent operation are not executed.
Further, as shown in fig. 6, the node further includes: power supply components 63, and the like. Only some of the components are schematically shown in fig. 6, and it is not meant that a node includes only the components shown in fig. 6.
It should be noted that, for the technical details in the embodiments of the node, reference may be made to the related description in the foregoing method embodiments, and for the sake of brevity, detailed description is not provided herein, but this should not cause a loss of scope of the present application.
Accordingly, the present application further provides a computer-readable storage medium storing a computer program, where the computer program is capable of implementing the steps that can be executed by the node in the foregoing method embodiments when executed.
The memory of FIG. 6, described above, is used to store a computer program and may be configured to store other various data to support operations on a computing platform. Examples of such data include instructions for any application or method operating on the computing platform, contact data, phonebook data, messages, pictures, videos, and so forth. The memory may be implemented by any type or combination of volatile or non-volatile memory devices, such as Static Random Access Memory (SRAM), electrically erasable programmable read-only memory (EEPROM), erasable programmable read-only memory (EPROM), programmable read-only memory (PROM), read-only memory (ROM), magnetic memory, flash memory, magnetic or optical disks.
The communication component in fig. 6 is configured to facilitate wired or wireless communication between the device in which the communication component is located and other devices. The device where the communication component is located can access a wireless network based on a communication standard, such as a WiFi, a 2G, 3G, 4G/LTE, 5G and other mobile communication networks, or a combination thereof. In an exemplary embodiment, the communication component receives a broadcast signal or broadcast related information from an external broadcast management system via a broadcast channel. In one exemplary embodiment, the communication component further includes a Near Field Communication (NFC) module to facilitate short-range communications. For example, the NFC module may be implemented based on Radio Frequency Identification (RFID) technology, infrared data association (IrDA) technology, Ultra Wideband (UWB) technology, Bluetooth (BT) technology, and other technologies.
The power supply assembly of fig. 6 described above provides power to the various components of the device in which the power supply assembly is located. The power components may include a power management system, one or more power supplies, and other components associated with generating, managing, and distributing power for the device in which the power component is located.
As will be appreciated by one skilled in the art, embodiments of the present application may be provided as a method, system, or computer program product. Accordingly, the present application may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present application may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein.
The present application is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the application. It will be understood that each flow and/or block of the flow diagrams and/or block diagrams, and combinations of flows and/or blocks in the flow diagrams and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
In a typical configuration, a computing device includes one or more processors (CPUs), input/output interfaces, network interfaces, and memory.
The memory may include forms of volatile memory in a computer readable medium, Random Access Memory (RAM) and/or non-volatile memory, such as Read Only Memory (ROM) or flash memory (flash RAM). Memory is an example of a computer-readable medium.
Computer-readable media, including both non-transitory and non-transitory, removable and non-removable media, may implement information storage by any method or technology. The information may be computer readable instructions, data structures, modules of a program, or other data. Examples of computer storage media include, but are not limited to, phase change memory (PRAM), Static Random Access Memory (SRAM), Dynamic Random Access Memory (DRAM), other types of Random Access Memory (RAM), Read Only Memory (ROM), Electrically Erasable Programmable Read Only Memory (EEPROM), flash memory or other memory technology, compact disc read only memory (CD-ROM), Digital Versatile Disks (DVD) or other optical storage, magnetic cassettes, magnetic tape magnetic disk storage or other magnetic storage devices, or any other non-transmission medium, which can be used to store information that can be accessed by a computing device. As defined herein, a computer readable medium does not include a transitory computer readable medium such as a modulated data signal and a carrier wave.
It should also be noted that the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising an … …" does not exclude the presence of other identical elements in the process, method, article, or apparatus that comprises the element.
The above description is only an example of the present application and is not intended to limit the present application. Various modifications and changes may occur to those skilled in the art. Any modification, equivalent replacement, improvement, etc. made within the spirit and principle of the present application shall be included in the protection scope of the present application.
Claims (12)
1. A message broadcasting method in a cluster is suitable for a target node in the cluster, and the method comprises the following steps:
receiving a message to be broadcasted;
determining a cluster topology structure corresponding to a source node to which the message belongs, wherein each node in the cluster is configured with the cluster topology structure generated by organizing the cluster by taking the node as a root node;
determining child nodes associated with the target nodes in the cluster topological structure corresponding to the source nodes;
and transmitting the message to the child node, so that the child node continuously transmits the message according to the cluster topological structure corresponding to the source node until the message is transmitted to all nodes in the cluster topological structure corresponding to the source node.
2. The method of claim 1, wherein the message includes a propagation mode identifier, and after receiving the message to be broadcasted, the method further comprises:
if the propagation mode required by the message is determined to be the first mode according to the propagation mode identifier contained in the message, judging whether a source node to which the message belongs is a target node and performing subsequent operation;
if the propagation mode required by the message is determined to be the second mode according to the propagation mode identifier contained in the message, the message is propagated to other nodes in the cluster respectively, and the judgment of whether the source node to which the message belongs is the target node and subsequent operations are not executed.
3. The method of claim 1, wherein the determining a cluster topology corresponding to a source node to which the message belongs comprises:
acquiring a node sequence established for the cluster;
determining a position of the source node in the sequence of nodes;
sequentially moving nodes positioned before the source node to the tail part of the node sequence to generate a propagation sequence corresponding to the source node;
and organizing the clusters according to the propagation sequence corresponding to the source node to generate a cluster topology structure corresponding to the source node.
4. The method of claim 3, wherein the cluster topology corresponding to each node in the cluster is derived from the same sequence of nodes.
5. The method of claim 3, said organizing the clusters in the propagation sequence to generate the cluster topology corresponding to the source node, comprising:
and organizing the nodes in the cluster into a tree structure in sequence according to the propagation sequence corresponding to the source node, wherein the tree structure is used as a cluster topological structure corresponding to the source node.
6. The method according to claim 5, wherein the message includes a tree structure type adopted by the source node, and the organizing of the nodes in the cluster into a tree structure in order according to the propagation sequence corresponding to the source node includes:
and organizing the nodes in the cluster into a tree structure conforming to the tree structure type in sequence according to the propagation sequence corresponding to the source node and the adopted tree structure type.
7. The method of claim 1, further comprising:
if the message is transmitted to the child node overtime, determining a next-level node of the child node associated with the target node in the cluster topological structure corresponding to the source node;
and transmitting the message to the next-level node so that the next-level node continuously transmits the message according to the cluster topological structure corresponding to the source node.
8. The method of claim 7, wherein the message includes a source node identifier and a message sequence number, the method further comprising:
searching a message propagation record maintained for the source node, wherein the message propagation record comprises a message sequence number of a message propagated for the source node;
if the message sequence number contained in the message already exists in the message propagation record, determining that the message is a repeated message and is not propagated any more;
if the message sequence number contained in the message does not exist in the message propagation record, writing the message sequence number contained in the message into the message propagation record after the operation of propagating the message to the child node is completed.
9. The method of claim 1, a message counter configured on each node in the cluster, the method further comprising:
detecting the number of unprocessed messages in a message queue on a target node by using a message counter on the target node;
and if the number of the unprocessed messages exceeds a preset threshold value, discarding the first message in the message queue and not transmitting the first message any more.
10. The method according to claim 1, wherein the message includes a cluster version number, the cluster version number is used for indicating a cluster scale change event, and before determining a cluster topology corresponding to a source node to which the message belongs, the method further includes:
if the cluster version number contained in the message is inconsistent with the latest cluster version number recorded by the target node, the message is respectively transmitted to other nodes in the cluster, and the cluster topology structure corresponding to the source node to which the message belongs is determined and the subsequent operation are not executed.
11. A node comprising a memory, a processor, and a communication component;
the memory is to store one or more computer instructions;
the processor, coupled with the memory and the communication component, to execute the one or more computer instructions to:
receiving, by the communication component, a message to be broadcast;
determining a cluster topology structure corresponding to a source node to which the message belongs, wherein each node in the cluster is configured with a cluster topology structure generated by organizing the cluster by taking the node as a root node;
determining child nodes associated with the target nodes in the cluster topological structure corresponding to the source nodes;
and transmitting the message to the child node through the communication component, so that the child node continuously transmits the message according to the cluster topological structure corresponding to the source node until the message is transmitted to all nodes in the cluster topological structure corresponding to the source node.
12. A computer-readable storage medium storing computer instructions which, when executed by one or more processors, cause the one or more processors to perform the method of message broadcasting in a cluster of any of claims 1-10.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210103003.2A CN114490129A (en) | 2022-01-27 | 2022-01-27 | Message broadcasting method, device and storage medium in cluster |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210103003.2A CN114490129A (en) | 2022-01-27 | 2022-01-27 | Message broadcasting method, device and storage medium in cluster |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN114490129A true CN114490129A (en) | 2022-05-13 |
Family
ID=81476404
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202210103003.2A Pending CN114490129A (en) | 2022-01-27 | 2022-01-27 | Message broadcasting method, device and storage medium in cluster |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114490129A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115412397A (en) * | 2022-08-29 | 2022-11-29 | 苏州浪潮智能科技有限公司 | Cluster communication method, device, equipment and readable medium |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102055655A (en) * | 2009-11-06 | 2011-05-11 | 中兴通讯股份有限公司 | System and method for broadcasting message in structural peer-to-peer network |
| CN102413542A (en) * | 2011-11-25 | 2012-04-11 | 广州杰赛科技股份有限公司 | Wireless mesh network routing method and wireless mesh network |
| KR20130068849A (en) * | 2011-12-16 | 2013-06-26 | 한국전자통신연구원 | Hierarchical message delivery system and method among devices in heterogeneous networks environment |
| CN104092598A (en) * | 2014-07-03 | 2014-10-08 | 厦门欣欣信息有限公司 | Message propagation path extraction method and system |
| CN107948339A (en) * | 2016-10-12 | 2018-04-20 | 阿里巴巴集团控股有限公司 | A kind of network addressing method, equipment and device |
| CN111050375A (en) * | 2019-11-08 | 2020-04-21 | 中国电子科技集团公司第三十研究所 | High real-time data broadcast distribution method for wireless self-organizing network |
| CN112565389A (en) * | 2020-11-30 | 2021-03-26 | 网易（杭州）网络有限公司 | Block chain based message broadcasting method and device, electronic equipment and storage medium |
-
2022
- 2022-01-27 CN CN202210103003.2A patent/CN114490129A/en active Pending
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102055655A (en) * | 2009-11-06 | 2011-05-11 | 中兴通讯股份有限公司 | System and method for broadcasting message in structural peer-to-peer network |
| CN102413542A (en) * | 2011-11-25 | 2012-04-11 | 广州杰赛科技股份有限公司 | Wireless mesh network routing method and wireless mesh network |
| KR20130068849A (en) * | 2011-12-16 | 2013-06-26 | 한국전자통신연구원 | Hierarchical message delivery system and method among devices in heterogeneous networks environment |
| CN104092598A (en) * | 2014-07-03 | 2014-10-08 | 厦门欣欣信息有限公司 | Message propagation path extraction method and system |
| CN107948339A (en) * | 2016-10-12 | 2018-04-20 | 阿里巴巴集团控股有限公司 | A kind of network addressing method, equipment and device |
| CN111050375A (en) * | 2019-11-08 | 2020-04-21 | 中国电子科技集团公司第三十研究所 | High real-time data broadcast distribution method for wireless self-organizing network |
| CN112565389A (en) * | 2020-11-30 | 2021-03-26 | 网易（杭州）网络有限公司 | Block chain based message broadcasting method and device, electronic equipment and storage medium |
Non-Patent Citations (2)
| Title |
|---|
| HOVHANNES A. HARUTYUNYAN 等: "New Heuristic for Message Broadcasting in Networks", 《2014 IEEE 28TH INTERNATIONAL CONFERENCE ON ADVANCED INFORMATION NETWORKING AND APPLICATIONS》, 19 June 2014 (2014-06-19), pages 517 - 524 * |
| 张旭东 等: "一种基于虚拟目的节点的 VANET 可靠单跳广播机制", 《大连理工大学学报》, 12 August 2015 (2015-08-12), pages 417 - 423 * |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115412397A (en) * | 2022-08-29 | 2022-11-29 | 苏州浪潮智能科技有限公司 | Cluster communication method, device, equipment and readable medium |
| CN115412397B (en) * | 2022-08-29 | 2023-08-18 | 苏州浪潮智能科技有限公司 | Cluster communication method, device, equipment and readable medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109041136B (en) | Method for inserting SMF and AMF entity | |
| CN108881354B (en) | Push information storage method and device, server and computer storage medium | |
| US11812504B2 (en) | Method and apparatus for flexibly supporting services in wireless communication system | |
| CN111050361A (en) | Message transmission method, device and system | |
| CN102186221A (en) | Method and device for updating routing table item | |
| CN114490129A (en) | Message broadcasting method, device and storage medium in cluster | |
| CN113301558B (en) | Message transmission method, device, system and storage medium | |
| CN105656978A (en) | Resource sharing method and device | |
| EP3054728B1 (en) | Mobility management method and system | |
| CN102882906A (en) | Method and device of data communication in constrained application protocol | |
| CN105120450A (en) | Card data selecting method in SIM card and user terminal | |
| CN109714398B (en) | Data storage method and device | |
| CN116684416A (en) | Mirror image distribution method, device and system in network element cluster | |
| CN109450692B (en) | Network networking method, system and terminal equipment | |
| US10349344B2 (en) | Network element selection method and network element selector | |
| CN109995649B (en) | Method and device for acquiring cross-domain link | |
| EP3739919A1 (en) | Context transfer between smf | |
| CN110620811B (en) | ONU management method and system under vOLT cluster architecture | |
| CN116491113A (en) | Service request handling | |
| CN110635927B (en) | Node switching method, network node and network system | |
| CN113676510A (en) | Cloud storage method, system, equipment and storage medium | |
| JP6593886B2 (en) | High-speed upload system, retransmission control method thereof, and program | |
| CN105701109A (en) | File multiplex sending method and device | |
| CN113259265B (en) | Message processing method and device, electronic equipment and storage medium | |
| CN114727352B (en) | Information transmission method, device, storage medium and electronic equipment |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination |