CN115499366A

CN115499366A - Message transmission method and device

Info

Publication number: CN115499366A
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: 2022-12-20
Anticipated expiration: 2041-06-18
Also published as: WO2022262579A1; CN115499366B

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 in the embodiment of the application comprises the following steps: the first network device may obtain a first datagram from a second network device, the first datagram 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 in the first datagram to form a second datagram.

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

Segment routing network protocol version six (segment routing internet protocol version 6, srv 6) is a new generation network protocol (internet protocol, IP) bearer protocol based on network protocol version six (internet protocol version 6, ipv 6) and Segment Routing (SR), and can unify traditional complex network protocols. Nodes in the network can specify a series of operations (actions) in the message, and in the process of forwarding the message in the network, the message is processed at other network nodes along the way according to the specified operations. The operation specified by the segment route can control the forwarding path of the message, and the flow-by-flow state is not required to be maintained at other nodes in the network except the head node. To provide greater scalability, and independence of services, the SR defines a Binding Segment ID (BSID). The BSID is bound to an SR Policy (Policy), which is instantiated as a list of SIDs when a node is specified. Taking an end point (end.b 6. Insert) SID defined by RFC8986 and bound to SRv Policy as an example, a Segment Routing Header (SRH) extension header (containing a corresponding Segment List) is inserted behind an IPv6 header, and a destination address is set as the first SID of SRv Policy, and in addition, each field of an outer IPv6 header is also set, and finally, the new IPv6 packet is subjected to table lookup and forwarding. SR Policy for binding, which has currently defined BSID, cannot be used in multicast scenarios.

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 SRv6 service data which does not support unicast.

A first aspect of the embodiments of the present application provides a packet transmission method, where the method includes: a first network device serving as a root node receives a first data packet from a second network device, wherein the first data packet comprises a Multicast binding segment identifier Multicast BSID; the first network equipment acquires a second data message according to the Multicast BSID, wherein the second data message comprises a parameter set which is used for indicating the second data message to be sent to the network equipment serving as the leaf node; and the first network equipment sends the second data message to the network equipment serving as the leaf node.

In the first aspect, a root node and a leaf node in this embodiment of the present application are nodes in the same multicast tree, a first network device is a root node in the multicast tree, the first network device may obtain 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 a 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 service data passing through a unicast domain, the first network device may convert the service data into multicast transmission, which satisfies a 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 method comprises the steps that a first network device obtains a parameter set according to a 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 foregoing possible embodiment, the first network device stores a first corresponding relationship, where the first corresponding relationship includes an association relationship between a Multicast BSID and a parameter set, that is, the Multicast BSID and the parameter set correspond to each other one by one, and the first network device may match the parameter set from the first corresponding relationship according to the Multicast BSID in the first data packet and encapsulate the parameter set to generate the second data packet, so as to perform Multicast transmission, thereby facilitating a conversion from unicast to Multicast, and improving feasibility of a 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 equipment acquires 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; 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, the first network device stores a first corresponding relationship and a second corresponding relationship, where the first corresponding relationship is an associated 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 associated 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 correspondingly determine the parameter set of the leaf node according to the identifier of the Multicast tree, so as to generate a second data packet by encapsulation, so as to perform Multicast transmission, facilitate conversion from unicast to Multicast, and improve feasibility of the scheme.

In one possible embodiment, the parameter set includes a bit string in which a set bit corresponds to a network device as a leaf node; alternatively, the parameter set includes a SID list including information indicating the network device as a leaf node.

In the above possible embodiment, the multicast tree in which the leaf node is located may be a Bit Index Explicit Replication (BIER) multicast tree, where the BIER multicast tree corresponds to the network device serving as the leaf node by using a set bit in a bit string; alternatively, the multicast tree in which the leaf nodes are located may be a point-to-multipoint (P2 MP) multicast tree, and the parameter set may include a segment identification list including segment identifications or bit strings of the leaf nodes to be transmitted. The parameter set comprises a bit string or segment identification list so that the parameter set can indicate leaf nodes, conversion from unicast to multicast is facilitated, and 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 equipment determines a parameter set according to a multicast tree to which the network equipment serving as the leaf node belongs; the first network equipment acquires a first corresponding relation according to the parameter set, and the first network equipment 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 above possible implementation, before the first network device receives the first data packet, the first network device further needs to establish or update a Multicast tree according to the report message of the leaf node, generate or update a first corresponding relationship, and then store the first corresponding relationship, and the first network device may further determine a corresponding relationship between the Multicast BSID and the Multicast tree to which the parameter set belongs according to the corresponding relationship between the Multicast BSID and the parameter set, that is, may obtain a second corresponding relationship indicating the associated relationship between the Multicast BSID and the identifier. The first network device may generate the second data packet according to the first data packet and the first corresponding relationship, so as to improve feasibility of the scheme.

In a possible implementation manner, after the first network device obtains the first corresponding relationship according to the parameter set in the foregoing step, the method further includes: and the first network equipment sends the second corresponding relation to the second network equipment.

In the above possible implementation, after the first network device determines the second corresponding relationship, since the second network device does not need to sense 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 packet, the Multicast BSID may be determined according to the identifier in the Multicast packet and the stored second corresponding relationship, and the first data packet is generated by encapsulation, 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 equipment determines a parameter set according to a multicast tree to which the network equipment serving as the leaf node belongs; the first network equipment acquires a second corresponding relation according to the parameter set; and the first network equipment acquires the first corresponding relation according to the identifier in the second corresponding relation.

In a possible implementation manner, before the first network device receives the first data packet, the first network device further needs to create or update a multicast tree according to the report message of the leaf node, generate or update the second corresponding relationship according to an identifier of the created or updated multicast tree, generate or update the 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 first network device obtains the first corresponding relationship according to the identifier in the second corresponding relationship in the above step, the method further includes: the first network device sends the first corresponding relation 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 receiving the Multicast packet, the second network device may determine the Multicast BSID according to the first corresponding relationship, and encapsulate and generate the first data packet, thereby improving the feasibility of the scheme.

A second aspect of the present application provides a packet transmission method, 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 identifier (Multicast BSID) corresponding to the Multicast source group information; and the second network equipment sends the first data message to the first network equipment serving as the root node.

In the second aspect, after acquiring the Multicast packet, the second network device may encapsulate the Multicast packet according to the Multicast BSID corresponding to the Multicast source group information in the Multicast packet to generate a first data packet, and send the first data packet to the first network device, where the first network device is a root node of a Multicast tree, and the packet of the Multicast source is converted from a unicast domain, which satisfies 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 in the above step, the method further includes: the second network device receives a first corresponding relation from the first network device, the first corresponding relation includes a 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 an identifier.

In the possible embodiment, the second network device stores a first corresponding relationship from the first network device, where the first corresponding relationship indicates an association relationship between Multicast BSID and an 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 the feasibility of the scheme.

In a possible implementation manner, before the second network device receives the multicast packet from the multicast source in the above step, the method further includes: the second network device receives a first corresponding relation from the first network device, the first corresponding relation includes a 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.

In the possible embodiment, the second network device does not need to sense a parameter set, and only stores the first corresponding relationship from the first network device, where the first corresponding relationship indicates an association relationship between a Multicast BSID and an 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 generate the first data packet in a encapsulated manner, and improve feasibility of the solution.

A third aspect of the present embodiment provides a packet transmission apparatus, where the apparatus 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 a Multicast BSID, where the second data packet includes a parameter set, and the parameter set is used to instruct a network device serving as a leaf node to send the second data packet; and the sending unit is used for sending the second data message to the network equipment as the leaf node.

The apparatus is adapted to perform the method of the first aspect or any one of the embodiments of the first aspect.

A fourth aspect of the embodiments of the present application provides a device for packet transmission, including: 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 a Multicast packet, where the first data packet includes a Multicast binding segment identifier (Multicast BSID) corresponding to Multicast source group information; a sending unit, configured to send a first data packet to a first network device serving as a root node.

The apparatus is adapted to perform the method of the second aspect or any one 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 to cause a communication device to perform the method provided by the first aspect or any of the alternatives of the first aspect, and a communication interface for receiving or transmitting an indication. For specific details of the communication device provided by the fifth aspect, reference may be made to the first aspect or any optional manner of the first aspect, and details are not described here.

A sixth aspect of the embodiments of the present application provides a communication device, including: a processor for executing instructions stored in the memory to cause the communication device to perform the method provided by the second aspect or any of the alternatives of the second aspect, and a communication interface for receiving or transmitting the indication. For specific details of the communication device provided by the sixth aspect, reference may be made to the second aspect or any optional manner of the second aspect, which is not described herein again.

A seventh aspect of embodiments of the present application provides a computer-readable storage medium, which stores a program, and when the computer executes the program, the computer performs the method provided in the first aspect or any one of the alternatives of the first aspect.

An eighth aspect of embodiments of the present application provides a computer-readable storage medium, which stores a program, and when the computer executes the program, the computer performs the method provided in the second aspect or any of the alternatives of the second aspect.

A ninth aspect of embodiments of the present application provides a computer program product, which when executed on a computer, executes the method provided in the first aspect or any one of the alternatives of the first aspect.

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

Drawings

Fig. 1 is a schematic diagram of message transmission in a unicast manner and a multicast manner 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 the embodiment of the present application;

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

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

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

fig. 7 is a schematic structural diagram of a message transmission apparatus according to an embodiment of the present application;

fig. 8 is another schematic structural diagram of a message transmission apparatus 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 structural diagram of another 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 do not support unicast.

Embodiments of the present application will now be described with reference to the accompanying drawings, and it is to be understood that the described embodiments are merely illustrative of some, but not all, embodiments of the present application. As can be known to those skilled in the art, with the development of technology and the emergence of new scenarios, the technical solution provided in the embodiments of the present application is also applicable to similar technical problems.

The terms "first," "second," and the like in the description and in the claims of the present application and in the above-described drawings are used for distinguishing between similar elements and not necessarily for describing a particular sequential or chronological order. It will be appreciated that the data so used may be interchanged under appropriate circumstances such that the embodiments described herein may be implemented in other sequences than those illustrated or 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 exclusively 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.

Furthermore, in the following detailed description, numerous specific details are set forth in order to provide a better understanding of the present 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, methods, means, elements and circuits that are well known to those skilled in the art have not been described in detail so as not to obscure the present application.

Hereinafter, some terms in the present application are explained to facilitate understanding by those skilled in the art.

Segment Routing (SR): is a protocol designed based on the concept of source routing to forward packets in a network. SR divides the network path into segments, and assigns Segment IDs (SID) to the segments and network nodes, and by arranging the SIDs in order, a SID List (also called label stack in SR-MPLS) can be obtained, where the SID List can indicate a forwarding path. Through the SR technology, the node and the path through which the data packet carrying the SIDList passes can be specified, so that the requirement of traffic optimization is met. An analogy is made that the data packet can be compared to the baggage, the SR can be compared to the tag attached to the baggage, and if the baggage is to be sent from area a to area D, on the way to area B and area C, the baggage can be attached to area a at the origin "first to area B, then to area C and finally to area D", so that each area only needs to identify the tag on the baggage and forward the baggage from one area to another according to the tag of the baggage. In the SR technique, a source node adds a label to a packet, and an intermediate node may forward the packet to a 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 packet, the packet will be forwarded to the node corresponding to SID1, then to the node corresponding to SID2, and then to the node corresponding to SID 3. Among them, SR-MPLS is called segmented Routing Multi-Protocol Label Switching (Segment Routing Multi-Protocol Label Switching) in Chinese and English.

Segment routing based on Internet Protocol Version 6 (Internet Protocol Version 6, ipv 6) (SRv): refers to the application of SR technology in IPv6 networks. The IPv6 address (128 bits) is used as a representation of the SID. When forwarding a packet, a network device supporting SRv queries a local segment identifier table (local SID table) according to a Destination Address ((Destination Address, DA) in the packet, and when the Destination Address of the packet matches any SID in the local segment identifier table longest, executes an operation corresponding to a policy associated with the SID in the local segment identifier table, for example, may forward the packet from an egress interface corresponding to the SID); if the destination address of the data packet is not matched with each SID in the local segment identification table in the longest way, searching the forwarding table of IPv6 again, and forwarding in the longest way according to the forwarding table of IPv 6.

The different nodes in the SRv network may be connected by 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.xsid, end indicates endpoint, means End point; X indicates cross, means three-layer cross-connect, and SID means segment identifier), each end.x 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.x SIDs issued by each other. When a data packet enters a SRv network, a head node receives the data packet, determines a forwarding path of the data packet, and in a possible implementation, the head node may obtain an end.x SID corresponding to a link of each IP layer according to each IP layer link that the forwarding path needs to pass through, writes the obtained end.x SID into the data packet, and then sends the data packet carrying the end.x SID to a next node. When any node receives a 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 from an IP layer output interface bound by the end.X SID, so that the data packet can reach the next node through an IP layer link corresponding to the IP layer output interface, and the next node continues to forward the data packet by executing similar steps until the data packet reaches a destination node. In another possible implementation, the head node may obtain an End segment identifier (End SID, where End represents endpoint and SID means segment identifier) corresponding to each node according to each node that the forwarding path needs to pass through, 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 the End SID carried by the data packet, and sends the data packet to the node corresponding to the End SID, so that the data packet reaches the node corresponding to the End SID, and by so forth, each node continues to forward 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 a part of nodes on the path, not all nodes. End.x and END, and other SRv6 Functions may also be used in combination.

Segment Routing Header (SRH): the IPv6 message consists of an IPv6 standard header, an extension header (0.. N) and a load Payload. In order to implement SRv based on IPv6 forwarding plane, an IPv6 extension header, called SRH extension header, is newly added, which specifies an explicit path of IPv6, and stored is Segment List information of IPv6, which has the same function as Segment List in SR MPLS. The head node adds an SRH extension head in the IPv6 message, and the intermediate node can forward the message according to the path information contained in the SRH extension head.

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

Head Node (Head Node): and the starting node of the SR forwarding path is responsible for encapsulating the segment identifier.

In the Bit Index Explicit Replication (BIER) technique, a bit string (BitString) in a BIER message is used to instruct a network device to replicate a multicast message to a specified receiver. The BIER packet encapsulates the BIER header, and carries BitString therein, where each bit in BitString represents a receiver. The intermediate node does not sense the state of the multicast group and only completes the copy and the forwarding of the message according to the BitString.

In the BIER multicast protocol, 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 a domain that support BIER forwarding capability are called Bit Forwarding Routers (BFRs). When the BFR is used as an ingress router of the BIER domain, the BFR is a Bit Forwarding Ingress Router (BFIR). When it is used as an egress router of the BIER domain, this BFR is a Bit Forwarding Egress Router (BFER). BFIR and BFER also have a common name-edge BFR, which is also a source node or destination node in the BIER domain. The edge BFR has a proprietary BIER forwarding router 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 configure a unique value of 1 to 256, a destination node set is represented by a 256-Bit (or 32-byte) BitString, and the position or index of each Bit in the BitString represents an edge node.

In the field of unicast forwarding, the technology SRv based on the IPv6 data plane is developed rapidly, and the momentum is surpassed the SR-MPLS using the MPLS data plane. In the multicast field, how to apply BIER architecture and encapsulation and realize a technology which does not depend on MPLS and conforms to the development trend of the IPv6 network becomes a problem to be solved urgently. Against this background, the industry has proposed a Bit Index Explicit Replication (BIERv 6) technique for IPv6 encapsulation. BIERv6 inherits the core design concept of BIER, and copies the multicast message to the designated receiver by using BitString, and the intermediate node does not need to establish a multicast forwarding tree, thereby realizing stateless forwarding.

Multicast, also known as multicast, is able to efficiently solve point-to-multipoint transmission and distribution problems as opposed to unicast (unicast) and broadcast (broadcast). In a multicast scenario, data may be sent to a group of users along a particular path, with at most one copy of the same multicast data on each link. For example, for some services such as Internet Protocol Television (IPTV), the content of messages sent by a server to different users is the same, please refer to fig. 1, which is a schematic diagram of message sending in a unicast mode and a multicast mode provided in this embodiment of the present application shown in fig. 1, where in the unicast mode, the server copies the messages to different users and then sends the copied messages to the corresponding users respectively; in the multicast mode, the server only needs to send a message to each downstream routing device joining the multicast group, and then the routers at each level copy the message with the device granularity and send the message to the corresponding users. Therefore, for an upstream network above the access point, the multicast mode can obviously reduce the message duplication 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 root nodes, intermediate nodes, and leaf nodes. The intermediate nodes may refer to nodes other than the edge nodes, such as node B and node C in fig. 2. The edge nodes may include a root node and a leaf node. Node a is the root node. Node D, node E and node F are leaf nodes. When node E, which is a leaf node, also acts as an intermediate node, the transmission path between node E and node C may replace the transmission path between node B and 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 (bud) node. The structure of the multicast tree shown in fig. 2 is merely exemplary and is not intended to limit the present application.

The forwarding process of the multicast data message comprises the following steps: the root node of the multicast tree receives a multicast data message sent by a multicast source, and the root node sends the multicast data message to leaf nodes of the multicast tree. And the root node forwards the multicast data message to a downstream node. The downstream node of a certain node refers to a next hop node of the certain node on a transmission path in the direction from the root node to the leaf node in the multicast tree. And if the downstream node of the root node is the 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. And if the multicast tree has the bud node, the bud node sends the multicast data message to the downstream node of the bud node, and sends the copied multicast data message through a local port. As shown in fig. 2, node a sends a multicast data packet from a multicast source to node B downstream of node a. And the node B copies the multicast data message and respectively sends the multicast data message to a downstream node E and a downstream node C. And the node C copies the multicast data message and respectively sends the multicast data message to the nodes F and D at the downstream. And the node F and the node D can respectively send the multicast data message through respective local ports. When the node E is a bud node, the node E may copy the multicast data packet, and send a multicast data packet through its local port and a port capable of communicating with the downstream node C, respectively.

The SR-defined BSID is bound to an SR policy, instantiated as a list of SIDs at a given node. Any received message whose current segment is a BSID will be bound to an SR Policy (Policy). Taking an end point (end.b 6. Insert) SID defined by RFC8986 and bound to SRv Policy as an example, a Segment Routing Header (SRH) extension Header (containing a corresponding Segment List) is inserted behind an IPv6 Header, and a destination address is set as the first SID of SRv Policy, and in addition, each field of an outer IPv6 Header is also set, and finally, the new IPv6 packet is subjected to table lookup and forwarding. However, the SR Policy for binding by BSID that has been defined currently is a unicast path and cannot be used in a multicast scenario.

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

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

301. and the multicast source sends the multicast message to the second network equipment.

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

Multicast refers to sending a data packet to a certain node set (i.e. a multicast group) in an IP network, and the basic idea is as follows: the source host (namely the multicast source) only sends one piece of data, and the destination address of the source host is a multicast group address; all receivers in the multicast group can receive the same data copy, and only hosts in the multicast group can receive the data, while other hosts cannot receive the data.

In the embodiment of the present application, a data packet that a multicast source (multicast source) wants to transmit to a multicast tree needs to pass through an SR domain, where the SR domain may be a unicast domain or a multicast domain, where the SR domain may be a SRv domain, and for an SR policy bound to a BSID in a SRv domain, the SR policy is a unicast path only, and then the data packet from the multicast source needs to pass through the unicast domain and then reach the multicast domain. In this embodiment, taking a packet from unicast to Multicast as an example, please refer to fig. 4, where fig. 4 is a scenario of packet transmission provided in the embodiment of the present invention, a data packet from a Multicast source passes through a header Node (Ingress Node) in an SR/SRv domain, then passes through a Multicast instantiation Node (Multicast Initiation Node), and is copied and transmitted to a Multicast leaf Node (leaf Node) through an intermediate 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 the multicast packet intended for the multicast leaf node to the head node, and the head node transmits the multicast packet to the multicast leaf node. Wherein, the multicast message also includes multicast source group information indicating multicast leaf nodes.

302. The second network equipment acquires the first data message based on the multicast message.

In this embodiment of the present application, after receiving the Multicast packet, the head node may obtain the Multicast source group information, and determine a Multicast binding segment identifier (Multicast BSID) according to the Multicast leaf node indicated by the Multicast source group information. The head node may encapsulate the multicast binding segment identifier into the multicast packet to form a first data packet. When a multicast message enters the SRv domain, the head node encapsulates the message by the SRv extension head, and converts the message into the SRv message. 5363 the message header of SRv includes an IPv6 header and SRv extension header. The Source Address (SA) field in the IPv6 header is set to the routable IPv6 unicast address. A Destination Address (DA) field in the IPv6 header is set to the address of the next hop node. And SRv SRH in the extension header includes a plurality of SIDs that may indicate a transmission path of the first data packet, where a 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 as shown in table 1 below.

IPv6
	SRH
Payload

TABLE 1

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

In this embodiment of the present application, after the head node obtains the first data packet, the head node may transmit the first data packet according to the address of the next hop node in the IPv6 head, specifically, a plurality of nodes may be provided between the head node and the multicast instantiation node, and the node between the head node and the multicast instantiation node only performs forwarding work until the first data packet is sent to the multicast instantiation node indicated by the last SID in the SRH.

304. And the first network equipment acquires the second data message according to the Multicast BSID.

In this embodiment of the present application, after receiving the first data packet, the Multicast instantiation node may obtain a Multicast binding segment identifier in the first data packet, and then determine a parameter set corresponding to the Multicast binding segment identifier according to the Multicast binding segment identifier, that is, a Multicast encapsulation header (Multicast Encap) may be inserted 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 may indicate to send the second data packet to a network device serving as a 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 first network device may obtain the second data packet according to the Multicast binding segment identifier in a manner that the first network device obtains the parameter set according to the Multicast BSID and the first corresponding relationship; 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 corresponding relationship, where the first corresponding relationship includes the multicast binding segment identifier and the parameter set, and the multicast binding segment identifier and the parameter set are in one-to-one correspondence. That is, after acquiring 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 the Multicast Encap layer header of the second packet. The first correspondence may be as shown in table 3 below. The multicast binding segment identifier 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

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 the first corresponding relationship according to the parameter set, and the first network device can also obtain the second corresponding relationship according to the first corresponding relationship. 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 the parameter set included in the multicast tree according to the multicast tree that is created or updated, and then configure a multicast binding segment identifier for the parameter set of each multicast tree and store the identifier in the first corresponding relationship. The multicast instantiation node can also determine a second corresponding relation according to the identifier of the multicast tree to which the parameter set belongs, wherein the second corresponding relation comprises the association relation between the identifier and the multicast binding segment. The second correspondence relationship may refer to table 4 below, where the multicast binding segment identifier includes M-BSID-A, M-BSID-B and M-BSID-C, and the identifier includes a multicast TREE a (M-TREE-a), a multicast TREE B (M-TREE-B), and a 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
		M-BSID-A	M-TREE-A
M-BSID-B	M-TREE-B
		M-BSID-C	M-TREE-C

TABLE 4

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

Optionally, the first network device may obtain the second data packet according to the Multicast binding segment identifier, and obtain the identifier according to the Multicast BSID and the first corresponding relationship; 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 corresponding relationship and a second corresponding relationship, where the first corresponding relationship includes the multicast binding segment identifier and the identifier, and the multicast binding segment identifier and the identifier correspond to each other one to one. The identification may indicate a multicast tree to which the network device that is a leaf node belongs. Namely, after the multicast instantiation node acquires the multicast binding segment identifier, the multicast tree to be transmitted by the message can be determined. The second correspondence relationship may include the identifier and the parameter set, and the identifier and the parameter set are in one-to-one correspondence. After determining the multicast tree, the multicast instantiation node may match a corresponding parameter set in the second correspondence to generate the second data packet. 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 multicast TREE identifier comprises a multicast TREE A (M-TREE-A), a multicast TREE B (M-TREE-B) and a multicast TREE C (M-TREE-C), and the parameter sets comprise a parameter set A, a parameter set B and a 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	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; and the first network equipment acquires the first corresponding relation according to the identifier in the second corresponding relation. Specifically, the network device serving as a leaf node may report, to the multicast instantiation node, the multicast tree to which the network device belongs, so that each multicast tree may be allocated with one identifier for distinguishing, the multicast instantiation node may determine, according to the multicast tree that is constructed or updated, a parameter set included in the multicast tree, and then each identifier corresponds to one parameter set, and the association relationship may be stored in the first correspondence relationship, and then the multicast instantiation node may configure a multicast binding segment identifier for the identifier of each multicast tree and store the identifier in the second correspondence 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 only the second corresponding relation needs not to be received, and when receiving the multicast message, the head node can determine the multicast binding segment identifier according to the identifier of the multicast tree 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 segment identifier to generate the first data message.

305. And the first network equipment sends the second data message to the network equipment serving as the leaf node.

In this embodiment, after generating the second data packet by encapsulating the first data packet, the multicast instantiation node may send the second data packet to the network device serving 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; alternatively, the parameter set may include a SID list.

Specifically, when the parameter set includes a bit string, the multicast tree is a BIERv6 multicast tree, the message transmission domain in which the multicast tree is located is a BIERv6 domain, and a set bit in the bit string corresponds to a network device serving as a leaf node, and an exemplary BIERv6 multicast tree includes A, B, C and D4 leaf nodes. When the node a is an edge node receiving the second data packet, 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 packet, the bit string corresponding to the parameter set may be represented as 0010. When node C is an edge node that receives the second data packet, the bit string corresponding to the parameter set may be represented as 0100. When node D is an edge node that receives the second datagram, 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 packet, the bit string corresponding to the parameter set may be represented as 1010. In the process of establishing the multicast tree, nodes A, B, C and D advertise respective bit positions to respective upstream nodes via a tree-building protocol. The upstream node of a certain node is the previous 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 the nodes A, B, C and D, the multicast instantiation node acquires and stores the bit positions of the nodes A, B, C and D. After the multicast instantiation node receives the first data message, it can determine that the second data message needs to be sent to the nodes B and C according to the determined bit string in the parameter set as 0110. And the multicast instantiation node acquires the BIER message according to the bit string and the first data message. The BIER message comprises a BIER head and the multicast data message. The BIER header includes a bit string of 0110. The multicast instantiation node sends the BIER message to a next-hop node (intermediate node).

The BIERv6 network defines a new type of SID, called end. Bier address, which serves as the BIERv6 extension header in the forwarding plane processing messages of IPv6 destination address indication devices. When each node receives and processes the BIERv6 message, the end.BIER SID of the next hop node is encapsulated into an outer IPv6 destination address of the BIERv6 message (the destination node of the first data message is defined by a bit string), so that the next hop node forwards the message according to the BIERv6 flow.

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

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

In a possible implementation manner of the P2MP packet header, the SID in the SRH may be expanded, two fields, namely, a number of Branches (N-Branches) and a number of subtree middle segment identifiers (N-SIDs), are defined, and the SID of the next branch node and the SID of the corresponding subtree may be located; after receiving the second data message, the intermediate node copies the message and only keeps the SID of the present bifurcation node and the SID of the corresponding sub-tree, and the SIDs of other sub-trees are removed from the segment list of SRH. Exemplarily, as shown in fig. 5, a schematic diagram of P2MP multicast provided in the embodiment of the present application, and as shown in fig. 5, the P2MP multicast tree includes: the multicast tree comprises a head node R-M, intermediate nodes P1-M, P2-M, P3-M, P4-M and leaf nodes L1-M, L2-M, L3-M and L4-M, wherein the multicast tree comprises 4 links, and messages output by the R-M are transmitted to the L1-M through the P1-M and the P2-M; the message output by the R-M is transmitted to the L2-M through the P1-M and the P2-M; the message output by the R-M is transmitted to the L3-M through the P1-M, P-M and the P4-M; the message output by the R-M is transmitted to the L4-M through the P1-M, P-M and the P4-M. The SID of the intermediate Node and the leaf Node in the Multicast tree may refer to table 6 below, where a Multicast Node SID Locator may identify the location of the Node, and the Multicast Node SID Block may be used as a prefix, and combined with the Node-X-ID to form the Multicast Node SID Block.

TABLE 6

In another possible implementation of the P2MP packet header, SID in SRH may be expanded, and a Pointer (Pointer) field is added to each SID, so that nodes in a path can be divided according to a hierarchy, and a next-level node associated with the node is designated at the same time. Specifically, the multicast tree is divided according to the hierarchy according to the replication relationship, all nodes in the multicast tree are coded in the messages in the form of hierarchy, the hierarchy is arranged from low to high, the nodes on the same layer are coded together, and the messages with the same father node are coded together. Each parent node points to the position of the copied child node in the SRH, and specifically, in expanding the SID of SRv, the Locator (for routing to the parent node) is unchanged; the Function is extended to Hierarchical and is used for indicating the related functions of the new multicast/multipath, such as copying, deleting redundant messages, load balancing, main and standby protection and the like. The extension of the archive is Pointer which is used for indicating the position of the next child node in the SRH after the father node is copied; the pointers comprise Pointer1 and Pointer2 and have two coding forms, 1) the Pointer1 indicates the initial Segment Left (SL) value of the child node and the Pointer2 indicates the offset value; 2) Pointer1 indicates the initial segment left value of the child node and Pointer2 indicates the end segment left value. The spreading format in which the SID is spread may be as shown in table 7 below.

TABLE 7

Illustratively, as shown in fig. 6, which is a schematic diagram of an SID expansion application provided in the present application, for an exemplary multicast tree, a head node of the multicast tree is a, and child nodes of node a (SL = 0) include node B (SL = 1) and node C (SL = 2), child nodes of node B include node B1 (SL = 3), node B2 (SL = 4) and node B3 (SL = 5), and child nodes of node C include node C1 (SL = 6), node C2 (SL = 7) and node C3 (SL = 8). Then, in the message sent from node a, the Pointer is SL =1-2, in the message sent from node B, the Pointer is SL =3-5, and in the message sent from node C, the Pointer is SL =6-8, and correspondingly, in the messages sent from nodes B1, B2, B3, C1, C2, and C3, the Pointer is SL =0.

In order to solve the problems that the current P2MP explicit path depends on a controller, the coding efficiency is low, and the like, in another possible implementation manner of the P2MP message header, an SRH/RH is extended, and a new Segment type and a corresponding Function are defined for more efficient P2MP coding. Wherein, a new Segment-Bitstring Segment is defined, and the Bitstring Segment comprises two parts: pointer and Bitstring, wherein: a Pointer: segment start positions corresponding to the child nodes; bitstring: and the adjacent link (Adjacency) is used for carrying and indicating the forwarding of the message after the message is copied.

The format of the packets sent from the nodes A, B and C in the multicast tree in fig. 6 can be referred to as the following table 8.

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

TABLE 8

The packet transmission in this embodiment of the present application may also be from a multicast domain to a multicast domain, specifically, may be transmission from a branch in a multicast tree to a sub-tree, or transmission between different multicast trees, and this embodiment takes transmission from a branch in a multicast tree to a sub-tree as an example, and exemplarily, with reference to fig. 5, in a multicast tree taking P1-M as a root node, the present application further includes a sub-tree taking P2-M as a root node and a sub-tree taking P4-M as a root node, and takes a sub-tree taking P4-M as a root node as an example, then the first network device of the present application may be a node P4-M, the second network device may be a node P3-M, and the network devices serving as leaf nodes may be L3-M and L4-M. Specifically, the node P4-M stores a correspondence (a first correspondence and/or a second correspondence) including parameter sets indicating the L3-M and the L4-M, and after receiving a first data packet from the node P3-M, the node P4-M encapsulates the parameter sets into the first data packet according to the correspondence to generate a second data packet, and transmits the second data packet according to the parameter sets.

The above describes a message transmission method, and a device for transmitting a message according to an embodiment of the present application is described below with reference to the accompanying drawings. Fig. 7 is a schematic diagram of an embodiment of an apparatus 70 according to an embodiment of the present application. The apparatus 70 may be disposed 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 message transmission apparatus, where the apparatus 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 a Multicast BSID, where the second data packet includes a parameter set, and the parameter set is used to instruct a network device serving as a leaf node to send the second data packet;

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

Optionally, the obtaining unit 702 is specifically configured to: obtaining a parameter set according to a 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 obtaining unit 702 is specifically configured to: acquiring an identifier according to the Multicast BSID and a first corresponding relation, wherein the identifier is used for identifying a Multicast tree to which network equipment 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 identifier and a second corresponding relationship, wherein the second corresponding relationship comprises the identifier 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 set bit in the bit string corresponds to the network device serving as the leaf node; alternatively, the parameter set includes a 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 network equipment 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 the Multicast tree to which the parameter set belongs. The sending unit 703 is further configured to send the second correspondence to the second network device.

Optionally, the obtaining unit 702 is further configured to: determining a parameter set according to a multicast tree to which network equipment 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 identifier in the second corresponding relation. The sending unit 703 is further configured to send the first corresponding relationship to the 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 disposed 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 message transmission apparatus, where the apparatus includes:

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

an obtaining unit 802, configured to obtain a first data packet based on a 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 the first data packet to the first network device serving as the root node.

Optionally, the receiving unit 801 is further configured to: receiving a first corresponding relation from a first network device, where the first corresponding relation includes a Multicast BSID and an identifier, where the identifier is used to identify a Multicast tree to which the network device serving as a leaf node belongs, and the Multicast source group information includes the identifier.

Optionally, the receiving unit 801 is further configured to: receiving a first corresponding relation and a second corresponding relation from a first network device, 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 device serving as a leaf node belongs, and the Multicast source group information comprises the identifier.

Fig. 9 is a schematic diagram illustrating a possible logical structure of a communication device 90 according to an embodiment of the present application. The communication device 90 includes: a processor 901, a communication interface 902, a storage system 903, and a bus 904. The processor 901, the communication interface 902, and the storage system 903 are connected to each other by a bus 904. In the 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 execute the steps performed by the first network device in the method embodiment of fig. 3. The communication interface 902 is used to support communication with the communication device 90. A storage system 903 for storing program codes and data for the communication device 90.

The processor 901 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 illustrative logical blocks, modules, and circuits described in connection with the disclosure. The processor 901 may also be a combination of computing functions, e.g., comprising one or more microprocessors in combination, a digital signal processor and a microprocessor in combination, or the like. The bus 904 may be a Peripheral Component Interconnect (PCI) bus, an Extended Industry Standard Architecture (EISA) bus, or the like. The bus may be divided into an address bus, a data bus, a control bus, etc. For ease of illustration, only one thick line is shown in FIG. 9, but this does not indicate only one bus or one type of bus.

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

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

Fig. 10 is a schematic diagram illustrating a possible logical 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 the embodiment of the present 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 execute the steps performed by the second network device in the method embodiment of fig. 3. The communication interface 1002 is used to support communication by the communication device 100. A storage system 1003 for storing program codes and data of the communication apparatus 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 illustrative logical blocks, modules, and circuits described in connection with the disclosure. The processor 1001 may also be a combination of computing functions, e.g., comprising one or more microprocessors in combination, a digital signal processor and a microprocessor in combination, or the like. The bus 1004 may be a Peripheral Component Interconnect (PCI) bus, an Extended Industry Standard Architecture (EISA) bus, or the like. The bus may be divided into an address bus, a data bus, a control bus, etc. For ease of illustration, only one thick line is shown in FIG. 10, but this is not intended to represent only one bus or type of bus.

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

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

In another embodiment of the present application, a computer-readable storage medium is further provided, where a computer executing instruction is stored in the computer-readable storage medium, and when a processor of the device executes the computer executing instruction, the device executes the steps of the message transmission method executed by the first network device in fig. 3.

In another embodiment of the present application, a computer-readable storage medium is further provided, where a computer executing instruction is stored in the computer-readable storage medium, and when a processor of the device executes the computer executing instruction, the device executes the steps of the message transmission method executed 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 is clear to those skilled in the art that, for convenience and brevity of description, the specific working processes of the above-described systems, apparatuses and units may refer to the corresponding processes in the foregoing method embodiments, and are not described herein again.

In the several embodiments provided in the present application, it should be understood that the disclosed system, apparatus and method may be implemented in other manners. For example, the above-described apparatus embodiments are merely illustrative, and for example, the division of the units is only one logical division, and other divisions may be realized in practice, for example, a plurality of units or components may be combined or integrated into another system, or some features may be omitted, or not executed. In addition, the shown or discussed mutual coupling or direct coupling or communication connection may be an indirect coupling or communication connection through some interfaces, devices or units, and may be in an electrical, mechanical or other form.

The units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one position, or may be distributed on multiple network units. Some or all of the units can be selected according to actual needs to achieve the purpose of the solution of the embodiment.

In addition, functional units in the embodiments of the present application may be integrated into one processing unit, or each unit may exist alone physically, or two or more units are integrated into one unit. The integrated unit can be realized in a form of hardware, and can also be realized in a form of a software functional unit.

The integrated unit, if implemented in the form of a software functional unit and sold or used as a stand-alone product, may be stored in a computer readable storage medium. Based on such understanding, the technical solution of the present application may be substantially implemented or contributed to by the prior art, or all or part of the technical solution may be embodied in a software product, which is stored in a storage medium and includes instructions for causing a computer device (which may be a personal computer, a server, or a network device) to execute 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), a magnetic disk or an optical disk, and the like.

Claims

1. A method for packet transmission, 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 identifier (Multicast BSID);

the first network equipment acquires 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 that the second data message is sent to network equipment serving as a leaf node;

and the first network equipment sends the second data message to the network equipment serving as the leaf node.

2. The method of claim 1, wherein obtaining, by the first network device, a second data message according to the Multicast BSID comprises:

the first network device obtains the parameter set according to the Multicast BSID and a first corresponding relationship, where the first corresponding relationship includes the Multicast BSID and the parameter set;

and the first network equipment acquires the second data message based on the first data message and the parameter set.

3. The method of claim 1, wherein obtaining, by the first network device, a second data message according to the Multicast BSID comprises:

the first network device obtains an identifier according to the Multicast BSID and a first corresponding relationship, where the identifier is used to identify a Multicast tree to which the network device serving as a leaf node belongs, and the first corresponding relationship includes the Multicast BSID and the identifier;

the first network equipment 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. The method according to any of claims 1 to 3, wherein the parameter set comprises a bit string, the set bits in the bit string corresponding to the network device as a leaf node; alternatively, the first and second electrodes may be,

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

5. The method of claim 2, wherein before the first network device acting as the root node receives the first data packet from the second network device, the method further comprises:

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

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

and the first network equipment 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 the Multicast tree to which the parameter set belongs.

6. The method of claim 5, wherein after the first network device generates the second corresponding relationship according to the first corresponding relationship, the method further comprises:

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

7. The method of claim 3, wherein before the first network device acting as the root node receives the first data packet from the second network device, the method further comprises:

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

and the first network equipment acquires the first corresponding relation according to the identifier in the second corresponding relation.

8. The method of claim 7, wherein after the first network device obtains the first corresponding relationship according to the identifier in the second corresponding relationship, the method further comprises:

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

9. A method for packet transmission, 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 equipment acquires a first data message based on the Multicast message, wherein the first data message comprises a Multicast binding segment identifier (Multicast BSID) corresponding to the Multicast source group information;

and the second network equipment sends the first data message to the first network equipment serving as the root node.

10. The method of claim 9, wherein before the second network device receives the multicast packet from the multicast source, the method further comprises:

the second network equipment receives the second corresponding relation from the first network equipment, the first corresponding relation comprises Multicast BSID and identification, the identification is used for identifying the Multicast tree to which the network equipment as a leaf node belongs, and the Multicast source group information comprises the identification.

11. The method of claim 9, wherein before the second network device receives the multicast packet from the multicast source, the method further comprises:

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

12. An apparatus for packet transmission, the apparatus being disposed in a first network device serving as a root node, and comprising:

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 a network device serving as a leaf node to send the second data packet;

and a sending unit, configured to send the second data packet to the network device serving as the leaf node.

13. The apparatus according to claim 12, wherein the obtaining 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.

14. The apparatus according to claim 12, wherein the obtaining unit is specifically configured to:

acquiring an identifier according to the Multicast BSID and a first corresponding relationship, 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 relationship comprises the Multicast BSID and the identifier;

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

15. The apparatus according to any of claims 12 to 14, wherein the parameter set comprises a bit string, the set bits in the bit string corresponding to the network device as a leaf node; alternatively, the first and second electrodes may be,

16. The apparatus of claim 13, wherein the obtaining unit is further configured to:

determining the parameter set according to the 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 the Multicast tree to which the parameter set belongs.

17. The apparatus of claim 16, wherein the sending unit is further configured to:

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

18. The apparatus of claim 14, wherein the obtaining unit is further configured to:

acquiring the second corresponding relation according to the parameter set;

and acquiring the first corresponding relation according to the identifier in the second corresponding relation.

19. The apparatus of claim 18, wherein the sending unit is further configured to:

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

20. An apparatus for message transmission, 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;

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

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

receiving a first corresponding relation from the first network device, 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 device as a leaf node belongs, and the Multicast source group information comprises the identifier.

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