Service Scheduling Device Token Threshold Configuration

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Existing communication systems using token bucket traffic shaping methods face issues with high delay and jitter in high priority queues due to the consumption of tokens by long packets in low priority queues, leading to delayed transmission of subsequent high priority services.

Innovation Solution

Configuring token thresholds according to queue priorities, where the low priority queue has a higher token threshold than the high priority queue, allowing services to be sent when the token count is greater than or equal to the respective threshold, and ensuring that the difference between the thresholds is not smaller than the maximum packet length, thereby reducing token restoration time and enabling quicker transmission of high priority services.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Device complexity

If a single token bucket is shared by queues of different priorities, then the device complexity is reduced, but the delay and jitter of high priority services increase when low priority queues send long packets

Engineering Contradiction:
Improvetoken bucket structureVSAvoiddelay and jitter of high priority services
Core Design Contradiction:
Device complexityVSLoss of time

Solution Approach 1:

The patent segments the single shared token bucket into multiple priority-specific token buckets, where each priority level has its own token bucket with dedicated token thresholds. This segmentation allows high priority queues to have guaranteed token availability independent of low priority queue transmissions, resolving the contradiction by reducing device complexity through structured organization while eliminating delay and jitter for high priority services.

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The patent applies local quality by assigning different token threshold characteristics to different priority levels. High priority queues are allocated token buckets with lower thresholds that are easier to replenish, while low priority queues have higher thresholds. This localized differentiation ensures that each priority level receives appropriate resource allocation, preventing low priority long packets from causing high priority delay and jitter while maintaining overall system efficiency.

Inventive Principle:
Principle #3Local quality

2Productivity

If token thresholds are set high to allow low priority queue transmission, then productivity of low priority services improves, but delay and jitter of subsequent high priority services increase

Engineering Contradiction:
Improvetransmission efficiency of low priority servicesVSAvoiddelay and jitter of high priority services
Core Design Contradiction:
ProductivityVSLoss of time

Solution Approach 1:

The patent implements dynamic token threshold management where each priority level has its own token bucket with dynamically adjustable thresholds. The system can dynamically allocate tokens based on current network conditions and priority requirements, allowing low priority queues to transmit when tokens are abundant while ensuring high priority queues always have access to sufficient tokens. This dynamic approach resolves the contradiction by enabling flexible resource allocation that optimizes both productivity and timing performance.

Inventive Principle:
Principle #15Dynamics

Solution Approach 2:

The patent changes the parameter of token thresholds from a single unified value to multiple priority-specific values. By setting different token thresholds for different priority levels (with high priority having lower thresholds), the system allows low priority services to achieve good productivity when tokens are available while ensuring high priority services experience minimal delay and jitter through their dedicated lower thresholds that are replenished independently.

Inventive Principle:
Principle #35Parameter changes

3Quantity of substance

If tokens are consumed by long packets in low priority queues, then the token bucket needs to be refilled, but this causes high priority services to wait until tokens are restored

Engineering Contradiction:
Improvetoken consumption and restorationVSAvoidwaiting time for high priority services
Core Design Contradiction:
Quantity of substanceVSLoss of time

Solution Approach 1:

The patent segments the token restoration process into priority-specific streams by providing separate token buckets for each priority level. When tokens are consumed by long packets in low priority queues, only the low priority token bucket is affected, while high priority token buckets maintain their token levels independently. This segmentation eliminates the waiting time for high priority services by decoupling their token restoration from low priority queue activity.

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The patent applies preliminary action by pre-allocating dedicated token buckets to each priority level with predetermined threshold values. High priority queues are pre-configured with token buckets that have lower thresholds and are replenished with higher priority, ensuring that tokens are available in advance before low priority queues need to transmit. This preliminary preparation prevents high priority services from having to wait for token restoration after low priority packet transmission.

Inventive Principle:
Principle #10Preliminary action

Data Source

PatentEP2466824B1Service scheduling method and device
Publication Date: 2014.05.21 HUAWEI TECH CO LTD
  • EP2466824B1 patent drawingFigure 1~2
  • EP2466824B1 patent drawingFigure 3
  • EP2466824B1 patent drawingFigure 4

AI summary

A service scheduling method and device are disclosed by the present invention, which solve the problem of large delay and jitter of a service in a high priority queue in the prior art. The service scheduling method includes: allocating token thresholds to queues according to priorities of the queues, where a token threshold corresponding to a low priority queue is greater than a token threshold corresponding to a high priority queue; and determining the number of tokens in a token bucket when the queue needs to be sent, stopping sending the queue if the number of the tokens is smaller than the token threshold, and sending the queue if the number of the tokens is greater than the token threshold. The service scheduling method and device are mainly used for various network services, such as a protocol message service, a voice message service, and a 1588 message service.