CQF Packet Queuing for Deterministic Latency Without Time Synchronization
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
The cyclic queuing and forwarding (CQF) method in packet networks requires precise time synchronization between nodes, leading to malfunctions when transmission delays are large or variable, and necessitates multiple queues and additional packet information transmission.
Innovation Solution
An apparatus and method that ensures deterministic latency by using cycle information extraction and queuing state parameters to manage packet storage and transmission without requiring time synchronization or additional queues, even in asynchronous environments with variable delays.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If the standardized cyclic queuing and forwarding (CQF) method is used to transmit time-sensitive data, then deterministic latency can be guaranteed with predictable packet transmission delay, but precise time synchronization is required between nodes and malfunctions occur when transmission delay of links between nodes is large or variable
Solution Approach 1:
The patent extracts the time synchronization requirement from the CQF method by introducing cycle information extraction and queuing state parameters. Instead of relying on synchronized clocks between nodes, the system uses cycle counters and state tracking to maintain deterministic latency guarantees in asynchronous environments, thereby removing the synchronization complexity while preserving reliability.
Solution Approach 2:
The patent introduces cycle information and queuing state parameters as intermediary mechanisms between nodes. These intermediaries enable nodes to coordinate packet transmission and reception without direct time synchronization, using cycle counters and state tracking to manage timing relationships in asynchronous networks.
2Reliability
If the standardized cyclic queuing and forwarding (CQF) method is used to transmit time-sensitive data, then deterministic latency can be guaranteed, but multiple queues and additional packet information transmission are required
Solution Approach 1:
The patent makes the single queue perform multiple functions by introducing queuing state parameters that track packet positions and transmission states. The queue handles both storage and timing coordination functions, eliminating the need for separate queues for different packet types or states, thereby reducing structural complexity while maintaining deterministic latency guarantees.
Solution Approach 2:
The patent enables the queue management system to self-track packet states and cycle information without external control mechanisms. By incorporating state parameters directly into the queue operations, the system autonomously manages packet transmission timing and coordination, reducing the need for additional control queues or information transmission.
Data Source
AI summary
An apparatus and method for guaranteeing deterministic latency in a communication system is proposed. The method of operating enqueue packet processing may include extracting cycle information of a received packet from the received packet, identifying at least one of enq_myQ, enq_mateQ, and enq_mateQ_hold states of a queuing state parameter of an enqueue process for a previous packet for each flow at a reception node, identifying whether a cycle parameter for performing a CQF operation for the previous packet for each flow in the reception node is the same as a cycle parameter for performing the current CQF operation, identifying whether a cycle parameter included in the previously received packet for each flow in the reception node is the same as a cycle parameter included in a currently received packet, and storing (enqueuing) the received packet on the basis of the identifying processes and storing information about the received packet.