Multicast Forwarding Tree Construction in Ethernet Networks
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current Shortest Path Bridging (SPB) technologies consume excessive computational resources and multicast forwarding/filter entries due to the need for building multiple trees per source node and using source-specific multicast addresses, leading to inefficiencies in Ethernet-based networks.
Innovation Solution
The method determines a designated node within the network using a commonly agreed mechanism, computes a single *,G tree for multicast paths, and selects only the shortest paths traversing each node for inclusion in the forwarding tree, reducing computational resource consumption and multicast entries.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If source-specific multicast trees are built for each source node, then multicast traffic can be forwarded along optimal paths, but computational resource consumption increases proportionally to the number of nodes in the network
Solution Approach 1:
The patent merges multiple source-specific trees into a single shared multicast tree structure. Instead of building separate shortest path trees for each source node, the invention creates one unified tree that accommodates multicast traffic from multiple sources, thereby reducing computational overhead while maintaining efficient path selection.
Solution Approach 2:
The patent implements a universal multicast tree structure that serves multiple source nodes simultaneously. This single tree structure performs the function of multiple source-specific trees, allowing any source node to utilize the same tree for multicast forwarding without requiring separate computational resources for each source.
2Adaptability or versatility
If multiple active topologies are maintained for different service instances, then service-specific multicast forwarding is enabled, but the number of multicast forwarding entries consumed at each node increases
Solution Approach 1:
The patent segments the network into multiple service instance subsets, where each subset shares a common multicast tree. This segmentation allows different service instances to be grouped efficiently, reducing the total number of forwarding entries required at each node while still supporting service-specific requirements.
Solution Approach 2:
The patent changes the parameter of tree construction from source-specific to subset-specific. By organizing multicast trees based on service instance subsets rather than individual sources, the system reduces the number of trees and corresponding forwarding entries while maintaining the ability to support multiple service instances with different requirements.
Data Source
Figure 1
Figure 2
Figure 3
AI summary
Method for determining shortest path bridging (SPB) of multicast frames within a communications network comprises at each of a plurality of nodes within the network, determining a designated node (DN) according to a commonly agreed mechanism; at each of the plurality of nodes, determining a shortest path between the DN and each of the plurality of nodes; and at each of the plurality of nodes, selecting for inclusion in a respective forwarding tree for multicast only those determined shortest paths from the DN traversing the respective node.