Multicast Packet Replication With Explicit Link Selection
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing multicast technologies suffer from inefficiencies in packet replication and forwarding due to random link selection and lack of explicit link information in packet headers, leading to suboptimal performance.
Innovation Solution
The proposed method and apparatus provide destination information in multicast packets that not only indicate forwarding and replication operations but also specify the links for each replicated packet, using identifiers to index and manage the replication process, allowing for flexible and efficient packet handling.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Device complexity
If random link selection is used for multicast packet transmission, then device complexity is reduced, but transmission efficiency deteriorates
Solution Approach 1:
The patent applies preliminary action by pre-establishing correspondence relationships between destination information and communication links before multicast packet transmission. The network device pre-configures multiple destination information entries, each associated with a specific communication link, so that when a multicast packet arrives, the appropriate link can be directly determined without random selection, thereby improving transmission efficiency while maintaining manageable system complexity
Solution Approach 2:
The patent implements self-service by embedding destination information directly in the multicast packet header that contains link identification. The packet itself carries the information needed to determine its transmission path, eliminating the need for complex external link selection mechanisms. The correspondence relationship between destination information and links is maintained in a manner that allows efficient automatic determination
2Productivity
If explicit link information is added to packet headers, then transmission efficiency is improved, but device complexity increases
Solution Approach 1:
The patent applies universality by designing destination information to serve multiple functions simultaneously. The destination information field in the packet header not only identifies the final destination but also encodes link selection information. This multi-functionality allows the same data structure to support both routing and link determination without requiring separate fields, thereby improving transmission efficiency while limiting the increase in device complexity
Solution Approach 2:
The patent uses copying by creating multiple destination information entries that can be replicated and associated with different communication links. Instead of complex processing, the system copies destination information patterns and links them to specific links, allowing efficient determination of transmission paths through simple pattern matching and replication
3Adaptability or versatility
If multiple destination information entries are maintained, then adaptability is improved, but device complexity increases
Solution Approach 1:
The patent applies segmentation by dividing the destination information into multiple independent entries, each associated with a specific communication link. This segmentation allows the system to maintain multiple routing options without creating a single complex routing table. Each entry can be independently managed and selected based on the packet's requirements, improving adaptability while keeping individual entry complexity low
Solution Approach 2:
The patent uses an intermediary approach by establishing a correspondence relationship as a mediator between destination information and communication links. This intermediary layer (the association table or mapping structure) allows multiple destination information entries to be maintained without directly increasing the complexity of packet processing. The intermediary handles the complexity of managing multiple entries while presenting a simple interface for packet routing decisions
Data Source
AI summary
The present disclosure relates to multicast packet processing methods. One example method includes obtaining a first multicast packet, where destination information of the first multicast packet includes a first identifier indicating link information, a second identifier indicating a replication and forwarding operation, and a third identifier used to index destination information corresponding to a second node, obtaining a second multicast packet based on the first multicast packet and the third identifier, obtaining a third multicast packet, where destination information of the third multicast packet is destination information corresponding to a third node that is determined based on a destination information index corresponding to a multicast packet obtained after the first multicast packet is replicated, sending the second multicast packet to the second node based on the first identifier, and sending the third multicast packet to the third node based on the destination information of the multicast packet.