CQF Packet Forwarding Without Node Synchronization
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
In large-scale deterministic networks, achieving timely synchronization between nodes is challenging for Cyclic Queuing and Forwarding (CQF) mechanisms, making it difficult to provide effective deterministic forwarding services.
Innovation Solution
A method for packet forwarding that determines a flow identifier, basic time slot number, and time slot offset for each packet, allowing nodes to perform cyclic scheduling without requiring time synchronization between nodes, using existing packet headers and avoiding modifications to packet encapsulation.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If Cyclic Queuing and Forwarding (CQF) mechanism is used to provide deterministic forwarding service, then forwarding determinism is improved, but time synchronization requirement increases system complexity
Solution Approach 1:
The patent introduces a controller as an intermediary that centrally manages and distributes time slot offset information to all network nodes. This mediator handles the synchronization coordination, freeing individual nodes from complex peer-to-peer synchronization requirements while maintaining deterministic forwarding guarantees through controlled time slot allocation.
Solution Approach 2:
The patent transforms the synchronization approach by changing from absolute time synchronization to relative time slot offset synchronization. Each node uses a flow identifier to determine its specific time slot offset, converting a complex timing coordination problem into a simpler parameter lookup and application process based on flow identification.
2Reliability
If time synchronization between nodes is implemented in large-scale networks, then CQF mechanism effectiveness is improved, but synchronization timeliness deteriorates
Solution Approach 1:
The patent performs preliminary action by pre-calculating and distributing time slot offset information for each flow identifier through the controller before packets are forwarded. Nodes receive and store these offset values in advance, eliminating the need for real-time synchronization calculations during packet forwarding, thus ensuring both effectiveness and timeliness.
Solution Approach 2:
The patent provides beforehand cushioning by establishing a control plane mechanism that pre-distributes synchronization parameters to all nodes. This preparatory synchronization setup cushions against potential timing issues during data plane operations, ensuring deterministic forwarding can proceed without real-time synchronization delays.
3Reliability
If CQF technology is directly reused in large-scale networks, then deterministic forwarding service is improved, but node synchronization capability requirement increases
Solution Approach 1:
The patent segments the synchronization function into two independent parts: a control plane that handles synchronization parameter distribution through the controller, and a data plane that simply applies pre-received time slot offsets. This segmentation allows nodes to maintain simple synchronization capabilities while the system as a whole achieves deterministic forwarding service.
Solution Approach 2:
The controller acts as an intermediary that bridges the gap between CQF mechanism requirements and node capabilities. It translates complex synchronization requirements into simple flow-identifier-based offset lookups that nodes can easily implement, enabling deterministic forwarding without requiring advanced node synchronization capabilities.
Data Source
AI summary
A packet forwarding method, an electronic device, and a storage medium are disclosed. The method may include: determining a flow identifier of the service flow; determining a basic time slot number of a first packet in the service flow according to the flow identifier; determining a time slot offset of the first node for the service flow according to the flow identifier; and determining an enqueue slot number of the first packet according to the basic time slot number and the time slot offset.