BIER Slice Mapping for Centralized Multicast Path Calculation
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing technologies lack a solution for implementing slice-based Bit Index Explicit Replication-Traffic Engineering (BIER-TE) information collection and path calculation in network slicing scenarios, particularly in BIER networks, and there is no method to integrate slice association with BIER information delivery through a Path Computation Element as a Central Controller (PCECC).
Innovation Solution
An information advertising method that extends the BIER network by including a target network resource partition identifier in messages exchanged between controllers and Bit Forwarding Routers (BFRs) using protocols like BGP, BGP-LS, PCEP, and NETCONF, enabling the mapping of target information to network resource partition identifiers.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Device complexity
If conventional multicast technologies are used in BIER networks, then multicast tree construction and per-flow state recording are required, but this increases protocol complexity and intermediate network states
Solution Approach 1:
The patent extracts the egress node information from the data plane and places it in the BIER header as a Bitstring. This separates the multicast routing function from the data forwarding function, allowing transit nodes to forward packets based solely on the Bitstring without constructing multicast trees or maintaining per-flow states, thereby reducing protocol complexity while maintaining ease of operation
Solution Approach 2:
The patent uses a Bitstring in the BIER header that represents a set of egress nodes. This Bitstring acts as a copy or representation of the multicast group information, allowing multiple egress nodes to be identified without creating separate flow states for each group, thus simplifying the intermediate network states
2Adaptability or versatility
If IGP multi-topology technology is used for network slicing, then physical network topology is divided into multiple logical sub-topologies, but this increases device complexity and configuration difficulty
Solution Approach 1:
The patent enables the BIER network to support multiple network slices by allowing a single BIER domain to accommodate multiple slice aggregations and slices. The BIER-TE information and path calculation mechanisms are designed to be universal, supporting both single-slice and multi-slice scenarios without requiring separate infrastructure for each slice, thus reducing device complexity while maintaining adaptability
Solution Approach 2:
The patent segments the BIER-TE information into different components (BIER-TE prefix, Bitstring, path information) that can be independently managed and associated with different network slices. This segmentation allows the system to handle multiple slices through structured information organization rather than through complex logical sub-topology management
3Extent of automation
If centralized SDN controller is used for BIER-TE path calculation, then BIER-TE information must be learned through BGP-LS and paths distributed via southbound interface, but this increases information collection and path calculation complexity in multi-slice scenarios
Solution Approach 1:
The patent introduces the PCECC as an intermediary between the control plane and the BIER network. The PCECC receives BIER-TE information from the SDN controller, performs slice-based path calculations, and delivers the results to BFR nodes. This intermediary role simplifies the information collection process by centralizing the path calculation function and reducing the complexity of multi-slice information management at the SDN controller
Solution Approach 2:
The patent enables the PCECC to pre-calculate BIER-TE paths for multiple slices and store the path information in advance. This preliminary action allows the system to quickly retrieve and use pre-computed paths when needed, reducing the real-time calculation complexity and improving the efficiency of slice-based path management
4Adaptability or versatility
If PCECC is used as centralized label controller, then BIER information can be delivered to BFR nodes, but currently no solution exists for implementing slice association during BIER information delivery
Solution Approach 1:
The patent embeds slice association information within the BIER-TE information structure. The PCECC delivers BIER information to BFR nodes with nested slice identifiers and mapping relationships included in the delivery messages. This nesting approach allows slice association to be maintained throughout the information delivery process without losing slice information, enabling both BIER functionality and slice management in a unified manner
Data Source
AI summary
An information advertising method, a network device, and a computer-readable storage medium are disclosed. The information advertising method may include: receiving, by a first device, a first message carrying mapping information from a second device, the mapping information is used for representing a mapping relationship between target information and a target network resource partition identifier, and one of the first device and the second device is a forwarding node in a Bit Index Explicit Replication (BIER) network.