Schedule Alignment of Time-Sensitive Packet Flows

Resolve Bottlenecks,
Find Innovative SolutionsGenerate Solutions

Solution Overview

Problem

Existing network systems require explicit requests from application programs to utilize scheduled data flows for time-sensitive traffic, limiting the ability to automatically provide expedited service to time-sensitive data streams and leading to resource consumption and delays due to packet queuing, especially in heavily utilized networks.

Innovation Solution

A classification mechanism automatically identifies and sequences time-sensitive data flows without explicit requests, using sequence-aware switches to reserve appointments and align packets with existing or new schedules, ensuring expedited handling while non-scheduled traffic is handled on a best-effort basis.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Extent of automation

If explicit requests from application programs are required to utilize scheduled data flows, then application programs can control their own traffic handling, but automatic provision of expedited service to time-sensitive data streams is limited

Engineering Contradiction:

Improveautomatic identification and sequencing of time-sensitive data flowsVSAvoidclassification mechanism complexity

Core Design Contradiction:

Extent of automationVSDevice complexity

Solution Approach 1:

The system enables self-service by allowing time-sensitive data flows to be automatically identified and sequenced by the network infrastructure itself, without requiring explicit requests from application programs. The classification mechanism autonomously detects time-sensitive traffic patterns and applies appropriate scheduling, making the network self-aware of quality requirements.

Inventive Principle:

Principle #25Self-service

Solution Approach 2:

The classification mechanism performs preliminary identification and categorization of data flows before they enter the scheduling system. By pre-classifying traffic as time-sensitive or non-time-sensitive, the system prepares the groundwork for expedited handling without requiring application-level intervention during actual data transmission.

Inventive Principle:

Principle #10Preliminary action

2Productivity

If packet queuing is used in heavily utilized networks, then network resources can be efficiently utilized, but delays occur in time-sensitive packet delivery

Engineering Contradiction:

Improvenetwork resource utilizationVSAvoidpacket queuing delay

Core Design Contradiction:

ProductivityVSLoss of time

Solution Approach 1:

The network traffic is segmented into distinct categories: time-sensitive packets and non-time-sensitive packets. This segmentation allows the system to apply different handling mechanisms to different packet types, ensuring that time-sensitive packets receive priority treatment while maintaining overall network utilization through efficient resource allocation.

Inventive Principle:

Principle #1Segmentation

Solution Approach 2:

Different quality of service treatments are applied locally to different packet types within the same network infrastructure. Time-sensitive packets receive expedited service with minimal queuing, while non-time-sensitive packets utilize standard queuing mechanisms, allowing each packet type to receive appropriate local treatment based on its requirements.

Inventive Principle:

Principle #3Local quality

3Reliability

If scheduled data flows are reserved for time-sensitive traffic, then delivery without delay or jitter is achieved, but non-scheduled traffic may experience interference and increased queuing

Engineering Contradiction:

Improvetime-sensitive packet delivery reliabilityVSAvoidnon-scheduled traffic throughput

Core Design Contradiction:

ReliabilityVSProductivity

Solution Approach 1:

The scheduling system employs periodic time slots for scheduled data flows, creating regular intervals where time-sensitive packets are guaranteed transmission opportunities. Between these periodic scheduled slots, non-scheduled traffic can utilize available bandwidth, creating a rhythm that protects time-sensitive traffic while allowing flexible use of remaining capacity.

Inventive Principle:

Principle #19Periodic action

Solution Approach 2:

The system maintains continuous network operation by ensuring that while some time slots are reserved for scheduled flows, the remainder of the network capacity remains continuously available for non-scheduled traffic. This continuity prevents idle bandwidth and maintains overall network productivity despite reservations for time-sensitive packets.

Inventive Principle:

Principle #20Continuity of useful action

Data Source

PatentUS7411971B2Systems and methods for the schedule alignment of packet flow

Publication Date: 2008.08.12 ARLINGTON TECHNOLOGIES LLC

AI summary

A classification mechanism automatically aligns time-sensitive data streams to sequences (schedules), according to information in the packets or other information and classification criteria specified by a human network administrator, a sequence agent, an application program or otherwise. When a packet arrives at a first sequence-aware switch along a path, the packet is aligned to a new or existing sequence. When a new sequence is established, appointments are reserved at sequence-aware switches along the path. The packet is placed in a queue, based on its classification. When the packet reaches the head of the queue, at that queue's appointment time, the switch forwards the packet along the path. If possible, appointments have been reserved at subsequent switches along the packet's path, so the packet can be forwarded through the subsequent switches without delay. Packets that do not match any classification criteria are handled on a best-effort basis.