Priority Transmission Queues for High-Priority Network Traffic

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Existing resource scheduling methods in computer networks, such as FIFO and round robin, fail to prioritize high-priority traffic effectively, leading to delays and inefficiencies, especially in shared bus systems like IEEE 10BASE-T1S, where lower priority traffic can delay high-priority messages, limiting network effectiveness for latency-sensitive applications.

Innovation Solution

Implement a priority transmission scheme that reserves each cycle for specific priorities, allowing nodes to transmit based on priority queues, with options for resetting priority after frame transmission, ensuring high-priority traffic is transmitted first, and incorporating intra-node priority support.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If round robin scheduling is used, then fairness among nodes is maintained, but high-priority traffic experiences delays due to lower priority traffic

Engineering Contradiction:
Improvepriority traffic transmission reliabilityVSAvoidlatency for high-priority traffic
Core Design Contradiction:
ReliabilityVSLoss of time

Solution Approach 1:

The transmission queue is segmented into multiple priority levels (e.g., high priority and low priority queues). The scheduler processes high priority traffic separately from low priority traffic, ensuring that high priority frames are transmitted before low priority frames, thus eliminating the delay caused by round robin scheduling while maintaining fairness within each priority level.

Inventive Principle:
Principle #1Segmentation

2Ease of operation

If FIFO scheduling is used, then simplicity is maintained, but high-priority traffic cannot be effectively prioritized over lower priority traffic

Engineering Contradiction:
Improvescheduling operation simplicityVSAvoidpriority-based transmission reliability
Core Design Contradiction:
Ease of operationVSReliability

Solution Approach 1:

Different quality of service is applied to different priority levels. High priority traffic receives preferential treatment with dedicated transmission opportunities, while low priority traffic follows standard FIFO processing. This local differentiation maintains simplicity within each queue while achieving effective priority-based transmission reliability across the system.

Inventive Principle:
Principle #3Local quality

3Loss of time

If priority queues are implemented, then high-priority traffic latency is reduced, but device complexity increases

Engineering Contradiction:
Improvelatency for high-priority trafficVSAvoidqueue management complexity
Core Design Contradiction:
Loss of timeVSDevice complexity

Solution Approach 1:

The high priority transmission functionality is extracted as a separate, dedicated queue that operates independently from the standard FIFO queue. This extraction allows high priority traffic to be handled with minimal complexity overhead, as it simply requires checking the high priority queue first before processing the standard queue, rather than implementing complex priority arbitration within a single queue.

Inventive Principle:
Principle #2Taking out (Extraction)

4Adaptability or versatility

If existing scheduling schemes are used, then compatibility with current standards is maintained, but network effectiveness for latency-sensitive applications is limited

Engineering Contradiction:
Improvecompatibility with existing standardsVSAvoidnetwork effectiveness for latency-sensitive applications
Core Design Contradiction:
Adaptability or versatilityVSProductivity

Solution Approach 1:

The scheduling system is made dynamic by allowing the selection between different scheduling modes (standard FIFO/round robin and priority-based scheduling). This dynamic capability enables the network to adapt to different application requirements, maintaining compatibility with existing standards when priority scheduling is not needed, while providing enhanced productivity for latency-sensitive applications when priority scheduling is activated.

Inventive Principle:
Principle #15Dynamics

Data Source

PatentUS20250219960A1Apparatuses and methods for priority transmission scheme
Publication Date: 2025.07.03 ANALOG DEVICES INT UNLTD CO
  • US20250219960A1 patent drawing
  • US20250219960A1 patent drawing
  • US20250219960A1 patent drawing

AI summary

Aspects of the present disclosure include a method, a controller, and/or a computer readable medium for providing a first queue having a first plurality of transmission opportunities for a plurality of nodes to transmit first information of a first priority, granting a first permission to at least a first subset of the plurality of nodes to transmit at least a first portion of the first information of the first priority, and replacing, after the transmitting the first information, a second queue having a second plurality of transmission opportunities for the plurality of nodes to transmit second information of a second priority with a third queue having a third plurality of transmission opportunities for the plurality of nodes to transmit third information of a third priority, the third priority being higher than the second priority.