Push-Based Packet Scheduling Across Variable Network Connections
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing data packet communication systems that utilize multiple network connections suffer from inefficiencies due to static routing logic, leading to underutilization or overutilization of connections, increased latency, reduced throughput, and less reliable delivery, especially when network characteristics change over time.
Innovation Solution
A push-based data packet communication system that utilizes a scheduler to dynamically assign packets to connections based on real-time monitored characteristics, such as throughput, latency, and packet loss, ensuring optimal utilization of available network capacity and meeting specific data flow requirements.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Ease of manufacture
If static routing logic with timers is used to schedule data packets, then implementation simplicity is improved, but computational efficiency deteriorates and connection utilization becomes suboptimal
Solution Approach 1:
The patent applies dynamics by replacing static routing logic with dynamic connection selection. The system continuously monitors network characteristics (throughput, latency, packet loss) and adapts connection assignments in real-time based on actual performance data, allowing the routing decisions to evolve dynamically rather than remaining fixed
Solution Approach 2:
The patent implements feedback mechanisms where network performance metrics are collected and fed back into the scheduling algorithm. This feedback loop enables the system to learn from actual connection performance and adjust future packet routing decisions accordingly, improving both computational efficiency and connection utilization
2Ease of manufacture
If timer-based scheduling is used for multiple connections, then implementation simplicity is improved, but connection utilization deteriorates when networks have different operating characteristics
Solution Approach 1:
The patent applies local quality by tailoring connection selection criteria to the specific characteristics of each network connection. Instead of treating all connections uniformly, the system evaluates individual connection metrics (throughput, latency, packet loss) and makes localized routing decisions optimized for each connection's actual performance characteristics
Solution Approach 2:
The patent utilizes parameter changes by monitoring and adapting to variations in network operating characteristics. The system adjusts routing decisions based on changing parameters such as throughput availability, latency conditions, and packet loss rates, allowing optimal connection utilization despite varying network conditions
3Ease of manufacture
If independent timers for each connection are used, then implementation simplicity is improved, but reliability of data packet delivery deteriorates due to lack of coordinated view of network performance
Solution Approach 1:
The patent merges the timing and scheduling functions into a unified coordination mechanism. Instead of independent timers operating in isolation, the system integrates connection monitoring and packet scheduling into a coordinated process that considers the state of all connections simultaneously, improving reliability through holistic management
Data Source
AI summary
A data packet communication system is described, which can be implemented as a physical push based data packet communication device, such as a router, a gateway, or a controller circuit coupled to a router or a gateway adapted for controlling data packet communications. The data packet communication system is adapted to evaluate network capacity of each of the multiple networks at the time of a monitored communication event and assigns data packets accordingly.