Dynamic Telecommunication Data Stream Routing Optimization
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current data routing methods in telecommunications networks are limited by fixed pre-defined routes and lack flexibility in handling live streams, especially when dealing with diverse network types and protocols, leading to suboptimal quality and increased latency.
Innovation Solution
A dynamic routing method where all nodes communicate their capabilities to a central database, allowing for real-time calculation of optimal routes based on current network conditions, using heuristic rules or linear programming to minimize latency and cost, and adapt link settings for optimized data delivery.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Ease of operation
If fixed pre-defined routes are used for data stream routing, then network simplicity and ease of operation are improved, but routing flexibility and adaptability to network changes deteriorate
Solution Approach 1:
The patent implements dynamic routing where routes are not fixed but continuously adapted based on real-time network conditions. The system monitors network state changes and automatically recalculates optimal paths, transforming the static routing configuration into a dynamic system that responds to changing conditions while maintaining operational simplicity through automated decision-making.
Solution Approach 2:
The system incorporates continuous feedback loops that monitor network conditions and feed this information back to the routing decision-making process. This feedback mechanism enables the network to detect changes in real-time and adjust routes accordingly, resolving the contradiction between simple fixed routing and flexible adaptive routing by making the routing system responsive to actual network state.
2Loss of time
If real-time dynamic routing calculations are performed for all nodes, then routing optimization and latency reduction are improved, but system complexity and computational requirements worsen
Solution Approach 1:
The patent segments the routing system into distributed components at individual nodes rather than a centralized complex system. Each node performs localized routing calculations based on its own capabilities and local network conditions, reducing the computational burden on any single device while achieving overall network optimization and real-time responsiveness.
Solution Approach 2:
Each network node autonomously performs its own routing calculations and decisions based on pre-distributed routing information and local conditions. This self-service approach eliminates the need for complex centralized control, reducing system complexity while enabling real-time adaptive routing that minimizes latency through decentralized intelligent decision-making.
3Productivity
If processing power is added in MCU's for transcoding and composition, then data stream processing capability is improved, but network cost and device complexity worsen
Solution Approach 1:
The patent applies processing capabilities locally at network nodes based on specific routing needs rather than uniformly across all devices. Different nodes are equipped with different processing capabilities (transcoding, composition, relaying) matched to their specific functions in the data stream path, optimizing processing capability while minimizing unnecessary complexity in each individual device.
Data Source
Figure 1
Figure 2~3
Figure 4a~5
AI summary
A method, system and a network element for routing at least one data stream in a telecommunications network are described, the network having at least one transmitting node providing at least one data stream, at least one receiving node receiving the at least one data stream, and zero or more processing nodes, and at least one link connecting said nodes. All nodes communicate their capabilities to a system database on a database server which receives at least one request with at least one condition for sending at least one data stream between two nodes. For or each request, a measure is calculated for at least one route between said two nodes, and instructions are provided to use only the at least one route having measures compliant with the at least one condition in the request. An optimal route can be determined using at least one heuristic rule or linear programming.