Packet Scheduling for Low-Latency VR Transfer

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Current packet transfer methods, such as CoDel and FQ, incur queuing delays and packet loss during high-resolution image transfer in VR applications, especially when multiple flows compete for bandwidth, making it difficult to achieve low latency and fairness in packet transmission.

Innovation Solution

A packet transfer apparatus with a scheduling unit that controls packet extraction based on requested data amounts and burst transmission, restricting packet extraction to maintain fairness and reduce queuing delay by calculating the maximum burst amount based on the number of communication flows and packet transmission rate.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Adaptability or versatility

If FQ (Fair Queuing) is used to ensure fairness between communication flows, then fairness is improved, but packet transmission speed deteriorates due to sequential processing of packets from multiple flows

Engineering Contradiction:
Improvefairness between communication flowsVSAvoidpacket transmission speed
Core Design Contradiction:
Adaptability or versatilityVSSpeed

Solution Approach 1:

The patent segments packets into different types (first type requiring continuous transmission, second type ordinary packets) and applies different scheduling strategies to each segment. First type packets are transmitted continuously without interruption from other flows, while second type packets are processed using traditional fair queuing, thus resolving the contradiction between fairness and transmission speed.

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The patent dynamically adjusts the packet extraction amount based on the type of packet being processed. When a first type packet is detected, the system switches to a mode that extracts only that packet type continuously, whereas for second type packets, it returns to balanced fair queuing extraction, making the scheduling behavior adaptive to real-time requirements.

Inventive Principle:
Principle #15Dynamics

2Loss of time

If CoDel or PIE is used to reduce queuing delay by increasing packet discard probability, then queuing delay is improved, but packet loss increases causing block noise in real-time image transfer

Engineering Contradiction:
Improvequeuing delayVSAvoidpacket loss rate
Core Design Contradiction:
Loss of timeVSReliability

Solution Approach 1:

The patent applies different quality treatment to different packet types: first type packets (critical for real-time images) are protected from discarding and given priority continuous transmission, while second type packets can be subject to traditional CoDel/PIE discard policies. This localized quality differentiation resolves the contradiction between reducing queuing delay and maintaining reliability.

Inventive Principle:
Principle #3Local quality

3Productivity

If multiple flows compete for bandwidth using traditional queuing methods, then bandwidth utilization is improved, but queuing delay increases for individual flows

Engineering Contradiction:
Improvebandwidth utilizationVSAvoidqueuing delay
Core Design Contradiction:
ProductivityVSLoss of time

Solution Approach 1:

The patent ensures continuous transmission of first type packets without interruption by other flows, maintaining an uninterrupted useful action for critical data. This continuity eliminates queuing delays for important packets while still allowing other flows to utilize bandwidth during periods when first type packets are not being transmitted, thus resolving the contradiction between bandwidth utilization and queuing delay.

Inventive Principle:
Principle #20Continuity of useful action

Data Source

PatentUS11477121B2Packet transfer apparatus, method, and program
Publication Date: 2022.10.18 NIPPON TELEGRAPH & TELEPHONE CORP
  • US11477121B2 patent drawing
  • US11477121B2 patent drawing
  • US11477121B2 patent drawing

AI summary

A packet transfer apparatus is configured to perform packet exchange processing for exchanging multiple continuous packets with low delay while maintaining fairness between communication flows of the same priority level. The packet transfer apparatus includes: a packet classification unit; queues that holds the classified packets for each classification; and a dequeue processing unit that extracts packets from the queues. The dequeue processing unit includes a scheduling unit that controls the packet extraction amount extracted from the queue for a specific communication flow based on information on the amount of data that is requested by the communication flow and is to be continuously transmitted in packets.