Phase-Based Telecom Data Stream Scheduling for Time-Critical Delivery
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current telecommunication networks face challenges in efficiently managing time-critical data transmission while minimizing network fragmentation and reducing node requirements, particularly when handling both hard real-time and non-time critical data applications.
Innovation Solution
A computer-implemented method for scheduling data streams through a telecommunication network, where each stream is assigned to a phase based on its repetition rate, with phases determined iteratively to minimize interference and meet time constraints, allowing for deterministic and efficient data transfer.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If multiple telecommunication networks based on different standards are used to handle different data transmission requirements, then time-critical data can be transmitted reliably, but network fragmentation increases and overall system complexity rises
Solution Approach 1:
The patent segments data streams into different priority classes (hard real-time, soft real-time, non-real-time) and assigns them to different transmission phases within a single network. This allows differentiated service levels without requiring separate physical networks, thus maintaining reliability while reducing fragmentation.
Solution Approach 2:
The patent implements a universal scheduling mechanism that handles multiple types of data streams (hard real-time, soft real-time, non-real-time) within a single telecommunication network using standardized Ethernet protocols. This multi-functional approach eliminates the need for multiple specialized networks while maintaining the reliability required for time-critical applications.
2Device complexity
If a single telecommunication network is used for all applications including hard real-time data, then network fragmentation is reduced, but node requirements and overall costs increase
Solution Approach 1:
The patent applies local quality by assigning different transmission characteristics to different data streams based on their specific requirements. Hard real-time streams receive prioritized treatment with guaranteed bandwidth and low latency, while soft real-time and non-real-time streams receive standard service. This allows a single network to accommodate diverse requirements without requiring all nodes to support every possible protocol or feature.
Solution Approach 2:
The patent implements dynamic scheduling that adjusts transmission priorities and bandwidth allocation based on current network conditions and data stream requirements. The scheduler dynamically assigns time slots and transmission parameters to different streams, allowing nodes to operate with standardized hardware while providing differentiated service through software-based control rather than requiring specialized hardware for each application type.
3Ease of manufacture
If standard Ethernet protocols are used without specialized real-time capabilities, then node requirements are minimized, but time constraints for critical data transmission cannot be guaranteed
Solution Approach 1:
The patent applies preliminary action by pre-configuring transmission schedules and assigning time slots to different data streams before actual data transmission occurs. The scheduler calculates optimal transmission times and priorities in advance, ensuring that time-critical data will be transmitted within required constraints. This allows simple Ethernet nodes to provide guaranteed time constraints through intelligent scheduling rather than requiring complex real-time hardware capabilities.
Data Source
AI summary
Teachings herein include computer-implemented methods for scheduling transmissions of a plurality data streams through a telecommunication network. A respective repetitive transmission of each of the data streams is transmitted from a first originator node, in one or more of a plurality of phases according to a respective repetition rate of the respective repetitive transmission. The method may include: selecting the first originator node from a group of nodes; iterating over data streams of the plurality of streams whose repetitive transmission is transmitted from the first originator node; and at each iteration: selecting a data stream from the selected originator node, and assigning a phase of the plurality of phases to the selected stream based on a distribution criterion taking into account previously selected data streams and their assignment to a respective phase. The respective repetitive transmission of each stream is scheduled according to the respective phase.