Cyclic Queue Mapping for Deterministic Flow Transmission
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Jitter on transmission links between nodes in 5th Generation System (5GS) and traditional networks affects deterministic flow transmission, necessitating a solution for reliable and synchronized packet forwarding.
Innovation Solution
A deterministic flow transmission method that determines specified queue information for service packets based on a scheduling and forwarding mapping correspondence between nodes, allowing packets to enter designated cyclic scheduling queues, ensuring deterministic forwarding despite asynchronous node clocks.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If traditional packet processing mechanisms are used in 5GS, then network flexibility and adaptability are improved, but jitter is generated affecting deterministic flow transmission
Solution Approach 1:
The patent segments the packet processing mechanism into two distinct paths: a default processing path for general traffic and a deterministic processing path for time-sensitive flows. This segmentation allows the network to maintain flexible default handling while providing guaranteed deterministic transmission for critical flows, resolving the contradiction between adaptability and reliability.
Solution Approach 2:
The patent applies local quality by implementing deterministic processing characteristics specifically at the transmission nodes handling time-sensitive flows, while other nodes can continue using standard flexible processing. This localized application of deterministic processing ensures reliability where needed without compromising overall network adaptability.
2Reliability
If retransmission mechanisms are introduced to realize reliability, then transmission reliability is improved, but jitter is generated affecting deterministic flow transmission
Solution Approach 1:
The patent implements preliminary action by pre-configuring deterministic processing parameters, queue mappings, and forwarding rules at transmission nodes before time-sensitive flows arrive. This preliminary setup eliminates the need for real-time retransmission and dynamic adjustments, ensuring both reliability and deterministic timing without jitter.
3Manufacturing precision
If clock synchronization is implemented between transmission nodes, then deterministic forwarding precision is improved, but system complexity and synchronization overhead are increased
Solution Approach 1:
The patent introduces a deterministic flow identifier as an intermediary that carries timing and queue mapping information between transmission nodes. This identifier enables nodes to coordinate deterministic forwarding without requiring complex clock synchronization mechanisms, as each node independently uses the identifier to determine the appropriate cyclic queue and forwarding timing.
4Reliability
If cyclic scheduling queues are configured at each transmission node, then deterministic forwarding is achieved, but device complexity and configuration overhead are increased
Solution Approach 1:
The patent changes the parameter representation by encoding queue mapping information within the deterministic flow identifier itself rather than maintaining separate complex queue configuration tables. This parameter transformation simplifies device complexity while maintaining deterministic forwarding capability, as nodes can derive queue information directly from the flow identifier.
Data Source
AI summary
Deterministic flow transmission methods and systems, and electronic devices are provided by the present application. In embodiments of the present application, the first service packet sent by the first transmission node within a certain scheduling cycle is specified to enter a certain cyclic scheduling queue of the second transmission node (that is, the specified cyclic scheduling queue), so as to ensure that the first service packet is scheduled and forwarded on time by the second transmission node. As such, even if there is jitter on the transmission link between the first transmission node and the second transmission node, due to both a scheduling cycle for the first transmission node to schedule and transmit the first service packet and a scheduling cycle for the second transmission node to schedule and transmit the first service packet can be directly determined, it can be ensured that the above-mentioned jitter has no influence on deterministic parameters of the first service packet (which is equivalent to de-jittering the above-mentioned jitter), and a deterministic flow transmission for the first service packet is realized.


