CN112187648B

CN112187648B - Multicast message forwarding method and device

Info

Publication number: CN112187648B
Application number: CN202010857924.9A
Authority: CN
Inventors: 何文娟
Original assignee: Unihub China Information Technology Co Ltd
Current assignee: Unihub China Information Technology Co Ltd
Priority date: 2020-08-24
Filing date: 2020-08-24
Publication date: 2022-02-15
Anticipated expiration: 2040-08-24
Also published as: CN112187648A

Abstract

The invention discloses a multicast message forwarding method and a device, wherein the method comprises the following steps: the configuration bit index explicitly copies a forwarding path algorithm of the BIER message in the BIER domain; generating a corresponding bit index routing table according to the configured forwarding path algorithm; the mapping relation between the multicast flow and the forwarding path algorithm is issued to a bit forwarding entry router BFIR in the BIER domain, and a bit index routing table of the associated forwarding path algorithm is issued to a bit forwarding router BFR in the BIER domain; encapsulating the forwarding path algorithm into a BIER message by the BFIR; and de-encapsulating the encapsulated BIER message by the BFR, searching a bit index routing table corresponding to the forwarding path algorithm, and forwarding the BIER message according to the searched bit index routing table. The invention can specify the forwarding path of the BIER message in the BIER domain by configuring the forwarding path algorithm of the BIER message in a user-defined way.

Description

Multicast message forwarding method and device

Technical Field

The present invention relates to the field of multicast networks, and in particular, to a multicast packet forwarding method and apparatus.

Background

This section is intended to provide a background or context to the embodiments of the invention that are recited in the claims. The description herein is not admitted to be prior art by inclusion in this section.

A BIER (Bit-Indexed Explicit Replication) technology is a multicast technology that does not need to construct a multicast distribution tree, a Router supporting the BIER technology is called a BFR (Bit-Forwarding Router) node, where a node for encapsulating a BIER packet is called a BFIR (Bit-Forwarding Ingress Router), and a node for decapsulating a BIER packet (i.e., a leaf node) is called a BFER (Bit-Forwarding aggregation Router). After the multicast traffic enters the BIER domain, encapsulating a BIER header at the BFIR node, and by encapsulating a bit string representing an exit router to which the multicast traffic needs to reach in the BIER header, enabling the BFR node to forward the BIER packet according to the bit string. The BIER technology changes the traditional multicast tree-based forwarding mode into a bit identification-based forwarding mode, so that the complexity of protocol processing can be greatly reduced, and the network processing cost is further reduced.

The BIER technology greatly simplifies network processing, but calculates and generates a Bit Index (Bit Index routing Table) based on an SPF (Shortest Path First) algorithm, which may cause unbalanced network traffic and may not specify a Forwarding Path for a specific traffic demand (e.g., traffic demands such as minimum delay or maximum available bandwidth).

In view of the above problems, no effective solution has been proposed.

Disclosure of Invention

The embodiment of the invention provides a multicast message forwarding method, which is used for solving the technical problems that the existing BIER message forwarding method can only support shortest path forwarding and can not meet the requirement of appointing a forwarding path under different business requirements, and the method comprises the following steps: the configuration bit index explicitly copies a forwarding path algorithm of the BIER message in the BIER domain; generating a corresponding bit index routing table according to the configured forwarding path algorithm; the mapping relation between the multicast flow and the forwarding path algorithm is issued to a bit forwarding entry router BFIR in the BIER domain, and a bit index routing table of the associated forwarding path algorithm is issued to a bit forwarding router BFR in the BIER domain; when the multicast flow reaches BFIR, the BFIR encapsulates the forwarding path algorithm into the BIER message; and decapsulating the encapsulated BIER message by the BFR to obtain a forwarding path algorithm, searching a bit index routing table corresponding to the forwarding path algorithm, and forwarding the BIER message according to the bit index routing table corresponding to the forwarding path algorithm.

The embodiment of the invention also provides a multicast message forwarding device, which is used for solving the technical problems that the existing BIER message forwarding method can only support shortest path forwarding and can not meet the requirement of appointing a forwarding path under different business requirements, and the device comprises: the configuration module is used for configuring a forwarding path algorithm for explicitly copying the BIER message in the BIER domain by using the bit index; the routing table generating module is used for generating a corresponding bit index routing table according to the configured forwarding path algorithm; the configuration information issuing module is used for issuing the mapping relation between the multicast flow and the forwarding path algorithm to a bit forwarding entry router BFIR in the BIER domain and issuing a bit index routing table of the associated forwarding path algorithm to a bit forwarding router BFR in the BIER domain; the message encapsulation module is used for encapsulating the forwarding path algorithm into the BIER message by the BFIR when the multicast flow reaches the BFIR; and the message de-encapsulation module is used for de-encapsulating the encapsulated BIER message to obtain a forwarding path algorithm, searching a bit index routing table corresponding to the forwarding path algorithm, and forwarding the BIER message according to the bit index routing table corresponding to the forwarding path algorithm.

The embodiment of the invention also provides computer equipment for solving the technical problems that the existing BIER message forwarding method can only support shortest path forwarding and cannot meet the requirement of appointing a forwarding path under different business requirements.

The embodiment of the invention also provides a computer readable storage medium, which is used for solving the technical problem that the existing BIER message forwarding method can only support shortest path forwarding and cannot meet the requirement of appointing a forwarding path under different business requirements.

In the embodiment of the invention, after a forwarding path algorithm of a BIER message in a BIER domain is copied by a user-defined configuration bit index display, a corresponding bit index routing table is generated according to the configured forwarding path algorithm, the mapping relation between multicast flow and the forwarding path algorithm is issued to a bit forwarding entry router BFIR in the BIER domain, a bit index routing table associated with the forwarding path algorithm is issued to a bit forwarding router BFR in the BIER domain, when the multicast flow reaches the BFIR, the BFIR encapsulates the forwarding path algorithm into the BIER message, the BFR decapsulates the encapsulated BIER message to obtain the forwarding path algorithm, the bit index routing table corresponding to the forwarding path algorithm is searched, the BIER message is forwarded according to the bit index routing table corresponding to the forwarding path algorithm, compared with the technical scheme of forwarding the BIER message based on the shortest path in the prior art, the embodiment of the invention configures the forwarding path algorithm of the BIER message by the user-defined configuration, the forwarding of the BIER message is not only based on the shortest path, but also can randomly specify a forwarding path, so that the multicast service forwarding meeting various requirements is realized by combining the service requirements of TE, SLA and the like.

Drawings

In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below, it is obvious that the drawings in the following description are only some embodiments of the present invention, and for those skilled in the art, other drawings can be obtained according to the drawings without creative efforts. In the drawings:

fig. 1 is a flowchart of a multicast packet forwarding method provided in an embodiment of the present invention;

fig. 2 is a schematic diagram of a multicast network provided in an embodiment of the present invention;

fig. 3 is a schematic diagram of a bit string provided in an embodiment of the present invention;

fig. 4 is a schematic diagram of another multicast network provided in the embodiment of the present invention;

FIG. 5 is a schematic diagram of another bit string provided in the embodiment of the present invention;

fig. 6 is a schematic diagram of a multicast message forwarding apparatus provided in an embodiment of the present invention.

Detailed Description

In order to make the objects, technical solutions and advantages of the embodiments of the present invention more apparent, the embodiments of the present invention are further described in detail below with reference to the accompanying drawings. The exemplary embodiments and descriptions of the present invention are provided to explain the present invention, but not to limit the present invention.

Fig. 1 is a flowchart of a multicast packet forwarding method provided in an embodiment of the present invention, and as shown in fig. 1, the method includes the following steps:

s101, the configuration bit index explicitly copies the forwarding path algorithm of the BIER message in the BIER domain.

In specific implementation, a forwarding path algorithm of the BIER packet in the BIER domain may be configured by a user according to service requirements, for example, packet forwarding is performed based on the lowest time delay, or packet forwarding is performed based on the maximum available bandwidth.

S102, generating a corresponding bit index routing table according to the configured forwarding path algorithm.

Optionally, when the foregoing S102 is executed, different algorithm identifiers may be generated for different forwarding path algorithms, and then the algorithm identifiers of the forwarding path algorithms are added to the corresponding bit index routing tables to obtain the bit index routing tables of the associated forwarding path algorithms.

In specific implementation, the controller node acquires a forwarding path algorithm configured according to service requirements, and then the BFR node generates a bit index routing table (BIFT) carrying a corresponding algorithm identifier.

The format of the BIFT is shown in Table 1, a Flex-Algo identifies the type of the algorithm, a BFR-id identifies a BFR node and consists of SI and BitString, and the BFR-Prefix identifies the Prefix of a leaf node; BFR-NHR identifies BFR neighbors.

TABLE 1BIFT Format

Flex-Algo

BFR-id

BFR-Prefix

BFR-NBR

S103, the mapping relation between the multicast flow and the forwarding path algorithm is issued to a bit forwarding entry router BFIR in the BIER domain, and a bit index routing table of the associated forwarding path algorithm is issued to a bit forwarding router BFR in the BIER domain.

When the method is implemented specifically, the controller node issues the mapping relation between the multicast flow and the forwarding path algorithm to the BFIR node in the BIER domain; and sending the BIFT (namely the BIFT carrying the specified forwarding path algorithm) of the associated forwarding path algorithm to each BFR node in the BIER domain.

And S104, when the multicast flow reaches the BFIR, encapsulating the forwarding path algorithm into a BIER message by the BFIR.

During specific implementation, the BFIR node encapsulates the algorithm identifier of the self-defined forwarding path algorithm to the head of the BIER message, so that the BFR node can obtain the self-defined forwarding path algorithm after de-encapsulating the BIER message, and further forward the BIER message based on the self-defined forwarding path algorithm.

S105, the BFR decapsulates the encapsulated BIER message to obtain a forwarding path algorithm, searches a bit index routing table corresponding to the forwarding path algorithm, and forwards the BIER message according to the bit index routing table corresponding to the forwarding path algorithm.

In specific implementation, the BFR node decapsulates the received BIER message to obtain an algorithm identifier of a forwarding path algorithm configured by a user, searches for a corresponding BIFT according to the algorithm identifier, and then forwards the BIER message according to the searched BIFT.

Optionally, the controller node may specify an exit node (BIER) and a related forwarding path algorithm for multicast traffic at an entry node (BFIR) of the multicast service, so that the BFIR node performs BIER encapsulation on the traffic according to configuration information (specify the exit node and the related forwarding path algorithm), and specifies the forwarding path algorithm at a BIER header by setting a Flex-Algo value; the value of Flex-Algo can be carried by extending a new field in the BIER header, and can also be identified by a BIFT identifier, and the specific definition can refer to RFC 8296. After receiving the BIER message, the BFR node acquires Flex-Algo, BFR-ID, BSL and other information, and searches a forwarding table of a corresponding algorithm according to the Flex-Algo value; and forwarding the message according to the forwarding table.

As can be seen from the above, in the multicast packet forwarding method provided in the embodiment of the present invention, after the forwarding path algorithm of the BIER packet in the BIER domain is explicitly copied by the user-defined configuration bit index, a corresponding bit index routing table is generated according to the configured forwarding path algorithm, the mapping relationship between the multicast traffic and the forwarding path algorithm is issued to the bit forwarding entry router BFIR in the BIER domain, and the bit index routing table associated with the forwarding path algorithm is issued to the bit forwarding router BFR in the BIER domain; when the multicast flow reaches BFIR, the BFIR encapsulates the forwarding path algorithm into the BIER message, the BFR de-encapsulates the encapsulated BIER message to obtain the forwarding path algorithm, searches the bit index routing table corresponding to the forwarding path algorithm, and forwards the BIER message according to the bit index routing table corresponding to the forwarding path algorithm.

By the multicast message forwarding method provided by the embodiment of the invention, the forwarding path algorithm of the BIER message can be configured in a user-defined manner, so that the forwarding of the BIER message is not only based on the shortest path, but also can be randomly specified, and the multicast service forwarding meeting various requirements can be realized by combining the service requirements such as TE, SLA and the like.

In an embodiment, the multicast packet forwarding method provided in the embodiment of the present invention may further include the following steps: adding mark information into the BIER message by the BFIR, wherein the mark information is used for marking whether the BIER message contains a configured forwarding path algorithm; and when the BIER message received by the BFR does not contain a forwarding path algorithm, forwarding the BIER message by the BFR according to the shortest path algorithm.

The following describes the multicast packet forwarding method provided in the embodiment of the present invention in detail by taking two situations, namely, the lowest latency and the maximum available bandwidth, as specific embodiments.

The first embodiment is as follows:

the service requirement of multicast traffic (S, G) is the lowest latency case:

in the BIER domain shown in FIG. 2, the ingress node of the BFIR is BFR-A and the egress nodes are BFR-E, BFR-G, BFR-H. According to the shortest path algorithm, the paths from the BFR-A to the BFR-E node are BFR-A, BFR-B and BFR-E. Due to the unbalanced traffic distribution, the processing capacity of the nodes, the transmission distance between the nodes, and other factors, the shortest path is not the lowest delay path. In this embodiment, all BFR nodes support extended BIFT.

In this example, SI is 0, so BFR-IDs of BFR- A to BFR-H are (1-8), and BSL is 256. In fig. 2, the default metric of the link is 10, and M in fig. 2 identifies the metric, i.e., the delay. Bid identifies BFR-ID, A identifies BFR-A, and the like.

The method comprises the following implementation steps:

firstly, a controller node calculates a lowest time delay BIER path according to the service requirements of multicast traffic (S, G); the lowest latency path is identified as 10; and calculating paths reaching the egress nodes BFR-E, BFR-H and BFR-G as A-C-F-E, A-C-F-H and A-D-G respectively according to a minimum time delay algorithm, generating a Bit Index Forwarding Table (Bit string Forwarding Table) according to the path of the egress node, and issuing the BIFT carrying the path algorithm to each BFR node. A certain algorithm path identification can be identified by expanding table entry Flex-Algo identification in the BIFT, and can also be identified by the BIFT identification. In this embodiment, the field Flex-Algo is extended in BIFT to identify the algorithm path. Table 2 shows the BIFTs for E and H at the exit on BFR-C with the lowest latency, and Table 3 shows the BIFTs for E, G, H at the exit on BFR-A with the lowest latency.

TABLE 2 BIFT Format for BFR-C at lowest latency

Flex-Algo	BFR-id	BFR-Prefix	BFR-NBR
				10	5	E	F
10	8	H	F

TABLE 3 BIFT Format for BFR-A at lowest latency

Flex-Algo	BFR-id	BFR-Prefix	BFR-NBR
				10	7	G	C
10	5	E	C
				10	8	H	D

Secondly, the controller node appoints exit nodes (E, G and H) and an algorithm path to be 10 for multicast flow (S and G) at A BFIR node, namely A BFR-A node; a new field can be extended to carry in the BIER header, that is, a Flex-Algo mark is added at the Rsv reserved position, the length is 1bit, and as shown in fig. 3, a Flex-Algo value is added behind a bit string; if the Flex-Algo mark is 1, the identification node supports the pointing algorithm path and extracts the Flex-Algo value, and if the Flex-Algo mark is 0, the identification node does not support the designated algorithm path.

And thirdly, the BFR-A performs BIER encapsulation on multicast traffic (S, G) entering A BIER domain according to the configuration information, and specifies an algorithm path at A BIER head, namely, sets Flex-Algo to 1 at the BIER head and sets A Flex-Algo value to 10.

After receiving the BIER message, the BFR node detects the mark of the Flex-Algo, if the mark is 1, the BFR node acquires Flex-Algo information and searches a forwarding table of a corresponding algorithm according to the Flex-Algo value; and forwarding the message according to the forwarding table; if the label is 0, forwarding according to the shortest path forwarding table.

Example two:

the traffic demand of multicast traffic (S, G) is the case of maximum available bandwidth:

in the BIER domain shown in FIG. 4, the ingress node of the BFIR is BFR-A and the egress nodes are BFR-E, BFR-G, BFR-H. According to the shortest path algorithm, the paths from the BFR-A to the BFR-E node are BFR-A, BFR-B and BFR-E. Due to the difference in node capabilities, the shortest path is not the path whose bandwidth meets the requirements. In this embodiment, all BFR nodes support extended bif and the algorithm path is identified by bif identification. In this example, SI is 0, so BFR-IDs of BFR- A to BFR-H are (1-8), and BSL is 256.

In fig. 4, the maximum bandwidth of the link is 10G, and U indicates an unused bandwidth.

The method comprises the following implementation steps:

firstly, the multicast flow of the controller node calculates a BIER path meeting the bandwidth requirement according to the service requirement (S2, G2), and the identifier of the path is 8; and generating a forwarding table BIFT, and sending the forwarding table BIFT to each BFR node. A certain algorithm path identification can be identified by expanding a table entry BIFT identification in the BIFT, and also can be identified by the BIFT identification. In this embodiment, the BIFT-id identifies the algorithm path in BIFT. Table 4 shows the BIFT for BFR-C at the maximum available bandwidth.

TABLE 4 BIFT Format for BFR-C at maximum available Bandwidth

BIFT-id	BFR-id	BFR-Prefix	BFR-NBR
				8	5	E	E
8	8	H	F
				8	7	G	G

Secondly, the controller node appoints exit nodes (E, G and H) and an algorithm path to be 8 for multicast flow (S2, G2) at A BFIR node (namely A BFR-A node); as shown in fig. 5, the algorithm path identity is carried in the BIFT-id.

And thirdly, the BFR-A performs BIER encapsulation on the multicast traffic (S2, G2) entering the BIER domain according to the configuration information, and assigns an algorithm path at A BIER head, namely, the BIFT-id is set to be 8 at the BIER head.

Fourthly, after receiving the BIER message, the BFR node acquires a BIFT-id value and searches a forwarding table corresponding to the algorithm; and forwarding the message according to the forwarding table of the corresponding algorithm.

Based on the same inventive concept, the embodiment of the present invention further provides a multicast packet forwarding apparatus, as described in the following embodiments. Because the principle of the device for solving the problems is similar to the multicast message forwarding method, the implementation of the device can refer to the implementation of the multicast message forwarding method, and repeated parts are not described again.

Fig. 6 is a schematic diagram of a multicast message forwarding apparatus provided in an embodiment of the present invention, and as shown in fig. 6, the apparatus may include: a configuration module 61, a routing table generation module 62, a configuration information issuing module 63, a message encapsulation module 64 and a message decapsulation module 65.

The configuration module 61 is configured to configure a forwarding path algorithm for explicitly copying the BIER packet in the BIER domain by using the bit index; a routing table generating module 62, configured to generate a corresponding bit index routing table according to a forwarding path algorithm of the BIER packet; a configuration information issuing module 63, configured to issue a mapping relationship between the multicast traffic and the forwarding path algorithm to a bit forwarding entry router BFIR in the BIER domain, and issue a bit index routing table associated with the forwarding path algorithm to a bit forwarding router BFR in the BIER domain; a message encapsulation module 64, configured to encapsulate the forwarding path algorithm into a BIER message when the multicast traffic reaches the BFIR; the message decapsulation module 65 is configured to decapsulate the encapsulated BIER message to obtain a forwarding path algorithm, search a bit index routing table corresponding to the forwarding path algorithm, and forward the BIER message according to the bit index routing table corresponding to the forwarding path algorithm.

As can be seen from the above, in the multicast packet forwarding apparatus provided in the embodiment of the present invention, the forwarding path algorithm of the BIER packet in the BIER domain is explicitly copied through the configuration module 61 by using the configuration bit index; generating a corresponding bit index routing table according to a forwarding path algorithm of the BIER message by a routing table generating module 62; the mapping relation between the multicast flow and the forwarding path algorithm is issued to a bit forwarding entry router BFIR in the BIER domain through a configuration information issuing module 63, and a bit index routing table of the associated forwarding path algorithm is issued to a bit forwarding router BFR in the BIER domain; when the multicast flow reaches BFIR, the BFIR encapsulates the forwarding path algorithm into BIER message through message encapsulation module 64; the packet decapsulation module 65 decapsulates the encapsulated BIER packet to obtain a forwarding path algorithm, searches for a bit index routing table corresponding to the forwarding path algorithm, and forwards the BIER packet according to the bit index routing table corresponding to the forwarding path algorithm.

The multicast message forwarding device provided by the embodiment of the invention can configure the forwarding path algorithm of the BIER message in a user-defined way, so that the forwarding of the BIER message is not only based on the shortest path, but also can randomly specify the forwarding path, and the multicast service forwarding meeting various requirements is realized by combining the service requirements such as TE, SLA and the like.

In an embodiment, the multicast packet forwarding apparatus provided in the embodiment of the present invention may further include: an algorithm identifier generating module 66, configured to generate different algorithm identifiers for different forwarding path algorithms; the routing table generating module 62 is further configured to add the algorithm identifier of the forwarding path algorithm to the corresponding bit-indexed routing table.

Optionally, the packet encapsulation module 64 is further configured to encapsulate the algorithm identifier of the forwarding path algorithm into the header of the BIER packet.

In an embodiment, the multicast packet forwarding apparatus provided in the embodiment of the present invention may further include: a message marking module 67, configured to add marking information to the BIER message, where the marking information is used to mark whether the BIER message includes a configured forwarding path algorithm; the message decapsulation module 65 is further configured to forward, by the BFR according to the shortest path algorithm, the BIER message when the BIER message received by the BFR does not include the forwarding path algorithm.

Based on the same inventive concept, the embodiment of the present invention further provides a computer device, so as to solve the technical problem that the existing BIER message forwarding method can only support shortest path forwarding and cannot meet the requirement of specifying a forwarding path under different service requirements.

Based on the same inventive concept, the embodiment of the present invention further provides a computer readable storage medium, so as to solve the technical problem that the existing BIER message forwarding method can only support shortest path forwarding and cannot meet the requirement of specifying a forwarding path under different service requirements, where the computer readable storage medium stores a computer program for executing the multicast message forwarding method.

In summary, embodiments of the present invention provide a multicast packet forwarding method, apparatus, computer device, and computer readable storage medium, and compared with the technical solution in the prior art that forwards a BIER packet based on a shortest path, in the multicast packet forwarding method for specifying a BIER forwarding path provided in embodiments of the present invention, a BIER domain entry node carries a specified forwarding path algorithm at a head of the BIER packet; and forwarding the message by the BFR node according to the algorithm type and the BIER basic information carried by the BIER message header, thereby realizing multicast message forwarding according to the service requirement. By configuring a forwarding path algorithm carried in a BIER message header in a self-defined manner, the forwarding of the BIER message can be realized by combining the traffic requirements such as TE, SLA and the like instead of only based on the shortest path, so that the multicast service forwarding meeting various requirements can be realized.

As will be appreciated by one skilled in the art, embodiments of the present invention may be provided as a method, system, or computer program product. Accordingly, the present invention may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present invention may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein.

The present invention is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the invention. It will be understood that each flow and/or block of the flow diagrams and/or block diagrams, and combinations of flows and/or blocks in the flow diagrams and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.

These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.

These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.

The above-mentioned embodiments are intended to illustrate the objects, technical solutions and advantages of the present invention in further detail, and it should be understood that the above-mentioned embodiments are only exemplary embodiments of the present invention, and are not intended to limit the scope of the present invention, and any modifications, equivalent substitutions, improvements and the like made within the spirit and principle of the present invention should be included in the scope of the present invention.

Claims

1. A multicast message forwarding method, comprising:

the configuration bit index explicitly copies a forwarding path algorithm of the BIER message in the BIER domain;

generating a corresponding bit index routing table according to the configured forwarding path algorithm;

generating different algorithm identifications for different forwarding path algorithms;

adding the algorithm identification of the forwarding path algorithm into a corresponding bit index routing table;

the mapping relation between the multicast flow and the forwarding path algorithm is issued to a bit forwarding entry router BFIR in the BIER domain, and a bit index routing table of the associated forwarding path algorithm is issued to a bit forwarding router BFR in the BIER domain;

when the multicast flow reaches BFIR, the BFIR encapsulates the algorithm identification of the forwarding path algorithm configured by self-definition to the head of the BIER message;

and decapsulating the encapsulated BIER message by the BFR to obtain an algorithm identifier of a self-defined configured forwarding path algorithm, searching a bit index routing table corresponding to the forwarding path algorithm according to the algorithm identifier, and forwarding the BIER message according to the bit index routing table corresponding to the forwarding path algorithm.

2. The method of claim 1, wherein the method further comprises:

adding mark information into the BIER message by BFIR, wherein the mark information is used for marking whether the BIER message contains a configured forwarding path algorithm;

and when the BIER message received by the BFR does not contain a forwarding path algorithm, forwarding the BIER message by the BFR according to the shortest path algorithm.

3. A multicast message forwarding apparatus, comprising:

the configuration module is used for configuring a forwarding path algorithm for explicitly copying the BIER message in the BIER domain by using the bit index;

the routing table generating module is used for generating a corresponding bit index routing table according to the configured forwarding path algorithm;

the algorithm identifier generation module is used for generating different algorithm identifiers for different forwarding path algorithms;

the routing table generation module is further used for adding the algorithm identification of the forwarding path algorithm to the corresponding bit index routing table;

the configuration information issuing module is used for issuing the mapping relation between the multicast flow and the forwarding path algorithm to a bit forwarding entry router BFIR in the BIER domain and issuing a bit index routing table of the associated forwarding path algorithm to a bit forwarding router BFR in the BIER domain;

the message encapsulation module is used for encapsulating the algorithm identifier of the forwarding path algorithm configured by the user-defined to the head of the BIER message by the BFIR when the multicast flow reaches the BFIR;

and the message de-encapsulation module is used for de-encapsulating the encapsulated BIER message to obtain an algorithm identifier of a self-defined forwarding path algorithm, searching a bit index routing table corresponding to the forwarding path algorithm according to the algorithm identifier, and forwarding the BIER message according to the bit index routing table corresponding to the forwarding path algorithm.

4. The apparatus of claim 3, wherein the apparatus further comprises: the message marking module is used for adding marking information into the BIER message, wherein the marking information is used for marking whether the BIER message contains the configured forwarding path algorithm;

and the message decapsulation module is further used for forwarding the BIER message by the BFR according to the shortest path algorithm under the condition that the BIER message received by the BFR does not contain the forwarding path algorithm.

5. A computer device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, wherein the processor implements the multicast packet forwarding method according to claim 1 or 2 when executing the computer program.

6. A computer-readable storage medium storing a computer program executable by a processor to implement the multicast packet forwarding method according to claim 1 or 2.