Low Latency Queue for Switch Packet Forwarding
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing switch or router systems experience high transmission delays when forwarding data packets due to the need for block storage spaces to be fully filled before forwarding, leading to increased waiting times, especially for packets with small traffic flows.
Innovation Solution
Implementing a method that monitors the storage status of packet queues and stores data packets in low latency queues when the traffic flow is low, allowing for immediate forwarding when the traffic flow meets a threshold, thereby reducing delay.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Quantity of substance
If data packets are stored in block storage space until fully filled before forwarding, then storage efficiency is improved, but transmission delay increases
Solution Approach 1:
The patent divides the storage system into two distinct queue types: packet queues for high-traffic flows and low latency queues for small traffic flows. This segmentation allows different forwarding policies to be applied to different traffic types, enabling immediate forwarding of small packets while maintaining efficient bulk storage for large flows.
Solution Approach 2:
The system dynamically selects the appropriate queue type based on real-time traffic flow characteristics. When a data packet arrives, the system evaluates its traffic flow size and routes it to the appropriate queue (packet queue or low latency queue), enabling adaptive response to varying network conditions and minimizing delay for time-sensitive packets.
2Productivity
If data packets wait for block storage space to be fully filled, then bandwidth utilization is improved, but resource efficiency deteriorates
Solution Approach 1:
The patent applies different quality characteristics to different storage locations: packet queues use a fill-up-before-forwarding policy optimized for bandwidth utilization, while low latency queues use an immediate-forwarding policy optimized for resource efficiency. This local differentiation allows each queue type to operate at optimal efficiency for its intended purpose.
Data Source
AI summary
The present application provides a method for forwarding a data packet, and an electronic device and a non-volatile computer-readable storage medium therefor. The method includes: receiving a target data packet including first address information; acquiring a storage status of a packet queue corresponding to the target data packet, wherein the packet queue is adapted to store data packets with address information consistent with the first address information; storing, when the storage status is determined as a first state, the target data packet into a first-class block storage space corresponding to a low latency queue, wherein the first state represents a non-congestion state; and forwarding, when a first condition is met, a first data packet stored in the first class block storage space.