A method and apparatus for transmitting bier multicast information

Abstract

This invention relates to the field of network communication multicast technology, and provides a method and apparatus for transmitting BIER multicast information. The method calculates the bandwidth index of each link using link state information; combines this with the BSL values ​​of each BFR device to calculate the cost value of each link, which is then used as a reference value for the routing algorithm to calculate the final forwarding path of the BIER message. This invention solves the problem of uneven traffic distribution in BIER multicast networks by using the load of each link in the topology as a constraint, and incorporating the different BSL values ​​of BFRs under two roles into the routing calculation. The routing result fully considers the forwarding capacity of each node in the network and the remaining bandwidth of the links, resulting in a relatively even distribution of traffic across the links, reasonable resource allocation, and improved network stability.

Description

Technical Field

[0001] This invention relates to the field of network communication multicast technology, and in particular to a method and apparatus for transmitting BIER multicast information. Background Technology

[0002] Bit Index Explicit Replication (BIER) is a new multicast forwarding technology that does not require constructing a multicast forwarding tree in the network. Instead, it only requires adding a BIER header to the ingress router of the multicast domain. The header contains a bit string representing the router to which the data is to be forwarded. Intermediate routers forward the data based on the bit string until the egress router of the multicast domain decapsulates the BIER header to restore the original data.

[0003] BIER technology replaces the traditional multicast tree-based forwarding method with a bit-based forwarding method, significantly reducing protocol processing complexity and thus lowering network processing costs. BIER technology uses the Shortest Path First (SPF) algorithm to calculate and generate the Bit Index Forwarding Table (BIFT). This algorithm treats all links with equal overhead regardless of whether they are carrying traffic, greatly simplifying network processing. However, it ignores situations where link loads are inconsistent and site forwarding capabilities differ, leading to some links being idle while others are congested, resulting in low network resource utilization. Furthermore, it cannot flexibly switch paths during traffic surges, posing potential risks. Therefore, how to comprehensively consider link load and site forwarding capability differences in packet forwarding path selection, eliminate these risks, and improve packet forwarding quality and bandwidth utilization is a pressing issue in this field. Summary of the Invention

[0004] The technical problem this invention aims to solve is how to comprehensively consider the differences in link load and site forwarding capabilities when selecting message forwarding paths for BIER multicast information, thereby eliminating potential risks and improving message forwarding quality and bandwidth utilization.

[0005] The present invention adopts the following technical solution:

[0006] In a first aspect, the present invention provides a method for transmitting BIER multicast information, comprising:

[0007] The bandwidth metric for each link is calculated using link status information;

[0008] By combining the BSL values ​​of each BFR device, the cost value of each link is calculated, which is used as a reference value for the routing algorithm to calculate the final forwarding path of the BIER packet;

[0009] Specifically, when the difference between the BSL value and the reference value calculated from the BSL values ​​of each BFR device in the current network exceeds a preset distance, the BFR device to which the corresponding BSL value belongs is identified as the landing site. The BFR device identified as the landing site does not participate in subsequent forwarding, and only the BIER header needs to be stripped.

[0010] Preferably, the calculation of each link cost value specifically includes:

[0011] By setting a timer t, the cost value is calculated periodically through polling.

[0012] Specifically, the latest cost is only announced to the routing protocol and saved when the cost value changes by more than a first preset value.

[0013] Preferably, the polling time for the periodic polling is set to 10-36000 minutes according to the specific needs of the actual project.

[0014] Preferably, the calculation of the bandwidth metric for each link using link state information specifically involves combining time variables and cost calculations to establish a link cost calculation model, wherein the model is:

[0015] F[cost(B max B t ,BSL),t]=af(t) b ×cost(B max B t BSL) d ;

[0016] Among them, B max B is the maximum bandwidth of the link. t The current bandwidth is represented by BSL, which is the forwarding capacity value of the BFR device, and t is the current time. f(t) is the time polling function, used to set the polling time, where n is a positive integer and n≠0; a, b, d, and e are the corresponding coefficients, obtained through regression analysis. Only the cost uploaded at fixed time nodes is meaningful, so the time variable affects the calculation results in the form of a periodic function; cost() is the cost function, used to calculate the cost value.

[0017] Preferably, the time variable is a periodic constant. When t is not within the polling time interval, the transmission link overhead is 0. After the controller parses the message, it can be known that the polling time has not arrived. Since the overhead is a relative value, when the overhead values ​​in the domain are calculated and divided for comparison, the linear coefficients of each item can be simplified to a=1, b=1, d=1.

[0018] When the remaining bandwidth is 0, the link cost can be considered infinite, meaning that the remaining bandwidth and the cost are inversely proportional. This leads to the following relationship: The cost is a relative linear coefficient, with A set to 1, while D and C need to be set according to the actual scenario.

[0019] Preferably, the model is simplified to the following formula:

[0020]

[0021] Among them, 10 3 This is to ensure that the calculation result is greater than 1, so as to facilitate comparison; the coefficients C and D each take the value of 1.

[0022] Preferably, the value range of BSL is 64-4096, the step size is 64, and the unit of bandwidth is Mbps.

[0023] Preferably, the added switch for cost-synergy coordination and cost-self customization is as follows:

[0024] When cost-synergy is enabled, the cost values ​​in the network are determined by the routing protocol, and BIER does not participate in the calculation.

[0025] When cost-self customization is enabled, the cost value of each link is calculated by combining the BSL values ​​of each BFR device; the link cost value calculation result is reported to the routing protocol as a reference value for the routing algorithm, and then the forwarding path is obtained.

[0026] Preferably, the added switch for cost-synergy coordination and cost-self customization is as follows:

[0027] Users set the link status polling time t based on the current network latency and congestion level. The central controller BIER_Controller periodically initiates collection requests for link status information according to the polling time.

[0028] Real-time acquisition of forwarding capability data for each link in the network prepares data for calculating the optimal path for BIER packets.

[0029] In a second aspect, the present invention also provides a BIER multicast information transmission apparatus for implementing the BIER multicast information transmission method described in the first aspect, the apparatus comprising:

[0030] At least one processor; and a memory communicatively connected to the at least one processor; wherein the memory stores instructions executable by the at least one processor for performing the BIER multicast information transmission method described in the first aspect.

[0031] Thirdly, the present invention also provides a non-volatile computer storage medium storing computer-executable instructions, which are executed by one or more processors to perform the BIER multicast information transmission method described in the first aspect.

[0032] This invention solves the problem of uneven traffic distribution in BIER multicast networks. It uses the load of each link in the topology as a constraint and combines the different BSL values ​​of BFR under two roles to participate in the routing calculation. The routing result fully considers the forwarding capacity of each node in the network and the remaining bandwidth of the links, so that the traffic carried by each link in the network is relatively even, the resource allocation is reasonable, and the network stability is improved.

[0033] In particular, it can avoid situations where there are differences in link status in large BIER networks and a few edge nodes have weak forwarding capabilities, resulting in large differences in load between links and the intra-domain forwarding performance being limited by smaller BSL devices, thereby improving the overall utilization efficiency of devices within the domain. Attached Figure Description

[0034] To more clearly illustrate the technical solutions of the embodiments of the present invention, the accompanying drawings used in the embodiments of the present invention will be briefly described below. Obviously, the drawings described below are merely some embodiments of the present invention. For those skilled in the art, other drawings can be obtained based on these drawings without any creative effort.

[0035] Figure 1 This is a schematic flowchart of a BIER multicast information transmission method provided in an embodiment of the present invention;

[0036] Figure 2 This is a schematic diagram of another BIER multicast information transmission method provided in an embodiment of the present invention;

[0037] Figure 3 This is a schematic diagram of a multicast network provided in an embodiment of the present invention;

[0038] Figure 4 This is another schematic diagram of a multicast network provided in an embodiment of the present invention;

[0039] Figure 5 This is provided by the embodiments of the present invention. Figure 4 A schematic diagram of a multicast network where the remaining link bandwidth changes.

[0040] Figure 6 This is a schematic diagram of a BIER multicast information transmission device provided in an embodiment of the present invention. Detailed Implementation

[0041] To make the objectives, technical solutions, and advantages of this invention clearer, the invention will be further described in detail below with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are merely illustrative and not intended to limit the invention.

[0042] In the description of this invention, the terms "inner", "outer", "longitudinal", "lateral", "upper", "lower", "top", "bottom", etc., indicate the orientation or positional relationship based on the orientation or positional relationship shown in the accompanying drawings. They are only for the convenience of describing this invention and do not require that this invention must be constructed and operated in a specific orientation. Therefore, they should not be construed as limiting this invention.

[0043] In this invention, the terms "first," "second," etc., are used for descriptive purposes only and should not be construed as indicating or implying relative importance or implicitly specifying the number of indicated technical features. Therefore, a feature defined with "first," "second," etc., may explicitly or implicitly include one or more of that feature. In the description of this application, unless otherwise stated, "a plurality of" means two or more.

[0044] In this application, unless otherwise expressly specified and limited, the term "connection" should be interpreted broadly. For example, "connection" can be a fixed connection, a detachable connection, or an integral part; it can be a direct connection or an indirect connection through an intermediate medium. Furthermore, the term "coupled" can refer to an electrical connection that enables signal transmission.

[0045] This invention is specifically optimized for the scenario of a landing site (forwarding termination site). In this scenario, there are some devices with extremely poor forwarding capabilities, i.e., BSL values ​​are much lower than other devices. To ensure that there is no BRF-ID black hole phenomenon, it is generally required that all devices have consistent BSL configurations. In this case, forwarding can only be performed based on the minimum BSL, which seriously wastes the efficiency of most other devices with strong forwarding capabilities. Only the landing site (egress route) needs to be identified. At this time, the site does not participate in subsequent forwarding. Only the BIER header needs to be stripped. Therefore, its forwarding capability can be regarded as the strongest when it is a landing site. The maximum value of 4096 specified by BSL is selected for calculation. When the route of the landing site is identified, it will send two BSL values ​​to the BSL central controller when participating in the BSL value calculation. One is the actual BSL capability value, which is used when the device participates in forwarding and is used in the calculation of the forwarding table. The other is the maximum value of 4096 specified by BSL, which is used when the device is a landing site and is used in the calculation of the forwarding table. Different costs can be calculated through the formula, and the specific forwarding path is determined. At this time, since the BSL may be inconsistent, D needs to be calculated through regression analysis.

[0046] It was found that some routing protocols in the existing network equipment are incomplete, and such equipment cannot identify network load conditions, resulting in low reliability of the calculated BIER forwarding path. At the same time, there is a need for users to customize the path. Therefore, the following switches have been added: cost-synergy collaboration and cost-self customization. When cost-synergy collaboration is enabled, the cost value in the network is determined by the routing protocol, and BIER does not participate in the calculation. When cost-self customization is enabled, BIER uses the method of this patent to calculate the cost, then reports the calculation result to the routing protocol, and then obtains the forwarding path. At this time, regression analysis is required to obtain the values ​​of all coefficients, namely a, b, d, A, C, and D.

[0047] Furthermore, the technical features involved in the various embodiments of the present invention described below can be combined with each other as long as they do not conflict with each other.

[0048] Example 1:

[0049] Embodiment 1 of the present invention provides a method for transmitting BIER multicast information, such as Figure 1 As shown, it includes:

[0050] In step 201, the bandwidth metric for each link is calculated using the link status information.

[0051] In step 202, the link cost value is calculated by combining the BSL value of each BFR device, and used as the reference value for the routing algorithm to calculate the final forwarding path of the BIER packet.

[0052] The calculation of each link cost value specifically includes: periodically polling and calculating the cost value (cost) by setting a timer t; and only when the cost value changes by more than a first preset value is the latest cost announced to the routing protocol and saved. This ensures the stability of forwarding.

[0053] The polling time for the periodic polling is set to 10-36000 minutes based on the specific needs of the actual project.

[0054] In step 203, when the difference between the BSL value and the reference value calculated from the BSL values ​​of each BFR device in the current network exceeds a preset distance, the BFR device to which the corresponding BSL value belongs is identified as a landing site. The BFR device identified as a landing site does not participate in subsequent forwarding and only needs to have its BIER header stripped.

[0055] This invention addresses the problem of uneven traffic distribution in BIER multicast networks by using the load of each link in the topology as a constraint and incorporating different BSL values ​​of BFR under two roles in routing calculation. The routing results fully consider the forwarding capacity of each node in the network and the remaining bandwidth of the links, resulting in a relatively even distribution of traffic across each link in the network, reasonable resource allocation, and improved network stability.

[0056] In particular, it can avoid situations where there are differences in link status in large BIER networks and a few edge nodes have weak forwarding capabilities, resulting in large differences in load between links and the intra-domain forwarding performance being limited by smaller BSL devices, thereby improving the overall utilization efficiency of devices within the domain.

[0057] In conjunction with the embodiments of the present invention, in order to more effectively plan and implement the above steps 201 and 202, a model-based implementation solution is also proposed in the corresponding preferred embodiment. Specifically, the calculation of the bandwidth index of each link using link state information involves combining time variables and cost calculations to establish a link cost calculation model. The model is as follows:

[0058] F[cost(B max B t ,BSL),t]=af(t) b ×cost(B max B t BSL) d (1)

[0059] Among them, B max B is the maximum bandwidth of the link. t The current bandwidth is represented by BSL, which is the forwarding capacity value of the BFR device, and t is the current time. f(t) is the time polling function, used to set the polling time, where n is a positive integer and n≠0; a, b, d, and e are the corresponding coefficients, obtained through regression analysis. Only the cost uploaded at fixed time nodes is meaningful, so the time variable affects the calculation results in the form of a periodic function; cost() is the cost function, used to calculate the cost value.

[0060] The time variable is a periodic constant, and the calculated cost value has no unit and is a relative value. When t is not within the polling time interval, the sending link cost is 0. After the controller parses the message, it can be known that the polling time has not arrived. Since the cost is a relative value, when the cost values ​​in the domain are calculated and divided for comparison, the linear coefficients of each item can be simplified to a=1, b=1, d=1.

[0061] When the remaining bandwidth is 0, the link cost can be considered infinite, meaning that the remaining bandwidth and the cost are inversely proportional. This leads to the following relationship: The cost is a relative linear coefficient, with A set to 1, while D and C need to be set according to the actual scenario.

[0062] This embodiment assumes that BSL within the domain needs to be consistent to avoid the black hole problem. It is easy to see that when comparing and dividing various cost values... Since BSL are equal, we can obtain D = 1, and the final formula can be simplified to: The coefficient C needs to be obtained through regression analysis of the data.

[0063] Furthermore, to improve the implementation efficiency of the corresponding model, in a feasible scenario, the model can be simplified to the following formula, and the simplified formula is shown below:

[0064]

[0065] Among them, 10 3 This is to ensure that the calculation result is greater than 1, so as to facilitate comparison; the coefficients C and D each take the value of 1.

[0066] The parameter values ​​mentioned above also take into account the range of BSL (Bandwidth Scaling) from 64 to 4096, with a step size of 64, and the unit of bandwidth being Mbps. The coefficient is set to 4096 to ensure the calculated result is close to the order of magnitude of the bandwidth. The value range is a positive integer [1, 4096], and the result is a relative value, which can be flexibly determined for ease of comparison and calculation. Formula 2 above represents the situation where, before the reporting time, the overhead is zero; when the remaining bandwidth is 0, no message can be sent, and the overhead becomes infinite.

[0067] As support for the implementation of the technical solution in this invention embodiment, functional definitions are also provided at the interface protocol pseudocode level to more effectively support the calculation and implementation of the above-mentioned methods and related formulas. For example, new switch cost-synergy collaboration and cost-self customization are added. Specifically:

[0068] When cost-synergy is enabled, the cost values ​​in the network are determined by the routing protocol, and BIER does not participate in the calculation.

[0069] When cost-self customization is enabled, the cost value of each link is calculated by combining the BSL values ​​of each BFR device; the link cost value calculation result is reported to the routing protocol as a reference value for the routing algorithm, and then the forwarding path is obtained.

[0070] In addition to the implementation methods mentioned above, adding the switch cost-synergy coordination and custom cost-self can also be implemented in another way, specifically:

[0071] Users set the link status polling time t based on the current network latency and congestion level. The central controller BIER_Controller periodically initiates collection requests for link status information according to the polling time.

[0072] Real-time acquisition of forwarding capability data for each link in the network prepares data for calculating the optimal path for BIER packets.

[0073] Example 2:

[0074] The embodiments of the present invention will be based on Embodiment 1, and will present the technical solution of the present invention in a more complete manner, such as... Figure 2 The diagram shows the multicast message forwarding method flow. The steps are as follows:

[0075] In step 301, the link status polling time t is set according to the current network latency and congestion level, and the link status in the network is polled.

[0076] In step 302, the BSL of each BFR in the domain is configured and sent to the BIER central controller.

[0077] In step 303, it is determined whether each BFR is a landing site or a non-landing site during the forwarding process, and the cost of each link in the network is calculated by substituting different BSL values ​​into the model proposed in Example 1.

[0078] In step 304, the cost value is sent to the routing calculation module, and the final BIER packet forwarding path is obtained according to the routing algorithm.

[0079] Example 3:

[0080] This invention's embodiments are based on the solution process implemented in Embodiment 1, using the corresponding architectural level as the starting point for explaining the solution, and attaching the core innovations of Embodiment 1 to specific application scenarios for related demonstration. (Reference) Figures 3-5 It should be noted that the specific details involved in this embodiment are as follows:

[0081] Within the domain, users set the link status polling time t based on the current network latency and congestion level. The central controller BIER_Controller periodically initiates collection requests for link status information according to the polling time, and obtains the forwarding capability data of each link in the network in real time to prepare data for calculating the optimal path of BIER packets.

[0082] The central controller polls every 10 seconds by default. Every 10 seconds, it sends a link state information collection request and a capability collection request to the BFR. The BFR responds to the central controller's capability collection request by encapsulating the maximum BSL capability in the message and sending it to the central controller. When there is a BSL update, the central controller announces the updated BSL value to all BFRs in the domain to maintain BSL consistency within the domain. BFR_id reclamation and BFR joining will trigger BSL recalculation.

[0083] The central controller acquires the status information of each link and the maximum forwarding BSL of each BFR. Then, based on the link status information, it calculates the bandwidth index of each link and, combined with the BSL values ​​of each BFR device, calculates the cost value of each link using the simplified model formula in Example 1. This cost value is used as a reference value for the routing algorithm to calculate the final forwarding path of the BIER packet. In this process, the smaller BSL value between the devices at both ends of the link is taken as the packet forwarding capability value of the link, and the BSL of the landing site and non-landing sites are differentiated, such as... Figure 3 As shown, when BFR is the landing site, BSL can be considered to be the maximum value of 4096. In the case described above, when R1 is the landing site, the BSL capacity value of link R1-R2 can be considered to be 512.

[0084] By following the steps above, the impact of differences in link load and site forwarding capabilities on the entire network can be effectively controlled. Figure 3 In Table 1, the link costs of R1-R2, R2-R3, R3-R4, and R2-R4 obtained through the cost algorithm are shown. Substituting them into the routing algorithm, the shortest path can be calculated as R1-R2-R3-R4. After introducing the concept of the landing site, R4 is the landing site and its BSL is the maximum value of 4096. The cost value of R2-R4 changes from 64 to 8. At this time, the shortest path is R1-R2-R4.

[0085] Table 1:

[0086] like Figure 4 Add a node. At this point, R4 is a non-terminating site, and R5 is a terminating site. R4's BSL is 64 for cost calculation, and the final shortest packet forwarding path is R1-R2-R3-R4-R5; (e.g., ...) Figure 5 The remaining bandwidth of links R2-R4, R2-R3, and R3-R4 changes from 10Gbps to 5Gbps. The link costs of R2-R4, R2-R3, and R3-R4 also change (see Table 2). Therefore, the shortest path becomes R1-R2-R4-R5. When network traffic surges or drops sharply, the forwarding path can be flexibly switched.

[0087] Table 2:

[0088] link Remaining bandwidth (Mbps) Maximum Forwarding Capacity (BSL) Cost value R1-R2 <![CDATA[10×10 3 ]]> 64 6.4 R2-R3 <![CDATA[5×10 3 ]]> 512 12.8 R3-R4 <![CDATA[5×10 3 ]]> 64 12.8 R2-R4 <![CDATA[5×10 3 ]]> 64 12.8

[0089] This invention provides a message forwarding path selection method, proposing a cost value calculation formula that combines the remaining bandwidth of the link and the forwarding capacity (BSL) to avoid uneven network traffic distribution caused by inconsistent link load and low message forwarding quality due to differences in site forwarding capabilities. When network traffic changes, the forwarding path can be flexibly switched to ensure message forwarding quality and effectively improve network resource utilization.

[0090] Example 4:

[0091] like Figure 6 The diagram shown is an architectural schematic of a BIER multicast information transmission device according to an embodiment of the present invention. The BIER multicast information transmission device of this embodiment includes one or more processors 21 and a memory 22. Figure 6 Take a processor 21 as an example.

[0092] Processor 21 and memory 22 can be connected via a bus or other means. Figure 6 Taking the example of a connection between China and Israel via a bus.

[0093] The memory 22, as a non-volatile computer-readable storage medium, can be used to store non-volatile software programs and non-volatile computer-executable programs, such as the BIER multicast information transmission method in Embodiment 1. The processor 21 executes the BIER multicast information transmission method by running the non-volatile software program and instructions stored in the memory 22.

[0094] Memory 22 may include high-speed random access memory, and may also include non-volatile memory, such as at least one disk storage device, flash memory device, or other non-volatile solid-state storage device. In some embodiments, memory 22 may optionally include memory remotely located relative to processor 21, which can be connected to processor 21 via a network. Examples of such networks include, but are not limited to, the Internet, intranets, local area networks, mobile communication networks, and combinations thereof.

[0095] The program instructions / modules are stored in the memory 22. When executed by one or more processors 21, they perform the BIER multicast information transmission method described in Embodiment 1 above, for example, the method described above. Figure 1 and Figure 2 The steps shown.

[0096] It is worth noting that the information interaction and execution process between the modules and units in the above-mentioned device and system are based on the same concept as the processing method embodiment of the present invention. For details, please refer to the description in the method embodiment of the present invention, and will not be repeated here.

[0097] Those skilled in the art will understand that all or part of the steps in the various methods of the embodiments can be implemented by a program instructing related hardware. The program can be stored in a computer-readable storage medium, which may include: read-only memory (ROM), random access memory (RAM), magnetic disk or optical disk, etc.

[0098] The above description is only a preferred embodiment of the present invention and is not intended to limit the present invention. Any modifications, equivalent substitutions, and improvements made within the spirit and principles of the present invention should be included within the protection scope of the present invention.

Claims

1. A method for transmitting BIER multicast information, characterized in that, include: The bandwidth metric for each link is calculated using link status information; By combining the BSL values ​​of each BFR device, the cost value of each link is calculated, which is used as a reference value for the routing algorithm to calculate the final forwarding path of the BIER packet; Specifically, when the BSL value differs from the reference value calculated by each BFR device in the current network by a preset distance, the BFR device to which the corresponding BSL value belongs is identified as the landing site. The BFR device identified as the landing site does not participate in subsequent forwarding and only needs to have its BIER header stripped. The calculation of each link bandwidth metric using link state information specifically involves combining time variables and cost calculations to establish a link cost calculation model. The model is as follows: ； in, This is the maximum bandwidth of the link. The current bandwidth is represented by BSL, which is the forwarding capacity value of the BFR device, and t is the current time. f(t) is the time polling function, used to set the polling time, where n is a positive integer and n≠0; a, b, d, and e are the corresponding coefficients, obtained through regression analysis. Only the overhead uploaded at fixed time nodes is meaningful, so the time variable affects the calculation results in the form of a periodic function; cost() is the overhead function, used to calculate the overhead value.

2. The method for transmitting BIER multicast information according to claim 1, characterized in that, The calculation of each link cost value specifically includes: By setting a timer, the cost value can be calculated periodically through polling. Specifically, when the cost value changes by more than a first preset value, the latest cost is notified to the routing protocol and saved.

3. The method for transmitting BIER multicast information according to claim 2, characterized in that, The polling time for the periodic polling is set to 10-36000 minutes based on the specific needs of the actual project.

4. The method for transmitting BIER multicast information according to claim 1, characterized in that, The time polling function is a periodic constant. When t is not an integer multiple of the polling time interval t0, the transmission link overhead is 0. After the controller parses the message, it can be known that the polling time has not arrived. Since the overhead is a relative value, when the overhead values ​​in the domain are calculated and divided for comparison, the linear coefficients of each term are simplified to a=1, b=1, d=1. When the remaining bandwidth is 0, the link overhead is considered to be infinite, meaning that the remaining bandwidth and the overhead are inversely proportional. This leads to the following relationship: The cost is a relative value with linear coefficient A set to 1, while D and C need to be set according to the actual scenario.

5. The method for transmitting BIER multicast information according to any one of claims 1-4, characterized in that, New switches for cost-synergy and cost-self customization have been added. Details are as follows: When cost-synergy is enabled, the cost values ​​in the network are determined by the routing protocol, and BIER does not participate in the calculation. When cost-self customization is enabled, the cost value of each link is calculated by combining the BSL values ​​of each BFR device. The link cost calculation result is then reported to the routing protocol as a reference value for the routing algorithm, thereby obtaining the forwarding path.

6. The method for transmitting BIER multicast information according to any one of claims 1-4, characterized in that, New switches for cost-synergy and cost-self customization have been added. Details are as follows: Users set the link status polling time based on the current network latency and congestion level. The central controller BIER_Controller periodically initiates collection requests for link status information according to the polling time. Real-time acquisition of forwarding capability data for each link in the network prepares data for calculating the optimal path for BIER packets.

7. A BIER multicast information transmission device, characterized in that, The device includes: At least one processor; and a memory communicatively connected to the at least one processor; wherein the memory stores instructions executed by the at least one processor for performing the BIER multicast information transmission method according to any one of claims 1-6.

Images