Embedded Multicast Routing for Scalable Packet Forwarding
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing multicast technologies, such as PIM-SM, face scalability issues due to the need for maintaining a multicast forwarding information base for each flow, leading to network resource inefficiency and congestion.
Innovation Solution
A communication method that embeds multicast routing information into packets, allowing nodes to determine their own routing information based on embedded identifiers, reducing redundant packet transmission and optimizing resource usage.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If multicast forwarding information base is maintained for each multicast flow in PIM-SM, then multicast routing can be achieved, but scalability deteriorates due to serious scalability problems
Solution Approach 1:
The patent extracts the multicast routing information from the traditional MFIB table structure and embeds it directly into packet headers. This removes the need for maintaining large MFIB tables at each router, thereby improving scalability while preserving multicast routing capability. The routing information is carried in a compact form within the packet itself rather than being stored in extensive database structures.
Solution Approach 2:
Instead of having routers maintain routing tables and look up forwarding information (traditional approach), the patent inverts the approach by having packets carry their own routing information. Child nodes determine their own routing information from embedded identifiers rather than receiving it from upstream nodes, fundamentally changing the direction of information flow and improving system scalability.
2Ease of operation
If data is duplicated into multiple copies based on quantity of receive ends, then multicast delivery can be achieved, but network resource utilization deteriorates due to repeated transmission on some links
Solution Approach 1:
The patent implements self-service by enabling each child node to autonomously determine its own routing information using embedded identifiers and local calculations. This eliminates the need for upstream nodes to perform complex routing decisions and packet duplication, reducing processing overhead and improving network efficiency. Each node serves itself by computing its routing path independently.
3Extent of automation
If upstream nodes determine multicast routing information for all child nodes, then complete routing control can be achieved, but processing resources of upstream nodes deteriorate due to excessive computational burden
Solution Approach 1:
The patent segments the routing control function by dividing it between upstream nodes (which embed routing identifiers in packets) and child nodes (which determine their own routing information). This segmentation distributes the computational burden, allowing upstream nodes to perform only lightweight identifier embedding while child nodes handle the routing determination, thereby reducing the processing resources required at upstream nodes.
Data Source
Figure 1A
Figure 1B(a)~1B(b)
Figure 2(a)~3B
AI summary
This application provides a communication method and an apparatus, to improve packet scalability. The method includes: A first node receives a first packet from a second node, and parses the first packet. The first packet includes multicast routing information of the second node, and the first node is a child node of the second node in a multicast tree. A multicast routing identifier of a node is used by a non-leaf child node of the node in the multicast tree to determine multicast routing information of the non-leaf child node, and multicast routing information of a node includes a multicast routing identifier of the node and multicast routing information of a non-leaf child node of the node in the multicast tree.