Multicast Forwarding Equivalence Class Aggregation
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current network routing technologies face inefficiencies in memory occupation and protocol packet processing due to the lack of effective methods for managing multicast data packets, particularly in multimedia services like IPTV, where each multicast group requires significant memory and processing resources.
Innovation Solution
The implementation of a Multicast Forwarding Equivalence Class (MFEC) system, which classifies and aggregates multicast data packets passing through the same distribution tree or sub-tree, using shared forwarding instruction information to reduce memory occupation and improve routing efficiency by sending join packets based on MFEC units instead of individual (S,G) or (*,G) addresses.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If individual (S,G) or (*,G) address pairs are used to manage multicast groups, then each multicast group can be independently managed, but memory occupation and processing resources increase significantly
Solution Approach 1:
The patent merges multiple individual (S,G) or (*,G) address pairs into a single MFEC (Multicast Forwarding Equivalence Class) when they share the same distribution tree or sub-tree. This combining approach reduces the number of separate forwarding instruction information entries from O(N) to O(1) per MFEC, directly resolving the memory occupation issue while preserving the ability to manage different multicast groups through the MFEC framework
2Reliability
If separate routing forwarding states are established for each multicast group, then precise control over each group is achieved, but protocol packet processing efficiency decreases
Solution Approach 1:
The patent combines multiple separate routing forwarding states into a single shared state identified by MFEC. Multiple (S,G) or (*,G) address pairs that traverse the same distribution tree are merged into one MFEC with a single forwarding instruction information entry, reducing processing overhead from O(N) operations to O(1) operations per packet while maintaining precise control through the structured MFEC composition
3Reliability
If join packets are sent for each individual (S,G) or (*,G) address pair, then complete multicast group joining is ensured, but routing convergence time increases
Solution Approach 1:
The patent merges multiple individual join packet operations into a single join packet operation at the MFEC level. Instead of sending separate join packets for each (S,G) or (*,G) address pair, the system sends one join packet per MFEC that simultaneously establishes the distribution tree for all constituent multicast groups, reducing convergence time from O(N) to O(1) while ensuring complete joining through the comprehensive MFEC scope
Data Source
AI summary
A multicast method includes joining a multicast group and forwarding a multicast data packet; during joining the multicast group, establishing multicast forwarding instruction information identified by a MFEC, on a network node of a distribution tree or a distribution sub-tree to which the MFEC pertains; and during forwarding the multicast data packet, forwarding multicast data packets of the same MFEC, according to the multicast forwarding instruction information. The invention further discloses a multicast method, including: classifying a collection of multicast data packets forwarded in the same mode into a MFEC; statically configuring multicast forwarding instruction information identified by the MFEC on a network node of a distribution tree or a distribution sub-tree to which the MFEC pertains; and forwarding the multicast data packets of the same MFEC, according to the multicast forwarding instruction information. The invention further discloses a multicast routing method.