Deadline-Aware Network Protocol for Real-Time Traffic
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing transport protocols are agnostic to data flow deadlines, leading to suboptimal network resource allocation and decreased application performance in soft real-time web applications, where meeting deadlines is crucial for service quality.
Innovation Solution
A deadline-aware network protocol that allocates network resources based on data flow deadlines by prioritizing data flows with earlier deadlines, ensuring they complete before their deadline, and utilizing a greedy allocation strategy to maximize throughput and resource utilization.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If TCP fair-sharing is used to allocate network resources, then network resources are shared fairly between flows, but deadline-sensitive applications cannot meet their service level agreements
Solution Approach 1:
The patent changes the resource allocation parameter from equal fair-sharing to deadline-based dynamic allocation. The protocol modifies TCP's congestion control parameters by introducing deadline information into the resource allocation decision-making process, allowing the system to adapt resource distribution based on temporal constraints rather than treating all flows equally.
Solution Approach 2:
The patent introduces dynamic resource allocation where network resources are not statically divided but dynamically adjusted based on flow deadlines and current network conditions. The protocol continuously monitors deadline proximity and adjusts allocation in real-time, making the system responsive to changing temporal requirements of different data flows.
2Productivity
If network resources are allocated to maximize throughput, then application throughput increases, but deadline constraints may be violated
Solution Approach 1:
The patent applies preliminary action by having applications declare their deadline requirements in advance before data transmission begins. This allows the network protocol to pre-calculate and reserve appropriate resource allocations that will ensure deadline compliance, rather than reacting after deadlines are missed. The deadline information is incorporated into the initial resource allocation decision.
Solution Approach 2:
The patent implements feedback mechanisms where the protocol continuously monitors both throughput performance and deadline compliance. Based on this feedback, the system adjusts resource allocation dynamically - increasing resources for flows approaching deadlines and optimizing for throughput when deadlines are comfortably met, creating a closed-loop control system.
3Loss of energy
If network resources are fully utilized, then network efficiency improves, but quality of service for real-time applications deteriorates
Solution Approach 1:
The patent applies local quality by differentiating resource allocation based on the specific requirements of individual data flows. Instead of uniform treatment, the protocol assigns different quality levels of service to different flows based on their deadline sensitivity. Deadline-critical flows receive prioritized resource allocation while less time-sensitive flows receive standard treatment, allowing localized optimization throughout the network.
Data Source
AI summary
A deadline-aware network protocol is described. In an example, data transfer at a transport layer entity of a packet-based communication network is controlled by receiving a request for network resources for a data flow from a network element and allocating network resources to the data flow. The data flow comprises a number of data packets associated with an application, and the request comprises a factor relating to a time deadline associated with the application. The network resources allocated depend on the factor relating to the time deadline. In examples, the network resource can be a bandwidth or data rate allocated to the data flow, and the factor can be a data rate sufficient to complete the data flow within the time deadline. In examples, the network resources are allocated greedily, such that requests are fully satisfied whenever possible, and the network resources are fully utilized.