Data transmission method and device, storage medium and electronic device

Abstract

The present application discloses a data transmission method and device, a storage medium and an electronic device. The data transmission method includes: obtaining a first multicast message to be multicasted to N destination addresses; copying the first multicast message to N nodes through the node addresses stored in the N nodes connected in series, and transmitting the first multicast message on the N nodes to the N multicast leaves through the multicast leaf addresses stored in the N nodes; transmitting the first multicast message received by each multicast leaf in the N multicast leaves to the N destination addresses. The above technical solution is used to solve the problems of low utilization rate of multicast leaves in the multicast process in the related technology.

Description

Technical Field

[0001] The present application relates to the field of computers, and in particular to a data transmission method and device, a storage medium, and an electronic device. Background Art

[0002] In the prior art, in the process of multicast replication, the multicast leaf is often directly associated with the multicast group, and the replication of the multicast message is completed by connecting the multicast leaf in series. In detail, in the process of multicast, the multicast leaf attribute and the multicast leaf are often coupled together through a series relationship. This method may result in that even if different multicast groups include the same multicast leaf, it is necessary to allocate respective multicast leaves (or multicast leaf resources) to the above different multicast groups in order to realize the replication of the multicast message to the corresponding multicast leaf. This method has caused a great waste of multicast leaf resources.

[0003] In view of the problem in related technologies that the utilization rate of multicast leaves is low during multicast, no effective solution has been proposed yet. Summary of the invention

[0004] The embodiments of the present application provide a data transmission method and device, a storage medium and an electronic device to at least solve the problem of low utilization rate of multicast leaves during multicast in the related art.

[0005] According to an embodiment of the present application, a data transmission method is provided, including: obtaining a first multicast message to be multicast to N destination addresses, wherein N is a positive integer greater than or equal to 2; copying the first multicast message to the N nodes through the node addresses stored in the N nodes connected in series, and transmitting the first multicast message on the N nodes to the N multicast leaves through the multicast leaf addresses stored in the N nodes, wherein the N multicast leaves correspond to the N destination addresses, the node address stored in the i-th node among the N nodes includes the address of the i+1-th node among the N nodes, the multicast leaf address stored in the i-th node among the N nodes includes the address of the i-th multicast leaf among the N multicast leaves, the multicast leaf address stored in the N-th node among the N nodes includes the address of the N-th multicast leaf among the N multicast leaves, and i is a positive integer greater than or equal to 1 and less than N; transmitting the first multicast message received by each multicast leaf among the N multicast leaves to the N destination addresses.

[0006] Optionally, the first multicast message is copied to the N nodes through the node addresses stored in the N nodes connected in series, including: transmitting the first multicast message to the first node among the N nodes, and performing the following operations through the i-th node among the N nodes: transmitting the first multicast message received by the i-th node to the i+1-th node through the address of the i+1-th node stored on the i-th node.

[0007] Optionally, before copying the first multicast message to the N nodes through the node addresses stored in the N nodes connected in series, and transmitting the first multicast message on the N nodes to the N multicast leaves through the multicast leaf addresses stored in the N nodes, the method also includes: creating the N nodes for transmitting the first multicast message, and storing the address of the i+1th node among the N nodes and the address of the i-th multicast leaf among the N multicast leaves in the i-th node among the N nodes, and storing the address of the N-th multicast leaf among the N multicast leaves in the N-th node among the N nodes.

[0008] Optionally, before copying the first multicast message to the N nodes through the node addresses stored in the N nodes connected in series, and transmitting the first multicast message on the N nodes to the N multicast leaves through the multicast leaf addresses stored in the N nodes, the method also includes: selecting N nodes corresponding to the N multicast leaves in a group of nodes according to the N destination addresses, wherein each node in the group of nodes pre-stores the address of the multicast leaf corresponding to each node, a destination address corresponding to the address of the multicast leaf corresponding to each node, the address of the multicast leaf pre-stored in the i-th node among the N nodes is the address of the i-th multicast leaf among the N multicast leaves, and the address of the multicast leaf pre-stored in the N-th node among the N nodes is the address of the N-th multicast leaf among the N multicast leaves; and storing the address of the i+1-th node among the N nodes in the i-th node among the N nodes.

[0009] Optionally, the method also includes: obtaining a second multicast message to be multicast to M destination addresses, wherein M is a positive integer greater than or equal to 2, and the M destination addresses are part of the N destination addresses; copying the second multicast message to the M nodes through the node addresses stored in the M nodes in series, and transmitting the second multicast message on the M nodes to the M multicast leaves through the multicast leaf addresses stored in the M nodes, wherein the M multicast leaves correspond to the M destination addresses, and the M multicast leaves are the N multicast leaves. The node address stored in the j-th node among the M nodes includes the address of the j+1-th node among the M nodes, the multicast leaf address stored in the j-th node among the M nodes includes the address of the j-th multicast leaf among the M multicast leaves, and the multicast leaf address stored in the M-th node among the M nodes includes the address of the M-th multicast leaf among the M multicast leaves, where j is a positive integer greater than or equal to 1 and less than M; the second multicast message received by each multicast leaf among the M multicast leaves is transmitted to the M destination addresses.

[0010] Optionally, the transmitting of the first multicast message received by each of the N multicast leaves to the N destination addresses comprises: encapsulating the first multicast message and the i-th destination address among the N destination addresses into the i-th first message through the message processing module in the i-th multicast leaf among the N multicast leaves, and transmitting the i-th first message to the i-th destination address; the transmitting of the second multicast message received by each of the M multicast leaves to the M destination addresses comprises: The message processing module in the j-th multicast leaf in the M encapsulates the second multicast message and the j-th destination address among the M destination addresses into the j-th second message, and transmits the j-th second message to the j-th destination address; wherein, when the i-th multicast leaf and the j-th multicast leaf are the same multicast leaf, the message processing module in the same multicast leaf is used to encapsulate the first multicast message and the i-th destination address into the i-th first message, and encapsulate the second multicast message and the j-th destination address into the j-th second message.

[0011] According to another embodiment of the embodiment of the present application, a data transmission device is also provided, including: a first acquisition module, used to obtain a first multicast message to be multicasted to N destination addresses, wherein N is a positive integer greater than or equal to 2; a first processing module, used to copy the first multicast message to the N nodes through the node addresses stored in the N nodes in series, and transmit the first multicast message on the N nodes to N multicast leaves through the multicast leaf addresses stored in the N nodes, wherein the N multicast leaves correspond to the N destination addresses, and the The node address stored in the i-th node among the N nodes includes the address of the i+1-th node among the N nodes, the multicast leaf address stored in the i-th node among the N nodes includes the address of the i-th multicast leaf among the N multicast leaves, the multicast leaf address stored in the N-th node among the N nodes includes the address of the N-th multicast leaf among the N multicast leaves, and i is a positive integer greater than or equal to 1 and less than N; a first transmission module is used to transmit the first multicast message received by each multicast leaf among the N multicast leaves to the N destination addresses.

[0012] According to another aspect of the embodiments of the present application, a computer-readable storage medium is provided, in which a computer program is stored, wherein the computer program is configured to execute the above-mentioned data transmission method when running.

[0013] According to another aspect of the embodiments of the present application, an electronic device is provided, including a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor executes the data transmission method through the computer program.

[0014] In an embodiment of the present application, in the process of transmitting multicast messages, the multicast messages on each node are transmitted to the multicast leaf corresponding to the multicast leaf address through the multicast leaf address in the serially connected nodes, and then the multicast message is transmitted to the destination address corresponding to the multicast leaf. In this way, the serial relationship between the multicast leaves is released, and it is avoided that in the process of transmitting multicast messages, even if the destination addresses to which different multicast messages are transmitted include the same destination address, the multicast messages need to be transmitted through different multicast leaves; according to the destination address to be transmitted by the multicast message, the multicast message is transmitted to the corresponding multicast leaf through the multicast leaf address stored in the node, and then the multicast message is transmitted to the destination address corresponding to the multicast leaf, which greatly reduces the multicast leaves required to be allocated during the transmission of the multicast message. The above technical solution solves the problem of low utilization rate of multicast leaves in the multicast process in the related technology, and achieves the technical effect of improving the utilization rate of multicast leaves in the multicast process. BRIEF DESCRIPTION OF THE DRAWINGS

[0015] The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments consistent with the present application and, together with the description, serve to explain the principles of the present application.

[0016] In order to more clearly illustrate the embodiments of the present application or the technical solutions in the prior art, the drawings required for use in the embodiments or the description of the prior art will be briefly introduced below. Obviously, for ordinary technicians in this field, other drawings can be obtained based on these drawings without paying any creative labor.

[0017] Figure 1 It is a hardware environment schematic diagram of a data transmission method according to an embodiment of the present application;

[0018] Figure 2 is a flow chart of a data transmission method according to an embodiment of the present application;

[0019] Figure 3 A transmission diagram of a multicast message according to an embodiment of the present application Figure 1 ;

[0020] Figure 4 A transmission diagram of a multicast message according to an embodiment of the present application Figure 2 ;

[0021] Figure 5 is a schematic diagram of selecting a node according to a destination address according to an embodiment of the present application;

[0022] Figure 6 is a schematic diagram of transmission of multiple multicast messages according to an embodiment of the present application;

[0023] Figure 7 is a schematic diagram of a data transmission method according to an embodiment of the present application;

[0024] Figure 8 It is a structural block diagram of a data transmission device according to an embodiment of the present application. DETAILED DESCRIPTION

[0025] In order to enable those skilled in the art to better understand the solution of the present application, the technical solution in the embodiments of the present application will be clearly and completely described below in conjunction with the drawings in the embodiments of the present application. Obviously, the described embodiments are only part of the embodiments of the present application, not all of the embodiments. Based on the embodiments in the present application, all other embodiments obtained by ordinary technicians in this field without creative work should fall within the scope of protection of the present application.

[0026] It should be noted that the terms "first", "second", etc. in the specification and claims of the present application and the above-mentioned drawings are used to distinguish similar objects, and are not necessarily used to describe a specific order or sequence. It should be understood that the data used in this way can be interchangeable where appropriate, so that the embodiments of the present application described herein can be implemented in an order other than those illustrated or described herein. In addition, the terms "including" and "having" and any of their variations are intended to cover non-exclusive inclusions, for example, a process, method, system, product or device comprising a series of steps or units is not necessarily limited to those steps or units clearly listed, but may include other steps or units that are not clearly listed or inherent to these processes, methods, products or devices.

[0027] The method embodiments provided in the embodiments of the present application can be executed in a computer terminal, a device terminal or a similar computing device. Taking running on a computer terminal as an example, Figure 1 FIG. 1 is a schematic diagram of a hardware environment of a data transmission method according to an embodiment of the present application. Figure 1 As shown, the computer terminal may include one or more ( Figure 1 Only one is shown in the figure) processor 102 (processor 102 may include but is not limited to a processing device such as a microprocessor MCU or a programmable logic device FPGA) and a memory 104 for storing data. In an exemplary embodiment, the computer terminal may also include a transmission device 106 and an input / output device 108 for communication functions. It can be understood by those skilled in the art that Figure 1 The structure shown is only for illustration and does not limit the structure of the above-mentioned computer terminal. Figure 1 More or fewer components as shown, or with Figure 1 Equivalent functions or comparisons shown Figure 1 A different configuration with more features is shown.

[0028] The memory 104 can be used to store computer programs, for example, software programs and modules of application software, such as the computer program corresponding to the data transmission method in the embodiment of the present invention. The processor 102 executes various functional applications and data processing by running the computer program stored in the memory 104, that is, to implement the above method. The memory 104 may include a high-speed random access memory, and may also include a non-volatile memory, such as one or more magnetic storage devices, flash memory, or other non-volatile solid-state memory. In some examples, the memory 104 may further include a memory remotely arranged relative to the processor 102, and these remote memories may be connected to the computer terminal via a network. Examples of the above-mentioned network include, but are not limited to, the Internet, an intranet, a local area network, a mobile communication network, and combinations thereof.

[0029] The transmission device 106 is used to receive or send data via a network. The specific example of the above network may include a wireless network provided by a communication provider of a computer terminal. In one example, the transmission device 106 includes a network adapter (Network Interface Controller, referred to as NIC), which can be connected to other network devices through a base station so as to communicate with the Internet. In one example, the transmission device 106 can be a radio frequency (RF) module, which is used to communicate with the Internet wirelessly.

[0030] In this embodiment, a data transmission method is provided, which is applied to the above-mentioned computer terminal. Figure 2 1 is a flow chart of a data transmission method according to an embodiment of the present application, the flow includes the following steps:

[0031] Step S202, obtaining a first multicast message to be multicast to N destination addresses, where N is a positive integer greater than or equal to 2;

[0032] Step S204: copy the first multicast message to the N nodes through the node addresses stored in the N nodes connected in series, and transmit the first multicast message on the N nodes to the N multicast leaves through the multicast leaf addresses stored in the N nodes, wherein the N multicast leaves correspond to the N destination addresses, the node address stored in the i-th node among the N nodes includes the address of the i+1-th node among the N nodes, the multicast leaf address stored in the i-th node among the N nodes includes the address of the i-th multicast leaf among the N multicast leaves, the multicast leaf address stored in the N-th node among the N nodes includes the address of the N-th multicast leaf among the N multicast leaves, and i is a positive integer greater than or equal to 1 and less than N.

[0033] Step S206: Transmit the first multicast message received by each of the N multicast leaves to the N destination addresses.

[0034] Through the above steps, in the process of transmitting multicast messages, the multicast messages on each node are transmitted to the multicast leaf corresponding to the multicast leaf address through the multicast leaf address in the serially connected nodes, and then the multicast message is transmitted to the destination address corresponding to the multicast leaf. In this way, the serial relationship between the multicast leaves is released, and it is avoided that in the process of transmitting multicast messages, even if the destination addresses to which different multicast messages are transmitted include the same destination address, the multicast messages need to be transmitted through different multicast leaves; according to the destination address to be transmitted by the multicast message, the multicast message is transmitted to the corresponding multicast leaf through the multicast leaf address stored in the node, and then the multicast message is transmitted to the destination address corresponding to the multicast leaf, which greatly reduces the multicast leaves required to be allocated during the transmission of the multicast message. The above technical solution solves the problem of low utilization rate of multicast leaves in the multicast process in the related technology, and achieves the technical effect of improving the utilization rate of multicast leaves in the multicast process.

[0035] Optionally, in this embodiment, the multicast message may be transmitted to multiple destination addresses through, but not limited to, serially connected nodes. Figure 3 A transmission diagram of a multicast message according to an embodiment of the present application Figure 1 ,like Figure 3 As shown, the first multicast message is expected to be transmitted to N destination addresses (destination address 1, destination address 2, ..., destination address N-1, destination address N). In this case, the first multicast message is copied to N nodes (node ​​1, node 2, ..., node N-1, node N) through the node addresses (node ​​address 2, node address 3, ..., node address N-1) stored in the series-connected N nodes (node ​​1, node 2, ..., node N-1, node N), and the first multicast message on the N nodes (node ​​1, node 2, ..., node N-1, node N) is transmitted to the N multicast leaves (multicast leaf 1, multicast leaf 2, ..., multicast leaf N-1, multicast leaf N) through the multicast leaf addresses (multicast leaf 1 address, multicast leaf 2 address, ..., multicast leaf N-1 address, multicast leaf N address) stored in the N nodes (node ​​1, node 2, ..., node N-1, node N). The first multicast message received by each multicast leaf among N multicast leaves (multicast leaf 1, multicast leaf 2, ..., multicast leaf N-1, multicast leaf N) is transmitted to N destination addresses (destination address 1, destination address 2, ..., destination address N-1, destination address N).

[0036] In the technical solution provided in step S202, when the first multicast message is obtained, it can be indicated that the first multicast message is desired to be transmitted to multiple destination addresses. The destination addresses to which different multicast messages are desired to be transmitted can be, but are not limited to, the same, different, or partially the same.

[0037] In the technical solution provided in the above step S204, the N multicast leaves are not connected, or there is no series relationship between the N multicast leaves, but the N nodes are connected in series. In this way, the series relationship between the multicast leaves is released, and the multicast message is transmitted to the corresponding multicast leaf through the multicast leaf address stored in the node according to the destination address to be transmitted by the multicast message, and then the multicast message is transmitted to the destination address corresponding to the multicast leaf. The multicast leaves that need to be allocated in the process of transmitting different multicast messages are greatly reduced, and the utilization rate of the multicast leaves is improved.

[0038] Optionally, in this embodiment, the address of the multicast leaf corresponding to the current node and the node address of the next node of the current node are stored in the N nodes except the Nth node; the Nth node may, but is not limited to, store the address of the Nth multicast leaf, and the node address stored in the Nth node may, but is not limited to, be empty.

[0039] In an exemplary embodiment, the first multicast message can be copied to N nodes in the following manner but is not limited to: the first multicast message is transmitted to the first node among the N nodes, and the following operations are performed through the i-th node among the N nodes: the first multicast message received by the i-th node is transmitted to the i+1-th node through the address of the i+1-th node stored on the i-th node.

[0040] Optionally, in this embodiment, when the first groupcast message is obtained, the first groupcast message can be transmitted to the first node first, and then the first groupcast message on the first node is transmitted to the second node, ... until the first groupcast message on the N-1th node is transmitted to the Nth node. Figure 4 A transmission diagram of a multicast message according to an embodiment of the present application Figure 2 ,like Figure 4As shown, the first multicast message is expected to be transmitted to N destination addresses (destination address 1, destination address 2, ..., destination address i, destination address i+1, ..., destination address N). In this case, the first multicast message is transmitted to the first node (i.e., node 1) among the N nodes (node ​​1, node 2, ..., node i, node i+1, ..., node N), and the first multicast message received by the first node is transmitted to the second node through the address of the second node (i.e., node 2) stored on the first node (i.e., node address 2); the first multicast message received by the second node is transmitted to the third node (i.e., node 3) through the address of the third node (i.e., node 3) stored on the second node (i.e., node address 3). node; ...; the first groupcast message on the i-th node is transmitted to the i+1-th node through the address of the i+1-th node (i.e., node i+1) stored on the i-th node (i.e., node i); the first groupcast message on the i+1-th node is transmitted to the i+2-th node through the address of the i+2-th node (i.e., node i+2) stored on the i+1-th node (i.e., node i+1)...; until the first groupcast message is transmitted to the N-th node (i.e., node N). The first multicast message on the N nodes (node ​​1, node 2, ..., node i, node i+1, ..., node N) is transmitted to the N multicast leaves (multicast leaf 1, multicast leaf 2, ..., multicast leaf i, multicast leaf i+1, ..., multicast leaf N) through the multicast leaf addresses (multicast leaf 1 address, multicast leaf 2 address, ..., multicast leaf i address, multicast leaf i+1 address, ..., multicast leaf N address) stored in the N nodes (node ​​1, node 2, ..., node i, node i+1, ..., node N). The first multicast message received by each multicast leaf in the N multicast leaves (multicast leaf 1, multicast leaf 2, ..., multicast leaf i, multicast leaf i+1, ..., multicast leaf N) is transmitted to the N destination addresses (destination address 1, destination address 2, ..., destination address i, destination address i+1, ..., destination address N).

[0041] In an exemplary embodiment, the address of storing multicast leaves in a node can be created in the following manner but is not limited to: creating the N nodes for transmitting the first multicast message, and storing the address of the i+1th node among the N nodes and the address of the i-th multicast leaf among the N multicast leaves in the i-th node among the N nodes, and storing the address of the N-th multicast leaf among the N multicast leaves in the N-th node among the N nodes.

[0042] Optionally, in this embodiment, it is possible but not limited to creating N nodes for transmitting the first multicast message when the first multicast message is obtained, and storing the address of multicast leaf 1 and the node address of the second node among the N nodes in the first node among the N nodes, storing the address of multicast leaf 2 and the node address of the third node among the N nodes in the second node, ..., storing the address of multicast leaf N-1 and the node address of the Nth node among the N nodes in the N-1th node among the N nodes, and storing the address of multicast leaf N in the Nth node.

[0043] In an exemplary embodiment, the node address and the multicast leaf address may be stored in a node in the following manner but is not limited to: based on the N destination addresses, N nodes corresponding to the N multicast leaves are selected from a group of nodes, wherein each node in the group of nodes pre-stores the address of the multicast leaf corresponding to each node, the address of the multicast leaf corresponding to each node corresponds to a destination address, the address of the multicast leaf pre-stored in the i-th node among the N nodes is the address of the i-th multicast leaf among the N multicast leaves, and the address of the multicast leaf pre-stored in the N-th node among the N nodes is the address of the N-th multicast leaf among the N multicast leaves; and the address of the i+1-th node among the N nodes is stored in the i-th node among the N nodes.

[0044] Optionally, in this embodiment, nodes corresponding to multiple multicast leaves to which the multicast message is to be transmitted may be selected from a pre-created group of nodes based on multiple destination addresses to which the multicast message is to be transmitted, but not limited to. Figure 5 is a schematic diagram of selecting a node according to a destination address according to an embodiment of the present application, such as Figure 5As shown, according to N destination addresses (destination address 1, destination address 2, ..., destination address N-1, destination address N), N nodes (node ​​1, node 2, ..., node N-1, node N) corresponding to N multicast leaves (multicast leaf 1, multicast leaf 2, ..., multicast leaf N-1, multicast leaf N) are selected from a group of nodes (node ​​1, node 2, ..., node N-1, node N, ..., node P), where P is greater than or equal to N, and each node in a group of nodes (node ​​1, node 2, ..., node N-1, node N, ..., node P) pre-stores the addresses (multicast leaf 1 address, multicast leaf 2 address, ..., multicast leaf N-1 address, multicast leaf N address, ..., multicast leaf P address) of the multicast leaves corresponding to each node. The node address 2 of the second node among N nodes is stored in the first node among N nodes (node ​​1, node 2, ..., node N-1, node N), the node address 3 of the third node among N nodes is stored in the second node, ..., the node address N of the Nth node among N nodes is stored in the N-1 node.

[0045] In the technical solution provided in the above step S206, when the first multicast message is obtained, it can be indicated that the first multicast message is desired to be transmitted to multiple destination addresses. In this case, the first multicast message can be copied to the N nodes through the node addresses stored in the N nodes in series, and the first multicast message on the N nodes can be transmitted to the N multicast leaves through the multicast leaf addresses stored in the N nodes, and the first multicast message received by each multicast leaf in the N multicast leaves can be transmitted to the N destination addresses.

[0046] In an exemplary embodiment, the second multicast message can be transmitted in the following manner, but is not limited to: obtaining a second multicast message to be multicasted to M destination addresses, wherein M is a positive integer greater than or equal to 2, and the M destination addresses are some of the N destination addresses; copying the second multicast message to the M nodes through the node addresses stored in the M nodes in series, and transmitting the second multicast message on the M nodes to the M multicast leaves through the multicast leaf addresses stored in the M nodes, wherein the M multicast leaves correspond to the M destination addresses, and the M multicast leaves correspond to the M destination addresses. The leaves are some of the N multicast leaves, the node address stored in the j-th node among the M nodes includes the address of the j+1-th node among the M nodes, the multicast leaf address stored in the j-th node among the M nodes includes the address of the j-th multicast leaf among the M multicast leaves, the multicast leaf address stored in the M-th node among the M nodes includes the address of the M-th multicast leaf among the M multicast leaves, and j is a positive integer greater than or equal to 1 and less than M; the second multicast message received by each multicast leaf among the M multicast leaves is transmitted to the M destination addresses.

[0047] Optionally, in this embodiment, the M multicast leaves are not connected or do not have a series relationship. The node address stored in the Mth node may be, but is not limited to, empty. The second multicast message may be, but is not limited to, obtained when the first multicast message is obtained, or when the first multicast message is transmitted to the corresponding multiple destination addresses, or when the first multicast message has been transmitted to the corresponding multiple destination addresses. In this case, the multicast message on each node may be, but is not limited to, transmitted to the multicast leaf address corresponding to the multicast leaf address through the multicast leaf address in the serial node, and then the second multicast message is transmitted to the destination address corresponding to the multicast leaf. In this way, it is possible to achieve the parallel transmission of multiple multicast messages to the corresponding destination addresses, which greatly improves the transmission efficiency of the multicast messages.

[0048] Optionally, in this embodiment, the destination address to which the first multicast message is to be transmitted may include, but is not limited to, the destination address to which the second multicast message is to be transmitted. Figure 6 is a schematic diagram of transmission of multiple multicast messages according to an embodiment of the present application, such as Figure 6As shown, the transmission process of the above-mentioned multiple multicast messages can be explained but not limited to N=5, M=4. The first multicast message can be obtained but not limited to first, and the first multicast message can be transmitted to destination address 1, destination address 2, destination address 3, destination address 4 and destination address 5. In this case, the first multicast message is transmitted to the first node (i.e., node 1) among the five nodes (node ​​1, node 2, node 3, node 4, node 5), and the first multicast message received by the first node is transmitted to the second node through the address of the second node (i.e., node 2) stored on the first node (i.e., node address 2); the first multicast message received by the second node is transmitted to the third node through the address of the third node (i.e., node 3) stored on the second node (i.e., node address 3); the first multicast message on the third node is transmitted to the fourth node through the address of the fourth node (i.e., node 4) stored on the third node (i.e., node address 4); the first multicast message on the fourth node is transmitted to the fifth node through the address of the fifth node (i.e., node 5) stored on the fourth node (i.e., node address 5). The first multicast message on the five nodes (node ​​1, node 2, node 3, node 4, node 5) is transmitted to the five multicast leaves (multicast leaf 1, multicast leaf 2, multicast leaf 3, multicast leaf 4, multicast leaf 5) through the multicast leaf addresses (multicast leaf 1 address, multicast leaf 2 address, multicast leaf 3 address, multicast leaf 4 address, multicast leaf 5 address) stored in the five nodes (node ​​1, node 2, node 3, node 4, node 5). The first multicast message received by each of the five multicast leaves (multicast leaf 1, multicast leaf 2, multicast leaf 3, multicast leaf 4, multicast leaf 5) is transmitted to the five destination addresses (destination address 1, destination address 2, destination address 3, destination address 4, destination address 5).

[0049] The second multicast message can be obtained, but is not limited to, when the first multicast message is completed. The second multicast message can be, but is not limited to, to be transmitted to destination address 1, destination address 2, destination address 3, and destination address 4. That is, the first multicast message includes the multicast leaves required for the transmission of the second multicast message. In this case, the second multicast message is transmitted to the first node (i.e., node 1) among the four nodes (node ​​1, node 2, node 3, and node 4). The second multicast message received by the first node is transmitted to the second node through the address (i.e., node address 2) of the second node (i.e., node 2) stored on the first node; the second multicast message received by the second node is transmitted to the third node through the address (i.e., node address 3) of the third node (i.e., node 3) stored on the second node; and the second multicast message on the third node is transmitted to the fourth node through the address (i.e., node address 4) of the fourth node (i.e., node 4) stored on the third node (i.e., node 3). The second multicast message on the four nodes (node ​​1, node 2, node 3, node 4) is transmitted to the four multicast leaves (multicast leaf 1, multicast leaf 2, multicast leaf 3, multicast leaf 4) through the multicast leaf addresses (multicast leaf 1 address, multicast leaf 2 address, multicast leaf 3 address, multicast leaf 4 address) stored in the four nodes (node ​​1, node 2, node 3, node 4). The second multicast message received by each of the four multicast leaves (multicast leaf 1, multicast leaf 2, multicast leaf 3, multicast leaf 4) is transmitted to the four destination addresses (destination address 1, destination address 2, destination address 3, destination address 4).

[0050] In this way, the series relationship between multicast leaves is eliminated. Instead, through the series nodes, when the same multicast leaves exist in the multicast leaves corresponding to different multicast messages, the multiplexing of multicast leaves is achieved. Different multicast messages to the same destination address can be transmitted through the same multicast leaf, and the same multicast leaf can be shared among different multicast groups, which greatly reduces the waste of multicast leaves required for transmitting multicast messages and greatly improves the utilization rate of multicast leaves.

[0051] In an exemplary embodiment, the multicast message received by the multicast leaf can be transmitted to multiple destination addresses in the following manner but is not limited to: through the message processing module in the i-th multicast leaf among the N multicast leaves, the first multicast message and the i-th destination address among the N destination addresses are encapsulated into the i-th first message, and the i-th first message is transmitted to the i-th destination address; through the message processing module in the j-th multicast leaf among the M multicast leaves, the second multicast message and the j-th destination address among the M destination addresses are encapsulated into the j-th second message, and the j-th second message is transmitted to the j-th destination address; wherein, when the i-th multicast leaf and the j-th multicast leaf are the same multicast leaf, the message processing module in the same multicast leaf is used to encapsulate the first multicast message and the i-th destination address into the i-th first message, and encapsulate the second multicast message and the j-th destination address into the j-th second message.

[0052] Optionally, in this embodiment, when a multicast leaf receives a multicast message, it may, but is not limited to, encapsulate the index of the operation performed on the received multicast message (which may include but is not limited to the operation name, operation identifier, etc.), the destination address to which the received multicast message is to be transmitted, and the received message through a message processing module in the multicast leaf to obtain a message to be transmitted to the destination address.

[0053] Optionally, in this embodiment, when multiple multicast messages are transmitted to the same or partially the same destination address, the multiple multicast messages can be processed by reusing the message processing module in the same multicast leaf. In this way, the multicast leaves required for propagating multicast messages are greatly reduced, the required multicast leaves are saved, and the utilization rate of the multicast leaves is improved.

[0054] In order to better understand the process of transmitting the above data, the transmission process of the above data is described below in combination with an optional embodiment, but it is not used to limit the technical solution of the embodiment of the present application.

[0055] In this embodiment, a data transmission method is provided. Figure 7 is a schematic diagram of a data transmission method according to an embodiment of the present application, such as Figure 7As shown, the first multicast message may be obtained but is not limited to first, and the first multicast message may be transmitted to destination address 1, destination address 2, destination address 3, destination address 4 and destination address 5 but is not limited to. In this case, the first multicast message is transmitted to the first node (i.e., node 1) among the five nodes (node ​​1, node 2, node 3, node 4, node 5), and the first multicast message received by the first node is transmitted to the second node through the address of the second node (i.e., node 2) stored on the first node (i.e., node address 2); the first multicast message received by the second node is transmitted to the third node through the address of the third node (i.e., node 3) stored on the second node (i.e., node address 3); the first multicast message on the third node is transmitted to the fourth node through the address of the fourth node (i.e., node 4) stored on the third node (i.e., node 3) (i.e., node address 4); the first multicast message on the fourth node is transmitted to the fifth node through the address of the fifth node (i.e., node 5) stored on the fourth node (i.e., node 5) (i.e., node address 5). The first multicast message on the five nodes (node ​​1, node 2, node 3, node 4, node 5) is transmitted to the five multicast leaves (multicast leaf 1, multicast leaf 2, multicast leaf 3, multicast leaf 4, multicast leaf 5) through the multicast leaf addresses (multicast leaf 1 address, multicast leaf 2 address, multicast leaf 3 address, multicast leaf 4 address, multicast leaf 5 address) stored in the five nodes (node ​​1, node 2, node 3, node 4, node 5). The first multicast message received by each of the five multicast leaves (multicast leaf 1, multicast leaf 2, multicast leaf 3, multicast leaf 4, multicast leaf 5) is transmitted to the five destination addresses (destination address 1, destination address 2, destination address 3, destination address 4, destination address 5).

[0056] It is possible but not limited to obtain the second multicast message when the first multicast message is completed. The second multicast message can be but not limited to be transmitted to destination address 1, destination address 2, and destination address 3. That is to say, the first multicast message includes the multicast leaves required for the transmission of the second multicast message. In this case, the second multicast message is transmitted to the first node (i.e., node 1) among the three nodes (node ​​1, node 2, node 3), and the second multicast message received by the first node is transmitted to the second node through the address of the second node (i.e., node 2) stored on the first node (i.e., node address 2); the second multicast message received by the second node is transmitted to the third node through the address of the third node (i.e., node 3) stored on the second node (i.e., node address 3). The second multicast message on the three nodes (node ​​1, node 2, node 3) is transmitted to the three multicast leaves (multicast leaf 1, multicast leaf 2, multicast leaf 3) through the multicast leaf addresses (multicast leaf 1 address, multicast leaf 2 address, multicast leaf 3 address) stored in the three nodes (node ​​1, node 2, node 3). The second multicast message received by each of the three multicast leaves (multicast leaf 1, multicast leaf 2, multicast leaf 3) is transmitted to the three destination addresses (destination address 1, destination address 2, destination address 3).

[0057] It is possible but not limited to that during the transmission of the second multicast message, a third multicast message is obtained, and the third multicast message can be but not limited to be transmitted to destination address 1 and destination address 2, that is, the first multicast message includes the multicast leaves required for the transmission of the third multicast message. In this case, the third multicast message is transmitted to the first node (i.e., node 1) of the two nodes (node ​​1, node 2), and the third multicast message received by the first node is transmitted to the second node through the address of the second node (i.e., node 2) stored on the first node (i.e., node address 2). The third multicast message on the two nodes (node ​​1, node 2) is transmitted to the two multicast leaves (multicast leaf 1, multicast leaf 2) through the multicast leaf addresses (multicast leaf 1 address, multicast leaf 2 address) stored in the two nodes (node ​​1, node 2). The third multicast message received by each of the two multicast leaves (multicast leaf 1, multicast leaf 2) is transmitted to two destination addresses (destination address 1, destination address 2).

[0058] Through the data transmission method in the embodiment of the present application, when the first groupcast message, the second groupcast message and the third groupcast message are transmitted to some of the same destination addresses, a total of 5 multicast leaves need to be allocated; while in the prior art, 5 multicast leaves need to be allocated when transmitting the first groupcast message, 3 multicast leaves need to be allocated when transmitting the second groupcast message, and 2 multicast leaves need to be allocated when transmitting the third groupcast message. Even if the first groupcast message, the second groupcast message and the third groupcast message are transmitted to duplicate destination addresses, 10 multicast leaves are required in the prior art. Through the method in the embodiment of the present application, compared with the prior art, when the destination addresses to which the multicast messages are transmitted are the same, the consumption of multicast leaves is greatly reduced through the reuse of multicast leaves, the cost of network chips is reduced, and the competitiveness of products is improved.

[0059] In addition, in a typical network device, there are generally 4096 interfaces. For three-layer multicast, these 4096 interfaces can all be leaves of the multicast group. In the prior art, if 10,000 multicast groups need to be supported and each multicast group has 4,000 multicast leaves, in the extreme case, 10,000*4000=40,000,000 multicast leaves are required, and the network chip in the prior art cannot support such a large leaf specification. Through the data transmission method in the embodiment of the present application, only 4,096 multicast leaves are needed to support 10,000 multicast groups. And because the multicast leaves are shared, no matter how many multicast groups there are, they can be supported, which greatly increases the number of multicast groups that the network chip can support.

[0060] Through the description of the above implementation methods, those skilled in the art can clearly understand that the method according to the above embodiment can be implemented by means of software plus a necessary general hardware platform, and of course by hardware, but in many cases the former is a better implementation method. Based on such an understanding, the technical solution of the present application, or the part that contributes to the prior art, can be embodied in the form of a software product, which is stored in a storage medium (such as ROM / RAM, magnetic disk, optical disk), and includes a number of instructions for a terminal device (which can be a mobile phone, computer, server, or network device, etc.) to execute the methods of each embodiment of the present application.

[0061] Figure 8 is a structural block diagram of a data transmission device according to an embodiment of the present application; Figure 8 As shown, it includes: a first acquisition module 802, which is used to acquire a first multicast message to be multicast to N destination addresses, where N is a positive integer greater than or equal to 2;

[0062] The first processing module 804 is used to copy the first multicast message to the N nodes through the node addresses stored in the N nodes connected in series, and transmit the first multicast message on the N nodes to the N multicast leaves through the multicast leaf addresses stored in the N nodes, wherein the N multicast leaves correspond to the N destination addresses, the node address stored in the i-th node among the N nodes includes the address of the i+1-th node among the N nodes, the multicast leaf address stored in the i-th node among the N nodes includes the address of the i-th multicast leaf among the N multicast leaves, the multicast leaf address stored in the N-th node among the N nodes includes the address of the N-th multicast leaf among the N multicast leaves, and i is a positive integer greater than or equal to 1 and less than N;

[0063] The first transmission module 806 is used to transmit the first multicast message received by each multicast leaf in the N multicast leaves to the N destination addresses.

[0064] Through the above-mentioned embodiment, in the process of transmitting multicast messages, the multicast messages on each node are transmitted to the multicast leaf corresponding to the multicast leaf address through the multicast leaf address in the serially connected nodes, and then the multicast message is transmitted to the destination address corresponding to the multicast leaf. In this way, the serial relationship between the multicast leaves is released, and it is avoided that in the process of transmitting multicast messages, even if the destination addresses to which different multicast messages are transmitted include the same destination address, the multicast messages need to be transmitted through different multicast leaves; according to the destination address to be transmitted by the multicast message, the multicast message is transmitted to the corresponding multicast leaf through the multicast leaf address stored in the node, and then the multicast message is transmitted to the destination address corresponding to the multicast leaf, which greatly reduces the multicast leaves required to be allocated during the transmission of the multicast message. The above-mentioned technical scheme solves the problems of low utilization rate of multicast leaves in the multicast process in the related technology, and achieves the technical effect of improving the utilization rate of multicast leaves in the multicast process.

[0065] In an exemplary embodiment, the first processing module is used to: transmit the first multicast message to the first node among the N nodes, and perform the following operations through the i-th node among the N nodes: transmit the first multicast message received by the i-th node to the i+1-th node through the address of the i+1-th node stored on the i-th node.

[0066] In an exemplary embodiment, the device also includes: a second processing module, which is used to copy the first multicast message to the N nodes through the node addresses stored in the N nodes connected in series, and before transmitting the first multicast message on the N nodes to the N multicast leaves through the multicast leaf addresses stored in the N nodes, create the N nodes for transmitting the first multicast message, and store the address of the i+1th node among the N nodes and the address of the i-th multicast leaf among the N multicast leaves in the i-th node among the N nodes, and store the address of the N-th multicast leaf among the N multicast leaves in the N-th node among the N nodes.

[0067] In an exemplary embodiment, the apparatus further comprises:

[0068] A selection module, used for copying the first multicast message to the N nodes through the node addresses stored in the N nodes connected in series, and selecting N nodes corresponding to the N multicast leaves in a group of nodes according to the N destination addresses before transmitting the first multicast message on the N nodes to the N multicast leaves through the multicast leaf addresses stored in the N nodes, wherein each node in the group of nodes pre-stores the address of the multicast leaf corresponding to each node, a destination address corresponding to the address of the multicast leaf corresponding to each node, the address of the multicast leaf pre-stored in the i-th node in the N nodes is the address of the i-th multicast leaf in the N multicast leaves, and the address of the multicast leaf pre-stored in the N-th node in the N nodes is the address of the N-th multicast leaf in the N multicast leaves;

[0069] A storage module is used to store the address of the i+1th node among the N nodes in the i-th node among the N nodes.

[0070] In an exemplary embodiment, the apparatus further comprises:

[0071] A second acquisition module, used to acquire a second multicast message to be multicast to M destination addresses, where M is a positive integer greater than or equal to 2, and the M destination addresses are part of the N destination addresses;

[0072] a third processing module, configured to copy the second multicast message to the M nodes through the node addresses stored in the M nodes connected in series, and transmit the second multicast message on the M nodes to the M multicast leaves through the multicast leaf addresses stored in the M nodes, wherein the M multicast leaves correspond to the M destination addresses, the M multicast leaves are part of the N multicast leaves, the node address stored in the j-th node among the M nodes includes the address of the j+1-th node among the M nodes, the multicast leaf address stored in the j-th node among the M nodes includes the address of the j-th multicast leaf among the M multicast leaves, the multicast leaf address stored in the M-th node among the M nodes includes the address of the M-th multicast leaf among the M multicast leaves, and j is a positive integer greater than or equal to 1 and less than M;

[0073] The second transmission module is used to transmit the second multicast message received by each multicast leaf in the M multicast leaves to the M destination addresses.

[0074] In an exemplary embodiment, the first transmission module is used to: encapsulate the first multicast message and the i-th destination address among the N destination addresses into the i-th first message through the message processing module in the i-th multicast leaf among the N multicast leaves, and transmit the i-th first message to the i-th destination address; the second transmission module is used to: encapsulate the second multicast message and the j-th destination address among the M destination addresses into the j-th second message through the message processing module in the j-th multicast leaf among the M multicast leaves, and transmit the j-th second message to the j-th destination address; wherein, when the i-th multicast leaf and the j-th multicast leaf are the same multicast leaf, the message processing module in the same multicast leaf is used to encapsulate the first multicast message and the i-th destination address into the i-th first message, and encapsulate the second multicast message and the j-th destination address into the j-th second message.

[0075] An embodiment of the present application further provides a storage medium, which includes a stored program, wherein the program executes any of the above methods when it is run.

[0076] Optionally, in this embodiment, the storage medium may be configured to store program codes for executing the following steps:

[0077] S1, obtaining a first multicast message to be multicast to N destination addresses, where N is a positive integer greater than or equal to 2;

[0078] S2, copying the first multicast message to the N nodes through the node addresses stored in the serially connected N nodes, and transmitting the first multicast message on the N nodes to the N multicast leaves through the multicast leaf addresses stored in the N nodes, wherein the N multicast leaves correspond to the N destination addresses, the node address stored in the i-th node among the N nodes includes the address of the i+1-th node among the N nodes, the multicast leaf address stored in the i-th node among the N nodes includes the address of the i-th multicast leaf among the N multicast leaves, the multicast leaf address stored in the N-th node among the N nodes includes the address of the N-th multicast leaf among the N multicast leaves, and i is a positive integer greater than or equal to 1 and less than N;

[0079] S3, transmitting the first multicast message received by each multicast leaf in the N multicast leaves to the N destination addresses.

[0080] An embodiment of the present application further provides an electronic device, including a memory and a processor, wherein a computer program is stored in the memory, and the processor is configured to run the computer program to execute the steps in any one of the above method embodiments.

[0081] Optionally, the electronic device may further include a transmission device and an input / output device, wherein the transmission device is connected to the processor, and the input / output device is connected to the processor.

[0082] Optionally, in this embodiment, the processor may be configured to perform the following steps through a computer program:

[0083] S1, obtaining a first multicast message to be multicast to N destination addresses, where N is a positive integer greater than or equal to 2;

[0084] S2, copying the first multicast message to the N nodes through the node addresses stored in the serially connected N nodes, and transmitting the first multicast message on the N nodes to the N multicast leaves through the multicast leaf addresses stored in the N nodes, wherein the N multicast leaves correspond to the N destination addresses, the node address stored in the i-th node among the N nodes includes the address of the i+1-th node among the N nodes, the multicast leaf address stored in the i-th node among the N nodes includes the address of the i-th multicast leaf among the N multicast leaves, the multicast leaf address stored in the N-th node among the N nodes includes the address of the N-th multicast leaf among the N multicast leaves, and i is a positive integer greater than or equal to 1 and less than N;

[0085] S3, transmitting the first multicast message received by each multicast leaf in the N multicast leaves to the N destination addresses.

[0086] Optionally, in this embodiment, the above-mentioned storage medium may include but is not limited to: a USB flash drive, a read-only memory (ROM), a random access memory (RAM), a mobile hard disk, a magnetic disk or an optical disk, and other media that can store program codes.

[0087] Optionally, the specific examples in this embodiment may refer to the examples described in the above embodiments and optional implementation modes, and this embodiment will not be described in detail here.

[0088] Obviously, those skilled in the art should understand that the above modules or steps of the present application can be implemented by a general computing device, they can be concentrated on a single computing device, or distributed on a network composed of multiple computing devices, and optionally, they can be implemented by a program code executable by a computing device, so that they can be stored in a storage device and executed by the computing device, and in some cases, the steps shown or described can be executed in a different order from that herein, or they can be made into individual integrated circuit modules, or multiple modules or steps therein can be made into a single integrated circuit module for implementation. Thus, the present application is not limited to any specific combination of hardware and software.

[0089] The above is only a preferred embodiment of the present application. It should be pointed out that for ordinary technicians in this technical field, several improvements and modifications can be made without departing from the principles of the present application. These improvements and modifications should also be regarded as the scope of protection of the present application.

Claims

1. A data transmission method, characterized in that: include: Obtain a first multicast message to be multicast to N destination addresses, where N is a positive integer greater than or equal to 2; The first multicast message is copied to the N nodes through the node addresses stored in the N nodes connected in series, and the first multicast message on the N nodes is transmitted to the N multicast leaves through the multicast leaf addresses stored in the N nodes, wherein the N multicast leaves correspond to the N destination addresses, the node address stored in the i-th node among the N nodes includes the address of the i+1-th node among the N nodes, the multicast leaf address stored in the i-th node among the N nodes includes the address of the i-th multicast leaf among the N multicast leaves, the multicast leaf address stored in the N-th node among the N nodes includes the address of the N-th multicast leaf among the N multicast leaves, and i is a positive integer greater than or equal to 1 and less than N; Transmitting the first multicast message received by each of the N multicast leaves to the N destination addresses; The step of copying the first multicast message to the N nodes by using the node addresses stored in the N nodes connected in series includes: The first multicast message is transmitted to the first node among the N nodes, and the following operations are performed through the i-th node among the N nodes: The first multicast message received by the i-th node is transmitted to the i+1-th node via the address of the i+1-th node stored on the i-th node.

2. The method according to claim 1, characterized in that Before copying the first multicast message to the N nodes through the node addresses stored in the serially connected N nodes, and transmitting the first multicast message on the N nodes to the N multicast leaves through the multicast leaf addresses stored in the N nodes, the method further includes: Create the N nodes for transmitting the first multicast message, and store the address of the i+1th node among the N nodes and the address of the i-th multicast leaf among the N multicast leaves in the i-th node among the N nodes, and store the address of the N-th multicast leaf among the N multicast leaves in the N-th node among the N nodes.

3. The method according to claim 1, characterized in that Before copying the first multicast message to the N nodes through the node addresses stored in the serially connected N nodes, and transmitting the first multicast message on the N nodes to the N multicast leaves through the multicast leaf addresses stored in the N nodes, the method further includes: According to the N destination addresses, N nodes corresponding to the N multicast leaves are selected from a group of nodes, wherein the address of the multicast leaf corresponding to each node is pre-stored in each node in the group of nodes, the address of the multicast leaf corresponding to each node corresponds to a destination address, the address of the multicast leaf pre-stored in the i-th node in the N nodes is the address of the i-th multicast leaf in the N multicast leaves, and the address of the multicast leaf pre-stored in the N-th node in the N nodes is the address of the N-th multicast leaf in the N multicast leaves; An address of an i+1th node among the N nodes is stored in an i-th node among the N nodes.

4. The method according to any one of claims 1 to 3, characterized in that The method further includes: obtaining a second multicast message to be multicast to M destination addresses, wherein M is a positive integer greater than or equal to 2, and the M destination addresses are some of the N destination addresses; The second multicast message is copied to the M nodes through the node addresses stored in the M nodes connected in series, and the second multicast message on the M nodes is transmitted to the M multicast leaves through the multicast leaf addresses stored in the M nodes, wherein the M multicast leaves correspond to the M destination addresses, the M multicast leaves are part of the N multicast leaves, the node address stored in the j-th node among the M nodes includes the address of the j+1-th node among the M nodes, the multicast leaf address stored in the j-th node among the M nodes includes the address of the j-th multicast leaf among the M multicast leaves, the multicast leaf address stored in the M-th node among the M nodes includes the address of the M-th multicast leaf among the M multicast leaves, and j is a positive integer greater than or equal to 1 and less than M; The second multicast message received by each multicast leaf in the M multicast leaves is transmitted to the M destination addresses.

5. The method according to claim 4, characterized in that The transmitting the first multicast message received by each multicast leaf in the N multicast leaves to the N destination addresses includes: encapsulating the first multicast message and the i-th destination address in the N destination addresses into an i-th first message through a message processing module in the i-th multicast leaf in the N multicast leaves, and transmitting the i-th first message to the i-th destination address; The method of transmitting the second multicast message received by each multicast leaf in the M multicast leaves to the M destination addresses comprises: encapsulating the second multicast message and the jth destination address in the M destination addresses into a jth second message through a message processing module in the jth multicast leaf in the M multicast leaves, and transmitting the jth second message to the jth destination address; Among them, when the i-th multicast leaf and the j-th multicast leaf are the same multicast leaf, the message processing module in the same multicast leaf is used to encapsulate the first multicast message and the i-th destination address into the i-th first message, and encapsulate the second multicast message and the j-th destination address into the j-th second message.

6. A data transmission device, characterized in that: include: A first acquisition module, used to acquire a first multicast message to be multicast to N destination addresses, where N is a positive integer greater than or equal to 2; A first processing module is used to copy the first multicast message to the N nodes through the node addresses stored in the N nodes connected in series, and transmit the first multicast message on the N nodes to the N multicast leaves through the multicast leaf addresses stored in the N nodes, wherein the N multicast leaves correspond to the N destination addresses, the node address stored in the i-th node among the N nodes includes the address of the i+1-th node among the N nodes, the multicast leaf address stored in the i-th node among the N nodes includes the address of the i-th multicast leaf among the N multicast leaves, and the multicast leaf address stored in the N-th node among the N nodes includes the address of the N-th multicast leaf among the N multicast leaves, and i is a positive integer greater than or equal to 1 and less than N; A first transmission module, used for transmitting the first multicast message received by each multicast leaf in the N multicast leaves to the N destination addresses; Wherein, the first processing module is used to: The first multicast message is transmitted to the first node among the N nodes, and the following operations are performed through the i-th node among the N nodes: The first multicast message received by the i-th node is transmitted to the i+1-th node via the address of the i+1-th node stored on the i-th node.

7. A computer-readable storage medium, characterized in that: The computer-readable storage medium includes a stored program, wherein the program is executed by a processor to perform the method of any one of claims 1 to 5.

8. An electronic device comprising a memory and a processor, characterized in that: A computer program is stored in the memory, and the processor is configured to execute the method according to any one of claims 1 to 5 through the computer program.

Images