Meta-Packets for Efficient Packet Reassembly in Queuing Systems
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing packet processing systems face inefficiencies in reassembling packet fragments due to limited scalability and high processor bandwidth requirements, particularly in handling protocols like MLPPP, LFI, and FRF, where fragments may arrive in arbitrary orders and need to be reassembled.
Innovation Solution
The introduction of meta-packets, which are special packets containing instructions for building a desired packet from identifiable storage locations, allowing for efficient reassembly and other packet processing operations while preserving packet ordering, and enabling coexistence with conventional packets in the same queuing system.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If traditional full-packet storage and scatter/gather approaches are used for packet reassembly, then packet reassembly capability is provided, but processor bandwidth requirements increase and scalability is limited
Solution Approach 1:
The patent introduces meta-packets as intermediary data structures that mediate between packet fragments and the reassembly process. Meta-packets contain metadata about fragment locations and assembly instructions, allowing the system to track and reassemble packets without requiring high processor bandwidth for direct fragment management. This intermediary layer reduces the processing burden while maintaining reassembly capability.
Solution Approach 2:
The patent segments the packet processing function into separate components: packet reception, fragment buffering, meta-packet generation, and reassembly execution. By dividing the reassembly process into discrete segments handled by different system components, the patent improves scalability and reduces processor bandwidth requirements while maintaining efficient packet reassembly.
2Productivity
If dynamic tracking and accessing of packet fragments is implemented, then packet reassembly is achieved, but processor bandwidth consumption increases
Solution Approach 1:
The patent performs preliminary actions by pre-generating meta-packets that contain all necessary information about packet fragment locations and assembly instructions before the actual reassembly process. This preliminary organization of data allows the reassembly operation to proceed efficiently without requiring intensive dynamic tracking and accessing, thereby reducing processor bandwidth consumption during the critical reassembly phase.
3Adaptability or versatility
If limited reassembly techniques are used for MLPPP, LFI, and FRF protocols, then protocol-specific reassembly is provided, but system scalability is restricted
Solution Approach 1:
The patent implements a universal meta-packet structure and reassembly mechanism that can handle multiple protocols (MLPPP, LFI, FRF, and others) through a single scalable framework. The meta-packet design incorporates protocol-agnostic fields that can accommodate different fragmentization schemes, allowing the system to support various protocols without requiring separate specialized techniques for each, thereby improving scalability while maintaining protocol adaptability.
Data Source
AI summary
Meta-packets are used to more efficiently reassemble packets and to more efficiently conduct other packet processing operations. The meta-packets are special types of packets which are interpreted by hardware in a queuing system. Instead of directly containing data, the meta-packet packets contain instructions for building a desired packet from various identifiable storage locations in the packet processor system. Because the reassembled packet replaces the meta-packet, packet ordering is preserved.