Packet Aggregation for Bandwidth Bottleneck Resolution
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
In wireless mesh and ad hoc networks, upstream packets occupy high network bandwidth, leading to bandwidth bottlenecks and potential service disruptions in larger networks.
Innovation Solution
Packets with the same service types and final destination addresses are aggregated to manage bandwidth more efficiently, by constructing packets with a service type, final destination address, and residual times to aggregation (RTA), and determining remaining cache capacity to limit transfer delay and alleviate bandwidth pressure.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Speed
If packets are transmitted individually in upstream direction, then each packet can be sent immediately without waiting, but network bandwidth is occupied excessively and bandwidth bottlenecks occur
Solution Approach 1:
The patent merges multiple individual packets into a single aggregated packet for transmission. The network device receives multiple packets from different source nodes, combines them into one aggregated packet with a group identifier, and transmits this single packet to the root node. This merging approach reduces the total number of transmissions, decreases bandwidth consumption, and eliminates the need for separate acknowledgments for each individual packet, thereby resolving the contradiction between transmission speed and bandwidth consumption.
2Quantity of substance
If packet aggregation is implemented, then bandwidth consumption is reduced and transmission efficiency improves, but transfer delay increases due to waiting for aggregation
Solution Approach 1:
The patent implements dynamic packet aggregation where the network device continuously monitors incoming packets and their characteristics. The aggregation process is not static but adapts based on real-time network conditions, packet types, and timing. Packets are aggregated dynamically until aggregation conditions are met (such as receiving a specified number of packets or reaching a time threshold), at which point the aggregated packet is transmitted. This dynamic approach allows the system to balance between waiting for aggregation (reducing bandwidth consumption) and transmitting promptly (minimizing delay), thereby resolving the contradiction between bandwidth efficiency and transfer delay.
3Productivity
If packets are aggregated into larger groups, then fewer transmissions are needed and bandwidth is saved, but aggregation time increases and service responsiveness decreases
Solution Approach 1:
The patent changes key parameters of the aggregation process to optimize the balance between transmission efficiency and aggregation time. Specifically, the system adjusts the packet type identification parameters, group identifier parameters, and timing parameters dynamically. By modifying these parameters based on network conditions and service requirements, the system can achieve efficient aggregation without excessive waiting time, thereby resolving the contradiction between transmission efficiency and aggregation time.
4Reliability
If individual packet transmission is used, then service responsiveness is maintained, but network bandwidth is excessively consumed affecting normal service operation
Solution Approach 1:
The patent introduces an intermediary aggregation mechanism between individual packet sources and the root node. The network device acts as an intermediary that receives individual packets, aggregates them into groups, and forwards the aggregated packets to the root node. This intermediary layer maintains service responsiveness by ensuring timely transmission of aggregated packets while significantly reducing overall bandwidth consumption by consolidating multiple individual transmissions into fewer aggregated transmissions, thereby resolving the contradiction between service responsiveness and bandwidth consumption.
Data Source
Figure 1~2
Figure 3
Figure 4
AI summary
Embodiments of the present invention provide a packet processing method and apparatus. The method includes: generating, by a first node, a first packet based on first data of the first node, where the first packet includes a packet header, and the packet header of the first packet includes a service type, a final destination address, and residual times to aggregation RTA; when the RTA of the first packet is not 0, determining, by the first node, a remaining capacity in a first cache corresponding to the service type and the final destination address, where the first cache stores a second packet; and when a data length of the first packet is not greater than the remaining capacity, aggregating, by the first node, the first packet and the second packet into a third packet, where a packet header of the third packet includes the RTA of the third packet, and the RTA of the third packet is a minimum value in the RTA of the second packet and a value obtained after 1 is subtracted from the RTA of the first packet. Packets that have same service types and destination addresses are aggregated, so as to resolve the following problem: Upstream packets occupy high network bandwidth, which affects normal running of a service.