Node Device Dual Queue Packet Control for Congestion
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current network devices face significant queue congestion issues when handling large quantities of data packets, leading to delayed dequeuing of packets at the tail of the queue, which can cause network inefficiencies.
Innovation Solution
Implementing a packet control method that utilizes two queues within a node device, where packets from isolated data flows are dynamically routed based on queue conditions, allowing for flexible scheduling by determining whether to enter the first or second queue based on preset conditions, thereby mitigating congestion.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Device complexity
If packets are stored in a single queue using FIFO mechanism, then the queue structure is simple, but queue congestion occurs when there are large quantities of packets causing delayed dequeuing of tail packets
Solution Approach 1:
The patent divides the single queue into multiple queues (first queue and second queue) to segment the packet flow. When the first queue meets a preset condition (such as packet count exceeding a threshold), packets are redirected to the second queue. This segmentation resolves the contradiction by maintaining simple queue structures while improving overall transmission efficiency through conditional routing.
2Productivity
If packets are redirected between multiple queues based on congestion conditions, then queue congestion is mitigated, but the control complexity increases
Solution Approach 1:
The patent implements dynamic queue selection based on real-time packet counts and preset conditions. The system monitors the first queue's packet count and dynamically redirects packets to the second queue when thresholds are exceeded. This dynamic control mechanism improves transmission efficiency while keeping the control logic relatively simple through condition-based routing decisions.
3Stability of the object's composition
If tail packets wait in a congested queue, then FIFO order is maintained, but dequeuing time is severely delayed
Solution Approach 1:
The patent extracts packets from the first queue and places them in the second queue when the first queue meets preset conditions (such as packet count exceeding a threshold). This extraction mechanism allows tail packets to be removed from the congested first queue and processed from the second queue, reducing dequeuing delays while maintaining overall transmission order through controlled packet movement.
Data Source
AI summary
A packet control method, a flow table update method, and a node device including a first queue and a second queue, where the method includes: obtaining, by the node device, a first packet; determining, by the node device, that a data flow to which the first packet belongs is marked as an isolated flow; and if the first queue and/or the second queue meet and/or meets a first preset condition, controlling, by the node device, the first packet to enter the first queue and wait to be scheduled; or if the first queue and/or the second queue meet and/or meets a second preset condition, controlling, by the node device, the first packet to enter the second queue and wait to be scheduled.