CN115499366B

CN115499366B - Message transmission method and device

Info

Publication number: CN115499366B
Application number: CN202110680167.7A
Authority: CN
Inventors: 耿雪松; 李振斌
Original assignee: Huawei Technologies Co Ltd
Current assignee: Huawei Technologies Co Ltd
Priority date: 2021-06-18
Filing date: 2021-06-18
Publication date: 2024-05-10
Anticipated expiration: 2041-06-18
Also published as: WO2022262579A1; CN115499366A

Abstract

The embodiment of the application discloses a message transmission method and a message transmission device, which are used for meeting the multicast requirement of SRv service data which does not support unicast. The method of the embodiment of the application comprises the following steps: the first network device may obtain a first data message from the second network device, the first data message including a multicast binding segment identification, the multicast binding segment identification may be matched to a parameter set, the parameter set may indicate a leaf node in a multicast tree, and the first network device may encapsulate the parameter set into the first data message to form the second data message.

Description

Message transmission method and device

Technical Field

The embodiment of the application relates to the technical field of communication, in particular to a message transmission method and device.

Background

The sixth version (segment routing internet protocol version, srv 6) of the segment routing network protocol is a new generation network protocol (internet protocol, IP) bearer protocol based on the sixth version (internet protocol version, ipv 6) of the network protocol and the Segment Routing (SR), and can unify the conventional complex network protocol. Nodes in the network may specify a series of operations (instructions) in the message, and during forwarding of the message in the network, the message is processed at other network nodes along the way according to the specified operations. The operation of segment routing assignment may control the forwarding path of the message and does not require other nodes in the network to maintain a per-flow state except for the head node. To provide greater scalability, as well as independence of services, the SR defines a binding segment identification (binding SEGMENT ID, BSID). The BSID is bound to an SR Policy (Policy) and instantiated as a list of SIDs when the node is designated. Taking the end point (endpoint bound to an SRv Policy, end.b6.insert) SID bound to SRv Policy defined by RFC8986 as an example, inserting a segment routing header (segment routing header, SRH) extension header (including a corresponding segment list (SEGMENT LIST)) after the IPv6 header, setting the first SID with the destination address of SRv6 Policy, setting each field of the outer layer IPv6 header, and finally performing table lookup forwarding on the new IPv6 packet. SR Policy for binding, which has a BSID that is currently defined, cannot be used in a multicast scenario.

Disclosure of Invention

The embodiment of the application provides a message transmission method and a message transmission device, which are used for realizing multicast transmission of SRv service data which does not support unicast.

The first aspect of the embodiment of the application provides a message transmission method, which comprises the following steps: the first network device serving as a root node receives a first data message from the second network device, wherein the first data message comprises a Multicast binding segment identification (Multicast BSID); the first network device obtains a second data message according to the Multicast BSID, wherein the second data message comprises a parameter set, and the parameter set is used for indicating to send the second data message to the network device serving as the leaf node; the first network device sends a second data message to the network device as a leaf node.

In the first aspect, the root node and the leaf node in the embodiment of the present application are nodes in the same multicast tree, the first network device is a root node in the multicast tree, the first network device may acquire a first data packet, the first data packet includes a multicast binding segment identifier, the multicast binding segment identifier may be matched to a parameter set, the parameter set may indicate the leaf node in the multicast tree, the first network device may encapsulate the parameter set into the first data packet to form a second data packet, and for the service data passing through the unicast domain, the first network device may convert the service data into multicast transmission, thereby meeting the multicast requirement of SRv service data that does not support unicast.

In a possible implementation manner, the step of the first network device obtaining the second data packet according to the Multicast BSID includes: the first network device obtains a parameter set according to the Multicast BSID and a first corresponding relation, wherein the first corresponding relation comprises the Multicast BSID and the parameter set; the first network device obtains a second data message based on the first data message and the parameter set.

In the above possible implementation manner, the first network device stores a first correspondence, where the first correspondence includes an association relationship between a Multicast BSID and a parameter set, that is, the Multicast BSID corresponds to the parameter set one by one, and the first network device may match the parameter set from the first correspondence according to the Multicast BSID in the first data packet, and package the first data packet to generate a second data packet, so as to perform Multicast transmission, facilitate conversion from unicast to Multicast, and improve feasibility of the scheme.

In a possible implementation manner, the step of the first network device obtaining the second data packet according to the Multicast BSID includes: the first network device obtains an identifier according to a Multicast BSID and a first corresponding relation, wherein the identifier is used for identifying a Multicast tree to which the network device serving as a leaf node belongs, and the first corresponding relation comprises the Multicast BSID and the identifier; the first network equipment obtains a parameter set according to the identifier and a second corresponding relation, wherein the second corresponding relation comprises the identifier and the parameter set; the first network device obtains a second data message based on the first data message and the parameter set.

In the above possible implementation manner, the first network device stores a first corresponding relationship and a second corresponding relationship, where the first corresponding relationship is an association relationship between a Multicast BSID and an identifier, the identifier is an identifier of a Multicast tree to which a leaf node of Multicast transmission belongs, and the second corresponding relationship is an association relationship between the identifier and a parameter set, and the first network device may determine the identifier of the Multicast tree to be transmitted according to the Multicast BSID in the first data packet, and determine the parameter set of the leaf node according to the identifier of the Multicast tree correspondingly, so as to package and generate a second data packet, so as to perform Multicast transmission, facilitate conversion from unicast to Multicast, and improve feasibility of the scheme.

In a possible implementation manner, the parameter set includes a bit string, and a set bit in the bit string corresponds to a network device as a leaf node; or the parameter set includes SID list including information indicating the network device as a leaf node.

In the foregoing possible implementation manner, the multicast tree where the leaf node is located may be a bit index explicit replication (bit indexexplicit replication, BIER) multicast tree, where the BIER multicast tree corresponds to the network device as the leaf node with a bit set in the bit string; or the multicast tree in which the leaf node is located may be a point-to-multipoint (P2 MP) multicast tree, and the parameter set may include a segment identification list including a segment identification or bit string of the leaf node to be transmitted. The parameter set comprises a bit string or a segment identification list, so that the parameter set can indicate leaf nodes, the unicast to multicast conversion is facilitated, and the feasibility of the scheme is improved.

In a possible implementation manner, before the first network device serving as the root node receives the first data packet from the second network device, the method further includes: the first network device determines a parameter set according to a multicast tree to which the network device serving as a leaf node belongs; the first network equipment acquires a first corresponding relation according to the parameter set, and acquires a second corresponding relation according to the first corresponding relation, wherein the second corresponding relation comprises a Multicast BSID and an identifier, and the identifier is used for identifying a Multicast tree to which the parameter set belongs.

In the foregoing possible implementation manner, before the first network device receives the first data packet, the first network device further needs to first construct or update a Multicast tree according to a report message of the leaf node, generate or update a first corresponding relationship accordingly, and then store the first corresponding relationship, and the first network device may further determine a corresponding relationship between the Multicast BSID and a Multicast tree to which the parameter set belongs according to a corresponding relationship between the Multicast BSID and the parameter set, so as to obtain a second corresponding relationship indicating an association relationship between the Multicast BSID and the identifier. The first network device can generate a second data message according to the first data message and the first corresponding relation, so that feasibility of the scheme is improved.

In a possible implementation manner, after the step of obtaining the first correspondence by the first network device according to the parameter set, the method further includes: the first network device sends the second correspondence to the second network device.

In the above possible implementation manner, after the first network device determines the second corresponding relationship, since the second network device does not need to perceive the parameter set, the first network device may send the second corresponding relationship to the second network device, so that when the second network device receives the Multicast message, the second network device may determine the Multicast BSID according to the identifier in the Multicast message and the stored second corresponding relationship, and package and generate the first data packet, thereby improving feasibility of the scheme.

In a possible implementation manner, before the first network device serving as the root node receives the first data packet from the second network device, the method further includes: the first network device determines a parameter set according to a multicast tree to which the network device serving as a leaf node belongs; the first network equipment acquires a second corresponding relation according to the parameter set; the first network device obtains a first corresponding relation according to the identification in the second corresponding relation.

In a possible implementation manner, before the first network device receives the first data packet, the first network device also needs to construct or update a multicast tree according to a report message of the leaf node, generate or update a second corresponding relationship according to an identifier of the constructed or updated multicast tree, generate or update a first corresponding relationship according to a relationship between the multicast tree indicated by the identifier and the parameter set, and store the first corresponding relationship and the second corresponding relationship, so that the first network device can generate the second packet according to the first data packet, the first corresponding relationship and the second corresponding relationship, thereby improving feasibility of the scheme.

In a possible implementation manner, after the step of obtaining the first correspondence by the first network device according to the identifier in the second correspondence, the method further includes: the first network device sends the first correspondence to the second network device.

In a possible implementation manner, the second network device stores the first corresponding relationship from the first network device, and when the second network device receives the Multicast message, the second network device can determine the Multicast BSID according to the first corresponding relationship, and package and generate the first data message, so as to improve feasibility of the scheme.

A second aspect of the embodiment of the present application provides a method for transmitting a message, where the method includes: the second network equipment receives a multicast message from a multicast source, wherein the multicast message comprises multicast source group information; the second network equipment acquires a first data message based on the Multicast message, wherein the first data message comprises a Multicast binding segment identification multi cast BSID corresponding to Multicast source group information; the second network device sends a first data message to the first network device as a root node.

In the second aspect, after the second network device obtains the Multicast packet, the Multicast packet may be encapsulated according to the Multicast BSID corresponding to the Multicast source group information in the Multicast packet, so as to generate a first data packet, and the first data packet is sent to the first network device, where the first network device is a root node of the Multicast tree, and the packet of the Multicast source is converted from the unicast domain, so as to meet the Multicast requirement of SRv service data that does not support unicast.

In a possible implementation manner, before the second network device receives the multicast packet from the multicast source, the method further includes: the second network device receives a first correspondence from the first network device, the first correspondence including a Multicast BSID and an identifier, the identifier being used to identify a Multicast tree to which the network device as a leaf node belongs, the Multicast source group information including the identifier.

In the above possible implementation manner, the second network device stores a first correspondence from the first network device, where the first correspondence indicates an association between the Multicast BSID and the identifier, and the second network device may match the corresponding Multicast BSID according to the identifier included in the Multicast source group information in the Multicast packet, and encapsulate the Multicast packet to generate the first data packet, thereby improving feasibility of the scheme.

In the above possible implementation manner, the second network device does not need to perceive the parameter set, but only stores the first corresponding relationship from the first network device, where the first corresponding relationship indicates the association relationship between the Multicast BSID and the identifier, that is, the second network device may determine the Multicast BSID according to the identifier in the Multicast source group information, so as to package and generate the first data packet, thereby improving feasibility of the scheme.

A third aspect of the present application provides a device for transmitting a message, where the device is disposed in a first network device serving as a root node, and includes: a receiving unit, configured to receive a first data packet from a second network device, where the first data packet includes a Multicast binding segment identifier Multicast BSID; an obtaining unit, configured to obtain a second data packet according to the Multicast BSID, where the second data packet includes a parameter set, and the parameter set is used to instruct sending the second data packet to a network device that is a leaf node; and the sending unit is used for sending the second data message to the network equipment serving as the leaf node.

The apparatus is for performing the method of the first aspect or any implementation of the first aspect.

A fourth aspect of the present application provides a device for transmitting a message, including: the receiving unit is used for receiving a multicast message from a multicast source, wherein the multicast message comprises multicast source group information; an obtaining unit, configured to obtain a first data packet based on the Multicast packet, where the first data packet includes a Multicast binding segment identifier Multicast BSID corresponding to Multicast source group information; and the sending unit is used for sending the first data message to the first network equipment serving as the root node.

The apparatus is for performing the method of the aforementioned second aspect or any of the embodiments of the second aspect.

A fifth aspect of an embodiment of the present application provides a communication device, including: a processor for executing instructions stored in the memory, the processor causing the communication device to perform the method provided in the first aspect or any of the alternatives of the first aspect, and a communication interface for receiving or transmitting an indication. The specific details of the communication device provided in the fifth aspect may be referred to the above first aspect or any optional manner of the first aspect, which are not described herein.

A sixth aspect of an embodiment of the present application provides a communication device, including: a processor for executing instructions stored in the memory, the processor causing the communication device to perform the method of the second aspect or any of the alternatives provided by the second aspect, and a communication interface for receiving or transmitting an indication. The specific details of the communication device provided in the sixth aspect may be found in the second aspect or any optional manner of the second aspect, which is not described here again.

A seventh aspect of the embodiments of the present application provides a computer readable storage medium having a program stored therein, which when executed by a computer, performs the method provided in the foregoing first aspect or any of the alternatives of the first aspect.

An eighth aspect of the embodiments of the present application provides a computer-readable storage medium having a program stored therein, which when executed by a computer, performs the method of the second aspect or any of the alternatives provided in the second aspect.

A ninth aspect of an embodiment of the application provides a computer program product which, when executed on a computer, performs the method of the first aspect or any of the alternatives provided by the first aspect.

A tenth aspect of the embodiments of the present application provides a computer program product which, when executed on a computer, performs the method of the second aspect or any of the alternatives provided by the second aspect.

Drawings

Fig. 1 is a schematic diagram of sending a message in a unicast mode and a multicast mode according to an embodiment of the present application;

Fig. 2 is a schematic structural diagram of a multicast tree according to an embodiment of the present application;

fig. 3 is a schematic diagram of an embodiment of a message transmission method according to an embodiment of the present application;

fig. 4 is a message transmission scenario provided in an embodiment of the present application;

fig. 5 is a schematic diagram of P2MP multicast provided in an embodiment of the present application;

fig. 6 is a schematic diagram of SID extension application provided in an embodiment of the present application;

Fig. 7 is a schematic structural diagram of a device for transmitting a message according to an embodiment of the present application;

Fig. 8 is another schematic structural diagram of a device for transmitting a message according to an embodiment of the present application;

fig. 9 is a schematic structural diagram of a communication device according to an embodiment of the present application;

fig. 10 is a schematic diagram of another structure of a communication device according to an embodiment of the present application.

Detailed Description

The embodiment of the application provides a message transmission method and a message transmission device, which are used for meeting the multicast requirement of SRv service data which does not support unicast.

Embodiments of the present application will now be described with reference to the accompanying drawings, in which it is evident that the embodiments described are only some, but not all embodiments of the present application. As one of ordinary skill in the art can know, with the development of technology and the appearance of new scenes, the technical scheme provided by the embodiment of the application is also applicable to similar technical problems.

The terms first, second and the like in the description and in the claims and in the above-described figures, are used for distinguishing between similar elements and not necessarily for describing a particular sequential or chronological order. It is to be understood that the data so used may be interchanged where appropriate such that the embodiments described herein may be implemented in other sequences than those illustrated or otherwise described herein. Furthermore, the terms "comprises," "comprising," and "having," and any variations thereof, are intended to cover a non-exclusive inclusion, such that a process, method, system, article, or apparatus that comprises a list of steps or elements is not necessarily limited to those steps or elements expressly listed but may include other steps or elements not expressly listed or inherent to such process, method, article, or apparatus.

The word "exemplary" is used herein to mean "serving as an example, embodiment, or illustration. Any embodiment described herein as "exemplary" is not necessarily to be construed as preferred or advantageous over other embodiments.

In addition, numerous specific details are set forth in the following description in order to provide a better illustration of the application. It will be understood by those skilled in the art that the present application may be practiced without some of these specific details. In some instances, well known methods, procedures, components, and circuits have not been described in detail so as not to obscure the present application.

In the following, some terms used in the present application are explained for easy understanding by those skilled in the art.

Segment Routing (SR): is a protocol designed based on the concept of source routing to forward data packets in a network. The SR divides the network path into segments and assigns segment identities (SEGMENT ID, SID) to the segments and network nodes, and by ordering the SIDs, a List of SIDs (also called a label stack in SR-MPLS) is obtained, which may indicate a forwarding path. Through the SR technology, nodes and paths through which the data packet carrying the SID List passes can be designated, so that the requirement of flow regulation and optimization is met. By way of analogy, a data packet may be compared to a baggage, SR may be compared to a tag attached to the baggage, if the baggage is to be sent from region a to region D, and from region B to region C, a tag may be attached to the baggage in region a of origin "first to region B, then to region C, and finally to region D", so that each region need only identify the tag on the baggage, and the baggage may be forwarded from region to region depending on the tag of the baggage. In SR techniques, a source node adds a label to a packet, and an intermediate node may forward to the next node according to the label until the packet reaches a destination node. For example, if < SID1, SID2, SID3> is inserted into the packet header of the data packet, the packet is forwarded to the node corresponding to SID1, then to the node corresponding to SID2, and then to the node corresponding to SID 3. Wherein, the Chinese and English language of SR-MPLS is called segment route multiprotocol label switching (Segment Routing Multi-Protocol Label Switching).

Segmented routing (SRv) based on internet protocol version 6 (Internet Protocol Version, ipv 6): refers to the application of SR technology in IPv6 networks. An IPv6 address (128 bits) is used as a representation of the SID. When forwarding the data packet, the network device supporting SRv will query the local SID table according to the destination address ((Destination Address, DA) in the data packet, and when the destination address of the data packet matches with any SID in the local SID table, execute the operation corresponding to the policy according to the policy related to the SID in the local SID table, for example, may forward the data packet from the outbound interface corresponding to the SID); if the destination address of the data packet is not longest matched with each SID in the local segment identification table, checking the IPv6 forwarding table, and carrying out longest matched forwarding according to the IPv6 forwarding table.

Different nodes in SRv networks may be connected by internet protocol (internet protocol, IP) address layer links. For any node, the node may issue at least one End point three-layer cross-connect segment identifier (End represents an End point; X represents cross-connect, three-layer cross-connect, SID means segment identifier), each End point three-layer cross-connect SID is used to identify an IP layer link directly connected to the node, and other nodes in the network may determine the SID corresponding to each IP layer link in the network by transceiving the End point three-layer cross-connect SID issued by each other. When a data packet enters SRv networks, the head node receives the data packet, determines a forwarding path of the data packet, in one possible implementation, the head node may obtain an end.x SID corresponding to each IP layer link according to each IP layer link through which the forwarding path needs to pass, write the obtained end.x SID into the data packet, and then send the data packet carrying the end.x SID to the next node. When any node receives the data packet, the node analyzes the data packet to obtain an end.X SID carried by the data packet, and sends the data packet out of an IP layer outbound interface bound with the end.X SID, so that the data packet can reach the next node through an IP layer link corresponding to the IP layer outbound interface, and the next node can continue forwarding the data packet until the data packet reaches a destination node by executing similar steps. In another possible implementation, the head node may obtain, according to each node through which the forwarding path needs to pass, an End segment identifier (End SID, end represents an endpoint, SID means a segment identifier) corresponding to each node, write the obtained End SID into a data packet, and then send the data packet carrying the End SID to the next node. When any node receives the data packet, the node analyzes the data packet to obtain an End SID carried by the data packet, and sends the data packet to a node corresponding to EndSID, the data packet reaches the node corresponding to the End SID, and the like, and each node continues forwarding the data packet by executing similar steps until the data packet reaches the destination node. Note that, the SID list formed by end.x or END may indicate only some nodes, but not all nodes, on the path. In addition, end.x and END, and other SRv 6. 6 Functions may also be used in combination.

Segmented routing header (Segment Routing Header, SRH): the IPv6 message is composed of an IPv6 standard header+an extension header (0..n) +payload. In order to implement SRv6 based on the IPv6 forwarding plane, an IPv6 extension header, called an SRH extension header, is added, the extension header specifies an explicit path of IPv6, and stores SEGMENT LIST information of IPv6, which functions as SEGMENT LIST in SR MPLS. The head node adds an SRH extension head in the IPv6 message, and the intermediate node can forward according to the path information contained in the SRH extension head.

Binding SID (BSID): the BSID will bind to a SID list. When a node obtains a valid BSID, BSID-related operations are performed. In SR-MPLS, the BSID-related operation may be: the BSID is popped up and pushed into the corresponding SID List. In SRv, BSID related operations may be: depending on the BSID function, a new SRH header (end.b6. Insert) is inserted, or a new outer IPv6 header (end.b6. Encaps) containing SRH is inserted.

Head Node (Head Node): the starting node of the SR forwarding path is responsible for the encapsulation section identification.

In bit index explicit replication (bit index explicit replication, BIER) techniques, a network device is instructed to replicate a multicast message to a designated recipient using a bit string (BitString) in the BIER message. BIER packets encapsulate BIER headers, carrying BitString therein, each bit in BitString representing a recipient. The intermediate node does not sense the multicast group state and only completes the copying and forwarding of the message according to BitString.

In BIER multicast protocols, the network domain supporting BIER forwarding is called BIER domain. The BIER domain may be divided into a plurality of sub-domains. Each BIER field contains at least one subdomain. Routers within the domain that support BIER forwarding capability are referred to as bit forwarding routers (bit forwarding router, BFR). When a BFR is used as an ingress router for the BIER domain, this BFR is the bit forwarding ingress router (bit forwarding ingress router, BFIR). When it acts as an egress router for the BIER domain, this BFR is the bit forwarding egress router (bit forwardingegress router, BFER). BFIR and BFER also have a common name, edge BFR, which is also the source node or destination node in the BIER domain. The edge BFR has a proprietary BIER forwarding router identifier (BIER forwardingrouter identifier, BFR-ID) represented by an integer in the range of 1 to 65535. For example, a network has 256 edge nodes, each edge node needs to be configured with a unique value of 1-256, and the destination node set is represented by a position or index of 256 bits (or 32 bytes) BitString, where each Bit in BitString is located, to represent an edge node.

In the unicast forwarding field, SRv technology based on an IPv6 data plane has evolved rapidly, and the potential for SR-MPLS using an MPLS data plane has been exceeded. In the multicast field, how to apply BIER architecture and encapsulation, implementing technology that does not depend on MPLS and conforms to the development trend of IPv6 networks becomes a problem to be solved. In this context, the industry proposes an explicit copy of the IPv6 encapsulated bit index (Bit Index Explicit Replication IPv encapsulation, BIERv) technique. BIERv6 inherits the core design concept of BIER, it uses BitString to copy the multicast message to the designated receiver, and the intermediate node does not need to build a multicast forwarding tree, so as to implement stateless forwarding.

Multicasting, also known as multicasting, can efficiently solve point-to-multipoint transmission and distribution problems relative to unicast (unicasting) and broadcast (broadcasting). In a multicast scenario, data may be sent to a group of users along a particular path, with at most one share of the same multicast data on each link. For example, for some services, such as an interactive internet protocol television (internetprotocol television, IPTV), the content of the messages sent by the server to different users is the same, please refer to fig. 1, and as shown in fig. 1, a schematic diagram of sending the messages in a unicast mode and a multicast mode provided by an embodiment of the present application is shown, in the unicast mode, after the server copies the messages to different users, the messages are sent to the corresponding users respectively; in the multicast mode, the server only needs to send one message for each downstream routing device joining the multicast group, and then the routers at all levels copy the message with the granularity of the device and send the message to the corresponding user. Therefore, for the upstream network above the access point, the multicast mode can obviously reduce the message copying pressure and the waste of bandwidth.

Fig. 2 is a schematic structural diagram of a multicast tree according to an embodiment of the present application. The multicast tree may include a root node, an intermediate node, and a leaf node. Intermediate nodes may refer to nodes other than edge nodes, such as node B and node C in fig. 2. Edge nodes may include root nodes and leaf nodes. Node a is the root node. Node D, node E and node F are leaf nodes. When the node E, which is a leaf node, also acts as an intermediate node, the transmission path between the node E and the node C may replace the transmission path between the node B and the node C in fig. 2 to generate another multicast tree. In the case where the node E as a leaf node also serves as an intermediate node, the node E is referred to as a hybrid (bid) node. The structure of the multicast tree shown in fig. 2 is merely exemplary and not limiting of the present application.

The forwarding flow of the multicast data message comprises the following steps: and the root node of the multicast tree receives the multicast data message sent by the multicast source, and the root node sends the multicast data message to the leaf node of the multicast tree. The root node forwards the multicast data message to the downstream node. The downstream node of a certain node refers to the next hop node of the certain node on the transmission path along the direction from the root node to the leaf node in the multicast tree. And if the downstream node of the root node is an intermediate node, the intermediate node sends the multicast data message to the leaf node of the multicast tree through the downstream node. And after receiving the multicast data message, the leaf node sends the multicast data message to a host connected with the local port through the local port. If the bud node exists in the multicast tree, the bud node sends the copied multicast data message through a local port in addition to sending the multicast data message to a downstream node of the bud node. As shown in fig. 2, node a sends a multicast data message from a multicast source to node B downstream thereof. And the node B replicates the multicast data message and respectively sends the multicast data message to a node E and a node C at the downstream of the node B. And the node C replicates the multicast data message and sends the multicast data message to the downstream node F and the downstream node D respectively. The node F and the node D can respectively send the multicast data message through respective local ports. When the node E is a bid node, the node E can copy the multicast data message and respectively send a part of multicast data message through a local port and a port capable of communicating with a downstream C node.

The SR-defined BSID is bound to an SR policy, instantiated as a list of SIDs at the designated node. Any received message is currently segment is a BSID, and the message is bound to an SR Policy (Policy). Taking the end point (endpoint bound to an SRv Policy, end.b6.insert) SID bound to SRv Policy defined by RFC8986 as an example, inserting a segment routing header (Segment Routing Header, SRH) extension header (including a corresponding segment list (SEGMENT LIST)) after the IPv6 header, setting the first SID with the destination address of SRv6 Policy, setting each field of the outer layer IPv6 header, and finally performing table lookup forwarding on the new IPv6 packet. But the SR Policy that the BSID has been defined for binding is a unicast path and cannot be used in a multicast scenario.

In order to solve the above problems, an embodiment of the present application provides a message transmission method, where the method is as follows.

Referring to fig. 3, an embodiment of a message transmission method shown in fig. 3 includes:

301. The multicast source sends a multicast message to the second network device.

In the embodiment of the application, the point-to-point communication between the source host and the destination host is unicast. If information is to be sent to multiple hosts, but not all hosts, if unicast implementation is adopted, repeated IP packets not only occupy a lot of bandwidth, but also increase the load of the source host.

Multicasting refers to transmitting data packets to a certain defined set of nodes (i.e., multicast group) in an IP network, and the basic idea is that: the source host (i.e. multicast source) only sends one data, and the destination address is the multicast group address; all receivers in the multicast group can receive the same copy of the data, and only hosts in the multicast group can receive the data, but other hosts cannot.

In the embodiment of the application, a data packet which is to be transmitted to a multicast tree by a multicast source (multicast source) needs to pass through an SR domain, wherein the SR domain can be a unicast domain or a multicast domain, the SR domain can be SRv domain, and an SR policy bound to a BSID in SRv domain is only a unicast path, so that the data packet from the multicast source needs to pass through the unicast domain and then go to the multicast domain. In this embodiment, referring to fig. 4, fig. 4 shows a packet transmission scenario provided by the embodiment of the present application, a data packet from a multicast source passes through a head Node (Ingress Node) in SR/SRv domain, then passes through a multicast instantiation Node (Multicast Initiation Node), and is replicated by an intermediate Node to be transmitted to a multicast leaf Node (leaf Node). The number of nodes between the head node and the multicast instantiation node is not limited, and the number of intermediate nodes and the number of layers between the multicast instantiation node and the multicast leaf node are not limited. The first network device in the embodiment of the application is a multicast instantiation node, and the second network device is a head node.

The multicast source may transmit a multicast message intended for the multicast leaf node to the head node, which transmits the multicast message to the multicast leaf node. The multicast message further includes multicast source group information indicating multicast leaf nodes.

302. The second network device obtains a first data message based on the multicast message.

In the embodiment of the application, after receiving the Multicast message, the head node can acquire the Multicast source group information, and a Multicast binding segment identifier (Multicast BSID) is determined according to the Multicast leaf node indicated by the Multicast source group information. The head node may encapsulate the multicast binding segment identification into the multicast message to form a first data message. When a multicast message enters SRv domain, the header node encapsulates the message with SRv extension header and converts it into SRv message. SRv6 the header includes an IPv6 header and SRv extension header. A Source Address (SA) field in the IPv6 header is set to a routable IPv6 unicast address. The destination address (destination address, DA) field in the IPv6 header is set to the address of the next hop node. And a plurality of SIDs included in the SRH in the SRv extension header may indicate a transmission path of the first data packet, where the last SID in the SRH is a multicast binding segment identifier, and the multicast binding segment identifier has an association relationship with a multicast leaf node that the multicast source wants to transmit. Specifically, the format of the first data packet may be referred to as table 1 below.

IPv6
	SRH
Payload

TABLE 1

303. The second network device sends a first data message to the first network device as a root node.

In the embodiment of the present application, after the first data packet is obtained, the head node may transmit the first data packet according to the address of the next hop node in the IPv6 head, and specifically, there may be multiple nodes between the head node and the multicast instantiation node, where only forwarding work is performed between the head node and the multicast instantiation node until the first data packet is sent to the multicast instantiation node indicated by the last SID in the SRH.

304. The first network device obtains the second data message according to the Multicast BSID.

In the embodiment of the application, after receiving the first data packet, the multicast instantiation node can obtain the multicast binding segment identifier in the first data packet, and then determine the parameter set corresponding to the multicast binding segment identifier according to the multicast binding segment identifier, that is, insert a multicast encapsulation header (Multicast Encap) into the first data packet according to the multicast binding segment identifier, where the multicast encapsulation header includes the parameter set, and the parameter set can instruct to send the second data packet to the network device serving as the leaf node. Specifically, the format of the second data packet may be as shown in table 2 below.

Multicast Encap
	IPv6
SRH
	Payload

TABLE 2

Optionally, the manner in which the first network device obtains the second data packet according to the Multicast binding segment identifier may be that the first network device obtains the parameter set according to the Multicast BSID and the first correspondence; the first network device obtains a second data message based on the first data message and the parameter set.

Specifically, the multicast instantiation node may store a first correspondence, where the first correspondence includes the multicast binding segment identifier and the parameter set, and the multicast binding segment identifier corresponds to the parameter set one to one. That is, after the multicast instantiation node obtains the multicast binding segment identifier, the multicast instantiation node may match a corresponding parameter set from the first correspondence, and then encapsulate the parameter set into a Multicast Encap layer header of the second packet. The first correspondence may be as shown in table 3 below. The multicast binding segment identification comprises M-BSID-A, M-BSID-B and M-BSID-C, and the parameter sets comprise parameter set A, parameter set B and parameter set C, wherein M-BSID-A corresponds to parameter set A, M-BSID-B corresponds to parameter set B and M-BSID-C corresponds to parameter set C.

Multicast binding segment identification	Parameter set
		M-BSID-A	Parameter set A
M-BSID-B	Parameter set B
		M-BSID-C	Parameter set C

TABLE 3 Table 3

Optionally, the first network device determines the parameter set according to a multicast tree to which the network device serving as the leaf node belongs; the first network device obtains a first corresponding relation according to the parameter set, and the first network device can also obtain a second corresponding relation according to the first corresponding relation. Specifically, the network device serving as the leaf node may report the multicast tree to which the network device belongs to the multicast instantiation node, and then the multicast instantiation node may determine a parameter set included in the multicast tree according to the multicast tree that is built or updated, and then configure a multicast binding segment identifier for the parameter set of each multicast tree, and store the multicast binding segment identifier in the first corresponding relationship. The multicast instantiation node may further determine a second corresponding relationship according to the identifier of the multicast tree to which the parameter set belongs, where the second corresponding relationship includes a multicast binding segment identifier and an association relationship of the identifier. The second correspondence may be as shown in Table 4 below, where the multicast binding segment identification includes M-BSID-A, M-BSID-B and M-BSID-C, and the identification includes multicast TREE A (M-TREE-A), multicast TREE B (M-TREE-B) and multicast TREE C (M-TREE-C), where M-BSID-A corresponds to M-TREE-A, M-BSID-B corresponds to M-TREE-B, and M-BSID-C corresponds to M-TREE-C.

Multicast binding segment identification	Identification mark
		M-BSID-A	M-TREE-A
M-BSID-B	M-TREE-B
		M-BSID-C	M-TREE-C

TABLE 4 Table 4

Optionally, the first network device may further send the second correspondence to the head node. When receiving the multicast message, the head node may determine a multicast binding segment identifier according to the identifier of the multicast tree included in the multicast source group information in the multicast message, and encapsulate the multicast message according to the multicast binding segment identifier to generate the first data message.

Optionally, the first network device may obtain the second data packet according to the Multicast binding segment identifier by the first network device further obtaining the identifier according to a Multicast BSID and a first correspondence; the first network equipment obtains a parameter set according to the identification and the second corresponding relation; the first network device obtains a second data message based on the first data message and the parameter set.

Specifically, the multicast instantiation node may store a first correspondence and a second correspondence, where the first correspondence includes the multicast binding segment identifier and the identifier, and the multicast binding segment identifier and the identifier are in one-to-one correspondence. The identification may indicate a multicast tree to which the network device as a leaf node belongs. The multicast instantiation node can determine the multicast tree to be transmitted by the message after obtaining the multicast binding segment identification. The second correspondence may then include the identifier and the parameter set, where the identifier and the parameter set are in one-to-one correspondence. After the multicast instantiation node determines the multicast tree, the multicast instantiation node can be matched with a corresponding parameter set in a second corresponding relation to generate the second data message. The first correspondence may be referred to as shown in table 4 above, and the second correspondence may be referred to as shown in table 5 below. The identification of the multicast TREE includes multicast TREE A (M-TREE-A), multicast TREE B (M-TREE-B) and multicast TREE C (M-TREE-C), the parameter sets include parameter set A, parameter set B and parameter set C, wherein M-BSID-A corresponds to M-TREE-A, M-BSID-B corresponds to M-TREE-B, M-BSID-C corresponds to M-TREE-C, and M-TREE-A corresponds to parameter set A, M-TREE-B corresponds to parameter set B, and M-TREE-C corresponds to parameter set C.

Identification mark	Parameter set
		M-TREE-A	Parameter set A
M-TREE-B	Parameter set B
		M-TREE-C	Parameter set C

TABLE 5

Optionally, the first network device determines the parameter set according to a multicast tree to which the network device serving as the leaf node belongs; the first network equipment acquires a second corresponding relation according to the parameter set; the first network device obtains a first corresponding relation according to the identification in the second corresponding relation. Specifically, the network device serving as the leaf node may report the multicast tree to which the network device belongs to the multicast instantiation node, and each multicast tree may be assigned with an identifier to distinguish, where the multicast instantiation node may determine a parameter set included in the multicast tree according to the multicast tree that is built or updated, and each identifier corresponds to one parameter set, and the association relationship may be stored in the first corresponding relationship, and then the multicast instantiation node may configure a multicast binding segment identifier for each identifier of the multicast tree and store in the second corresponding relationship. Optionally, the first network device may further send the first correspondence to the head node. The head node does not need to sense the parameter set, so that only the second corresponding relation is needed to be not received, when the head node receives the multicast message, the head node can determine the multicast binding section identification according to the multicast tree identification included in the multicast source group information in the multicast message and the first corresponding relation from the multicast instantiation node, and then package the multicast message according to the multicast binding section identification to generate the first data message.

305. The first network device sends a second data message to the network device as a leaf node.

In the embodiment of the present application, after generating the second data packet for the first data packet Wen Fengzhuang, the multicast instantiation node may send the second data packet to the network device as the leaf node indicated by the parameter set according to the packet transmission mode of the multicast tree.

Optionally, the parameter set may include a bit string; or the parameter set may include SID list.

Specifically, when the parameter set includes a bit string, the multicast tree is BIERv6 multicast trees, the message transmission domain is BIERv domain, the bit set in the bit string corresponds to the network device serving as the leaf node, and an exemplary BIERv multicast tree includes A, B, C and D4 leaf nodes. Wherein, when node a is an edge node that receives the second data message, the bit string corresponding to the parameter set may be represented as 0001. When the node B is an edge node that receives the second data message, the bit string corresponding to the parameter set may be denoted 0010. When node C is an edge node that receives the second data message, the bit string corresponding to the parameter set may be represented as 0100. When node D is an edge node that receives the second data message, the bit string corresponding to the parameter set may be represented as 1000. When node B and node D are data nodes that receive the second data message, the bit string corresponding to the parameter set may be represented as 1010. In establishing the multicast tree, nodes A, B, C and D advertise the respective bit positions to the respective upstream nodes via a tree establishment protocol. The upstream node of a certain node is the last hop node of the certain node on the transmission path in the direction from the root node to the leaf node of the multicast tree. After receiving the announcements of nodes A, B, C and D, the multicast instantiation node obtains and saves the bit positions of nodes A, B, C and D. After receiving the first data message, the multicast instantiation node may determine that the second data message needs to be sent to nodes B and C according to the determined bit string in the parameter set being 0110. And the multicast instantiation node obtains a BIER message according to the bit string and the first data message. The BIER message includes a BIER header and the multicast data message. The BIER header includes a bit string of 0110. The multicast instantiation node sends the BIER message to the next-hop node (intermediate node).

The BIERv network defines a new type of SID, called end. Bier address, which acts as a BIERv extension header in the forwarding plane processing messages for IPv6 destination address indicating devices. When each node receives and processes BIERv message, it encapsulates end.bier SID of next-hop node into external layer IPv6 destination address of BIERv message (first data message destination node is defined by bit string), so that next-hop node forwards message according to BIERv flow.

When the first data message enters BIERv domain, the multicast instantiation node encapsulates the message with BIERv6 extension header, converts it into BIERv message, and Multicast Encap is BIERv message header. BIERv6 the header includes an IPv6 header and BIERv extension header. After receiving BIERv message, the intermediate node BFR will process data packet according to general procedure of IPv6 message processing. Firstly, processing the IPv6 header, if the IPv6 target address is the end.BIER IPv6 unicast address of the BFR, indicating that the network equipment needs to process the message according to BIERv forwarding flow, and reading the corresponding field in the BIERv extension header in the second data message. The BFR then copies the message to the next BFR node in accordance with the forwarding procedure described above. When the network equipment serving as the leaf node receives the multicast message, if the bit position corresponding to the BFR-ID of the node in the bit string of the message is set, the IPv6 encapsulation is stripped, BFIR-ID information in the BIERv head is taken out to determine from which root node the traffic is coming, and further the source address of the message is used for determining which virtual private network (virtual private network, VPN) the message belongs to, so that a private network routing table is searched in the corresponding VPN to forward the message continuously.

Specifically, when the parameter set includes SID list, the multicast tree is a point-to-multipoint (P2 MP) multicast tree, the packet transmission domain is an SR P2MP domain, and the SID list includes information indicating a network device as a leaf node, where the information may be a SID or a bit string. In the embodiment of the present application, if the network device serving as the leaf node joins the multicast tree to follow the multicast joining mechanism defined by SRv P2MP, then Multicast Encap is a P2MP header.

In one possible implementation manner of the P2MP header, the SID in the SRH may be extended, two fields of the number of branches (number of branches, N-Branches) and the number of mid-subtree sections (number of SIDs in subtree, N-SIDs) are defined, and the SID of the next branching node and the SID of the corresponding subtree may be located; after the intermediate node receives the second data packet, only the SID of the present bifurcation node and the SID of the corresponding subtree are reserved after the packet is copied, and the SIDs of other subtrees are removed from SEGMENT LIST of the SRH. Exemplary, as shown in fig. 5, a P2MP multicast schematic diagram provided by an embodiment of the present application, as shown in fig. 5, the P2MP multicast tree includes: head node R-M, intermediate nodes P1-M, P2-M, P3-M, P4-M, and leaf nodes L1-M, L2-M, L3-M, L4-M, wherein the multicast tree comprises 4 links, and the message output by R-M is transmitted to L1-M through P1-M and P2-M; the message output by R-M is transmitted to L2-M through P1-M and P2-M; the message output by R-M is transmitted to L3-M through P1-M, P-M and P4-M; the message output by R-M is transmitted to L4-M through P1-M, P-M and P4-M. The SIDs of the intermediate and leaf nodes in the multicast tree may be referred to as shown in table 6 below, multicast Node SID Locator may identify the location of the Node, multicast Node SID Block as a prefix, in combination with the Node-X-ID to construct Multicast Node SID Block as described above.

/>

TABLE 6

In another possible implementation manner of the P2MP header, the SID in the SRH may be extended, and a Pointer (Pointer) field is added in each SID, so that the nodes in the path can be divided according to the hierarchy, and meanwhile, the next level node associated with the node is designated. Specifically, the multicast tree is divided according to the replication relationship according to the hierarchy, all nodes in the multicast tree are encoded in the messages in the form of the hierarchy, the hierarchy is arranged from low to high, the nodes in the same layer are encoded together, and the messages with the same father node are encoded together. Wherein each parent node points to the position of the child node in the SRH after replication, specifically, in expanding the SID of SRv, the Locator (for the route to the parent node) is unchanged; functions are extended to Hierarchical for indicating new multicast/multipath related functions, such as duplication, deletion of redundant messages, load balancing, active/standby protection, etc. Argument extends to the Pointer to indicate where the next child node is located in the SRH after the parent node is replicated; the Pointer includes Pointer1 and Pointer2, in two coded forms, 1) Pointer1 indicates an initial SEGMENT LEFT (SL) value of the child node and Pointer2 indicates an offset value; 2) Pointer1 indicates the initial SEGMENT LEFT value of the child node and Pointer2 indicates the end SEGMENTLEFT value. The expansion format in which the SID is expanded can be referred to as shown in table 7 below.

TABLE 7

For an exemplary multicast tree, as shown in fig. 6, the SID extension application provided in the present application is schematically shown, where the multicast tree head node is a, the child nodes of node a (sl=0) have node B (sl=1) and node C (sl=2), the child nodes of node B have node B1 (sl=3), node B2 (sl=4) and node B3 (sl=5), and the child nodes of node C have node C1 (sl=6), node C2 (sl=7) and node C3 (sl=8). The Pointer is sl=1-2 in the message sent from node a, sl=3-5 in the message sent from node B, sl=6-8 in the message sent from node C, and sl=0 in the messages sent from nodes B1, B2, B3, C1, C2 and C3.

In another possible implementation of the P2MP header, the new Segment type and the corresponding Function are defined for more efficient P2MP encoding by expanding in SRH/RH. Wherein, define new Segment-Bitstring Segment, bitstring Segment includes two parts: points and Bitstring, wherein: pointer: segment starting positions corresponding to the child nodes; bitstring: and the adjacent link (Adjacency) is used for carrying the instruction message forwarding after copying.

The format of the messages sent from nodes A, B and C in the multicast tree in fig. 6 may be referred to as shown in table 8 below.

Locator	Pointer	Bitstring
			A	1	110000
B	0	111000
			C	0	111000

TABLE 8

The message transmission in the embodiment of the present application may also be from a multicast domain to a multicast domain, specifically, may be a transmission from a branch in a multicast tree to a subtree, or may be a transmission between different multicast trees, in this embodiment, the transmission from a branch in a multicast tree to a subtree is taken as an example, and in an example of fig. 5, a multicast tree taking P1-M as a root node, and a subtree taking P2-M as a root node and a subtree taking P4-M as a root node, are also included, and in this embodiment, a first network device of the present application may be nodes P4-M, a second network device may be P3-M, and a network device serving as a leaf node may be L3-M and L4-M. Specifically, the node P4-M stores a corresponding relation (a first corresponding relation and/or a second corresponding relation) including parameter sets indicating L3-M and L4-M, and after the node P4-M receives a first data packet from the node P3-M, encapsulates the parameter sets into the first data packet according to the corresponding relation to generate a second data packet, and transmits the second data packet according to the parameter sets.

Having described the message transmission method, the following describes the message transmission device according to the embodiment of the present application with reference to the accompanying drawings. Fig. 7 is a schematic diagram of an embodiment of an apparatus 70 according to the present application. The apparatus 70 may be provided on a network device as a root node, such as the first network device mentioned in the embodiments of the present application. As shown in fig. 7, an embodiment of the present application provides a device for transmitting a message, where the device includes:

A receiving unit 701, configured to receive a first data packet from a second network device, where the first data packet includes a Multicast binding segment identifier Multicast BSID;

an obtaining unit 702, configured to obtain a second data packet according to the Multicast BSID, where the second data packet includes a parameter set, and the parameter set is used to instruct sending the second data packet to a network device that is a leaf node;

a sending unit 703, configured to send the second data packet to a network device that is a leaf node.

Optionally, the acquiring unit 702 is specifically configured to: obtaining a parameter set according to the Multicast BSID and a first corresponding relation, wherein the first corresponding relation comprises the Multicast BSID and the parameter set; and acquiring a second data message based on the first data message and the parameter set.

Optionally, the acquiring unit 702 is specifically configured to: obtaining an identifier according to a Multicast BSID and a first corresponding relation, wherein the identifier is used for identifying a Multicast tree to which a network device serving as a leaf node belongs, and the first corresponding relation comprises the Multicast BSID and the identifier; obtaining a parameter set according to the identification and a second corresponding relation, wherein the second corresponding relation comprises the identification and the parameter set; and acquiring a second data message based on the first data message and the parameter set.

Optionally, the parameter set includes a bit string, and a bit set in the bit string corresponds to the network device as the leaf node; or the parameter set includes SID list including information indicating the network device as a leaf node.

Optionally, the obtaining unit 702 is further configured to: determining a parameter set according to a multicast tree to which the network device serving as a leaf node belongs; acquiring a first corresponding relation according to the parameter set; and acquiring a second corresponding relation according to the first corresponding relation, wherein the second corresponding relation comprises a Multicast BSID and an identifier, and the identifier is used for identifying a Multicast tree to which the parameter set belongs. The sending unit 703 is further configured to send the second correspondence to a second network device.

Optionally, the obtaining unit 702 is further configured to: determining a parameter set according to a multicast tree to which the network device serving as a leaf node belongs; acquiring a second corresponding relation according to the parameter set; and acquiring the first corresponding relation according to the identification in the second corresponding relation. The sending unit 703 is further configured to send the first correspondence relationship to a second network device.

Fig. 8 is a schematic diagram of another embodiment of an apparatus 80 according to an embodiment of the present application. The apparatus 80 may be provided on a network device, such as a second network device, that is an intermediate forwarding node. As shown in fig. 8, an embodiment of the present application provides a device for transmitting a message, where the device includes:

a receiving unit 801, configured to receive a multicast message from a multicast source, where the multicast message includes multicast source group information;

an obtaining unit 802, configured to obtain a first data packet based on the Multicast packet, where the first data packet includes a Multicast binding segment identifier Multicast BSID corresponding to Multicast source group information;

A sending unit 803, configured to send a first data packet to a first network device that is a root node.

Optionally, the receiving unit 801 is further configured to: and receiving a first corresponding relation from the first network equipment, wherein the first corresponding relation comprises a Multicast BSID and an identifier, the identifier is used for identifying a Multicast tree to which the network equipment serving as a leaf node belongs, and the Multicast source group information comprises the identifier.

Optionally, the receiving unit 801 is further configured to: and receiving a first corresponding relation and a second corresponding relation from the first network equipment, wherein the first corresponding relation comprises a Multicast BSID and an identifier, the identifier is used for identifying a Multicast tree to which the network equipment serving as a leaf node belongs, and the Multicast source group information comprises the identifier.

Fig. 9 is a schematic diagram of a possible logic structure of a communication device 90 according to an embodiment of the present application. The communication device 90 includes: processor 901, communication interface 902, storage system 903, and bus 904. The processor 901, the communication interface 902, and the storage system 903 are interconnected by a bus 904. In an embodiment of the present application, the processor 901 is configured to control and manage the actions of the communication device 90, for example, the processor 901 is configured to perform the steps performed by the first network device in the method embodiment of fig. 3. The communication interface 902 is for supporting communication by the communication device 90. A storage system 903 for storing program code and data for the communication device 90.

The processor 901 may be, among other things, a central processing unit, a general purpose processor, a digital signal processor, an application specific integrated circuit, a field programmable gate array or other programmable logic device, a transistor logic device, a hardware component, or any combination thereof. Which may implement or perform the various exemplary logic blocks, modules and circuits described in connection with this disclosure. Processor 901 may also be a combination that implements computing functionality, such as a combination comprising one or more microprocessors, a combination of digital signal processors and microprocessors, and the like. Bus 904 may be a peripheral component interconnect (PeripheralComponent Interconnect, PCI) bus, or an extended industry standard architecture (Extended Industry StandardArchitecture, EISA) bus, among others. The buses may be divided into address buses, data buses, control buses, etc. For ease of illustration, only one thick line is shown in fig. 9, but not only one bus or one type of bus.

The receiving unit 701 and the transmitting unit 703 in the apparatus 70 correspond to a communication interface 902 in the communication device 90, and the acquiring unit 702 in the apparatus 70 corresponds to a processor 901 in the communication device 90.

The communication device 90 of the present embodiment may correspond to the first network device in the above-mentioned method embodiment of fig. 3, and the communication interface 902 in the communication device 90 may implement the functions and/or the implemented steps of the first network device in the above-mentioned method embodiment of fig. 3, which are not described herein for brevity.

Fig. 10 is a schematic diagram of a possible logic structure of a communication device 100 according to an embodiment of the present application. The communication device 100 includes: a processor 1001, a communication interface 1002, a memory system 1003, and a bus 1004. The processor 1001, the communication interface 1002, and the storage system 1003 are connected to each other by a bus 1004. In an embodiment of the application, the processor 1001 is configured to control and manage the actions of the communication device 100, for example, the processor 1001 is configured to perform the steps performed by the second network device in the method embodiment of fig. 3. The communication interface 1002 is for supporting communication by the communication device 100. A storage system 1003 for storing program code and data of the communication device 100.

The processor 1001 may be a central processing unit, a general purpose processor, a digital signal processor, an application specific integrated circuit, a field programmable gate array or other programmable logic device, a transistor logic device, a hardware component, or any combination thereof. Which may implement or perform the various exemplary logic blocks, modules and circuits described in connection with this disclosure. The processor 1001 may also be a combination that implements computing functionality, such as a combination comprising one or more microprocessors, a combination of digital signal processors and microprocessors, and so forth. Bus 1004 may be a peripheral component interconnect (PeripheralComponent Interconnect, PCI) bus, or an extended industry standard architecture (Extended Industry StandardArchitecture, EISA) bus, among others. The buses may be divided into address buses, data buses, control buses, etc. For ease of illustration, only one thick line is shown in fig. 10, but not only one bus or one type of bus.

The receiving unit 801 and the transmitting unit 803 in the apparatus 80 correspond to the communication interface 1002 in the communication device 100, and the acquiring unit 802 in the apparatus 80 corresponds to the processor 1001 in the communication device 100.

The communication device 100 of the present embodiment may correspond to the second network device in the embodiment of the method of fig. 3, and the communication interface 1002 in the communication device 100 may implement the functions and/or the implemented steps of the second network device in the embodiment of the method of fig. 3, which are not described herein for brevity.

In another embodiment of the present application, there is further provided a computer readable storage medium having stored therein computer executable instructions that, when executed by a processor of a device, perform the steps of the message transmission method performed by the first network device in fig. 3.

In another embodiment of the present application, there is further provided a computer readable storage medium having stored therein computer executable instructions which, when executed by a processor of a device, perform the steps of the message transmission method performed by the second network device in fig. 3.

In another embodiment of the present application, there is also provided a computer program product comprising computer-executable instructions stored in a computer-readable storage medium; when the processor of the device executes the computer-executable instructions, the device performs the steps of the message transmission method performed by the first network device in fig. 3.

In another embodiment of the present application, there is also provided a computer program product comprising computer-executable instructions stored in a computer-readable storage medium; when the processor of the device executes the computer-executable instructions, the device performs the steps of the message transmission method performed by the second network device in fig. 3.

It will be clear to those skilled in the art that, for convenience and brevity of description, specific working procedures of the above-described systems, apparatuses and units may refer to corresponding procedures in the foregoing method embodiments, which are not repeated herein.

In the several embodiments provided in the present application, it should be understood that the disclosed systems, devices, and methods may be implemented in other manners. For example, the apparatus embodiments described above are merely illustrative, e.g., the division of the units is merely a logical function division, and there may be additional divisions when actually implemented, e.g., multiple units or components may be combined or integrated into another system, or some features may be omitted or not performed. Alternatively, the coupling or direct coupling or communication connection shown or discussed with each other may be an indirect coupling or communication connection via some interfaces, devices or units, which may be in electrical, mechanical or other form.

The units described as separate units may or may not be physically separate, and units shown as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the units may be selected according to actual needs to achieve the purpose of the solution of this embodiment.

In addition, each functional unit in the embodiments of the present application may be integrated in one processing unit, or each unit may exist alone physically, or two or more units may be integrated in one unit. The integrated units may be implemented in hardware or in software functional units.

The integrated units, if implemented in the form of software functional units and sold or used as stand-alone products, may be stored in a computer readable storage medium. Based on such understanding, the technical solution of the present application may be embodied essentially or in part or all of the technical solution or in part in the form of a software product stored in a storage medium, including instructions for causing a computer device (which may be a personal computer, a server, or a network device, etc.) to perform all or part of the steps of the method according to the embodiments of the present application. And the aforementioned storage medium includes: a U-disk, a removable hard disk, a read-only memory (ROM), a random-access memory (RAM, random access memory), a magnetic disk, or an optical disk, or other various media capable of storing program codes.

Claims

1. A method for transmitting a message, comprising:

A first network device serving as a root node receives a first data message from a second network device, wherein the first data message comprises a Multicast binding segment identification (Multicast BSID);

The first network device obtains a parameter set according to the Multicast BSID, and obtains a second data message based on the first data message and the parameter set, wherein the second data message comprises a parameter set, and the parameter set is used for indicating to send the second data message to the network device serving as a leaf node;

The first network device sends the second data message to the network device serving as a leaf node.

2. The method of claim 1, wherein the first network device obtaining a parameter set from the Multicast BSID, the second data message based on the first data message and the parameter set comprising:

the first network device obtains the parameter set according to the Multicast BSID and a first corresponding relation, wherein the first corresponding relation comprises the Multicast BSID and the parameter set;

The first network device obtains the second data message based on the first data message and the parameter set.

3. The method of claim 1, wherein the first network device obtaining a parameter set from the Multicast BSID, the second data message based on the first data message and the parameter set comprising:

The first network device obtains an identifier according to the Multicast BSID and a first corresponding relation, wherein the identifier is used for identifying a Multicast tree to which the network device serving as a leaf node belongs, and the first corresponding relation comprises the Multicast BSID and the identifier;

the first network device obtains the parameter set according to the identifier and a second corresponding relation, wherein the second corresponding relation comprises the identifier and the parameter set;

4. A method according to any one of claims 1 to 3, wherein the parameter set comprises a string of bits, the set bits in the string of bits corresponding to the network device as a leaf node; or alternatively

The parameter set includes SID list including information indicating the network device as a leaf node.

5. The method of claim 2, wherein the first network device acting as the root node, prior to receiving the first data message from the second network device, further comprises:

The first network device determines the parameter set according to a multicast tree to which the network device serving as a leaf node belongs;

the first network device obtains the first corresponding relation according to the parameter set;

The first network device obtains a second corresponding relation according to the first corresponding relation, wherein the second corresponding relation comprises the Multicast BSID and an identifier, and the identifier is used for identifying a Multicast tree to which the parameter set belongs.

6. The method of claim 5, wherein after the first network device obtains a second correspondence from the first correspondence, the method further comprises:

and the first network equipment sends the second corresponding relation to the second network equipment.

7. A method according to claim 3, wherein before the first network device acting as the root node receives the first data message from the second network device, the method further comprises:

The first network equipment acquires the second corresponding relation according to the parameter set;

the first network device obtains the first corresponding relation according to the identification in the second corresponding relation.

8. The method of claim 7, wherein after the first network device obtains the first correspondence from the identifier in the second correspondence, the method further comprises:

the first network device sends the first corresponding relation to the second network device.

9. A method for transmitting a message, comprising:

the second network equipment receives a multicast message from a multicast source, wherein the multicast message comprises multicast source group information;

The second network device obtains a first data message based on the Multicast message, wherein the first data message comprises a Multicast binding segment identifier multi cast BSID corresponding to the Multicast source group information, and the multi cast BSID has an association relation with a Multicast leaf node to be transmitted by the Multicast source;

The second network device sends the first data message to a first network device serving as a root node.

10. The method of claim 9, wherein prior to the second network device receiving the multicast message from the multicast source, the method further comprises:

the second network device receives a first corresponding relation from the first network device, the first corresponding relation includes the Multicast BSID and an identifier, the identifier is used for identifying a Multicast tree to which the network device serving as a leaf node belongs, and the Multicast source group information includes the identifier.

11. A device for transmitting a message, where the device is configured to a first network device that is a root node, and includes:

a receiving unit, configured to receive a first data packet from a second network device, where the first data packet includes a Multicast binding segment identifier Multicast BSID;

An obtaining unit, configured to obtain a parameter set according to the Multicast BSID, and obtain a second data packet based on the first data packet and the parameter set, where the second data packet includes a parameter set, and the parameter set is used to instruct sending the second data packet to a network device that is a leaf node;

And the sending unit is used for sending the second data message to the network equipment serving as the leaf node.

12. The apparatus according to claim 11, wherein the acquisition unit is specifically configured to:

Obtaining the parameter set according to the Multicast BSID and a first corresponding relation, wherein the first corresponding relation comprises the Multicast BSID and the parameter set;

And acquiring the second data message based on the first data message and the parameter set.

13. The apparatus according to claim 11, wherein the acquisition unit is specifically configured to:

Obtaining an identifier according to the Multicast BSID and a first corresponding relation, wherein the identifier is used for identifying a Multicast tree to which the network equipment serving as a leaf node belongs, and the first corresponding relation comprises the Multicast BSID and the identifier;

obtaining the parameter set according to the identification and a second corresponding relation, wherein the second corresponding relation comprises the identification and the parameter set;

14. The apparatus according to any of claims 11 to 13, wherein the parameter set comprises a bit string, the set bit in the bit string corresponding to the network device as a leaf node; or alternatively

15. The apparatus of claim 12, wherein the acquisition unit is further configured to:

determining the parameter set according to a multicast tree to which the network equipment serving as the leaf node belongs;

Acquiring the first corresponding relation according to the parameter set;

And acquiring a second corresponding relation according to the first corresponding relation, wherein the second corresponding relation comprises the Multicast BSID and an identifier, and the identifier is used for identifying a Multicast tree to which the parameter set belongs.

16. The apparatus of claim 15, wherein the transmitting unit is further configured to:

And sending the second corresponding relation to the second network equipment.

17. The apparatus of claim 13, wherein the acquisition unit is further configured to:

acquiring the second corresponding relation according to the parameter set;

And acquiring the first corresponding relation according to the identification in the second corresponding relation.

18. The apparatus of claim 17, wherein the transmitting unit is further configured to:

And sending the first corresponding relation to the second network equipment.

19. A device for transmitting messages, comprising:

a receiving unit, configured to receive a multicast packet from a multicast source, where the multicast packet includes multicast source group information;

An obtaining unit, configured to obtain a first data packet based on the Multicast packet, where the first data packet includes a Multicast binding segment identifier Multicast BSID corresponding to the Multicast source group information, where the Multicast BSID has an association relationship with a Multicast leaf node to be transmitted by the Multicast source;

And the sending unit is used for sending the first data message to the first network equipment serving as the root node.

20. The apparatus of claim 19, wherein the receiving unit is further configured to:

And receiving a first corresponding relation from the first network equipment, wherein the first corresponding relation comprises the Multicast BSID and an identifier, the identifier is used for identifying a Multicast tree to which the network equipment serving as a leaf node belongs, and the Multicast source group information comprises the identifier.