Synchronized Packet Injection for Latency-Bounded Stream Admission
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing methods for determining maximum transmission times of data packets in transmission networks are either too computationally intensive or fail to ensure correctness and efficiency in accepting new data streams, particularly in industrial communication scenarios.
Innovation Solution
A computer-implemented method that assigns sending nodes to synchronization groups with synchronized injection cycles, calculates initial and updated maximum transit times, and checks for compliance with latency and buffer constraints to determine whether new data streams can be accepted without exceeding predefined limits.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If detailed simulations are used to determine maximum transmission times, then reliability of transmission time limits is improved, but computational complexity and time consumption increase significantly
Solution Approach 1:
The patent employs simplified analytical models and formulas that provide adequate estimates of maximum transmission times without requiring computationally expensive detailed simulations. These lightweight calculation methods consume minimal computational resources while providing sufficient reliability for network operation decisions.
Solution Approach 2:
The patent replaces complex simulation-based mechanical analysis with analytical mathematical formulations. By using closed-form equations to calculate transmission times and buffer levels, the system achieves reliable results without the computational overhead of step-by-step simulations.
2Measurement precision
If detailed simulations are used to determine maximum transmission times, then accuracy of transmission time limits is improved, but time consumption increases impractically
Solution Approach 1:
The patent uses efficient analytical calculation methods that provide sufficiently accurate transmission time limits without requiring lengthy simulation runs. The simplified formulas deliver practical accuracy for network operation decisions while executing in minimal time.
Solution Approach 2:
The patent pre-calculates key network parameters such as path lengths, buffer capacities, and transmission rates during network configuration. These pre-computed values are stored and reused during runtime decision-making, eliminating the need for repeated detailed simulations when evaluating new data streams.
3Reliability
If transmission time limits are set to ensure correctness, then reliability of data transmission is improved, but the number of acceptable data streams decreases
Solution Approach 1:
The patent dynamically adjusts transmission time limits and buffer size allocations based on current network conditions and traffic patterns. By optimizing these parameters for each specific scenario, the system ensures correctness for accepted streams while maximizing the total number of acceptable data streams through efficient resource utilization.
Solution Approach 2:
The patent applies different transmission time limits and buffer allocations tailored to specific data streams based on their individual requirements and network paths. This localized optimization ensures each stream receives appropriate guarantees while allowing the network to accommodate a greater overall number of streams with diverse characteristics.
4Reliability
If buffer sizes are increased to prevent overflows, then losslessness of data transmission is improved, but device complexity and resource consumption increase
Solution Approach 1:
The patent dynamically determines optimal buffer sizes based on actual traffic patterns, transmission times, and network conditions. By adjusting buffer parameters adaptively rather than using fixed large buffers, the system prevents overflows while minimizing the total buffer resources required across the network.
Solution Approach 2:
The patent implements buffer overflow prevention through selective monitoring and control of critical data streams rather than uniformly allocating large buffers to all streams. This targeted approach provides sufficient protection against losses where needed while avoiding unnecessary resource consumption for streams with lower risk profiles.
Data Source
AI summary
The computer-implemented method according to the invention controls the injection of data packets from a data stream s of a set S of data streams into a transmission network (10), wherein the sending nodes are assigned to a synchronization group G(n) and the sending nodes of the same synchronization group periodically synchronize their injection cycles with a period T(g), and checks whether all data packets of the set of data streams can be injected into the transmission network from their sending nodes while maintaining their respective latency L(s): 1. Formation of initial transit times by setting theta(s) := 0 or another initial value for each stream s in S; 2. Calculation of the transit times Theta(s) for each stream s in S from the transit time values Theta(s); 3. If any of the values Theta(s) > L(s), the method is terminated with "reject"; 4.If Theta(s) <= theta(s) is satisfied for all s in S, the procedure is terminated with "accept"; 5. If none of the criteria in 3. and 4. are satisfied, theta(s) for s in S is replaced by the value Theta(s) and the procedure continues with 2.