Time-value curves to provide dynamic QoS for time sensitive file transfers
View Patent ↗A method and apparatus has been shown and described which allows Quality of Service to be controlled at a temporal granularity. Time-value curves, generated for each task, ensure that mission resources are utilized in a manner which optimizes mission performance. It should be noted, however, that although the present invention has shown and described the use of time-value curves as applied to mission workflow tasks, the present invention is not limited to this application; rather, it can be readily appreciated by one of skill in the art that time-value curves may be used to optimize the delivery of any resource to any consumer by taking into account the dynamic environment of the consumer and resource.
1. A method of allocating at least one network resource among a plurality of tasks, at least one task of the plurality of tasks having a respective priority that varies continuously as a function of time, the method comprising:
over each of a plurality of time intervals, allocating the at least one network resource based on relative values of the respective priorities over each of the plurality of time intervals, the at least one task of the plurality of tasks having a respective priority that increases from a non-zero lowest value at a beginning of a finite time interval for which the at least one task is executing to a highest value before the end of the finite time interval and remains at the highest value until the end of the finite time interval.
2. The method of claim 1 , wherein allocating the at least one network resource based on relative values of the respective priorities over each of the plurality of time intervals comprises allocating the at least one network resource over each respective time interval of the plurality of time intervals having a highest priority value over that respective time interval.
3. The method of claim 1 , wherein allocating the at least one network resource based on relative values of the respective priorities over the plurality of time intervals comprises allocating the at least one network resource over each respective time interval of the plurality of time intervals to the plurality of tasks in proportion to their respective priorities over that respective time interval.
4. The method of claim 1 , wherein the finite time interval extends from a start time to an end time.
5. The method of claim 1 , further comprising: receiving via a user interface information pertaining to the plurality of tasks; and deriving a priority value as a function of time for each task of the plurality of tasks from the received information pertaining to the plurality of tasks.
6. The method of claim 5 , wherein deriving a priority value as a function of time for each task comprises modifying a generic priority function for each task based on the received information pertaining to the plurality of tasks.
7. The method of claim 1 , further comprising dynamically adjusting the respective priority function of time for at least one task in response to network conditions.
8. A system for allocating at least one network resource among a plurality of tasks, each task having a respective priority that varies continuously as a function of time, the system comprising:
at least one processor; and
at least one memory configured to store instructions for execution by the at least one processor, the instructions comprising instructions that, when executed:
allocate, over each of a plurality of time intervals, the at least one network resource based on relative values of the respective priorities over each of the plurality of time intervals, at least one task of the plurality of tasks having a respective priority that increases from a non-zero lowest value at a beginning of a finite time interval for which the at least one task is executing to a highest value before the end of the finite time interval and remains at the highest value until the end of the finite time interval.
9. The system of claim 8 , wherein the instructions that, when executed, allocate the at least one network resource based on relative values of the respective priorities over each of the plurality of time intervals comprise:
instructions, that when executed, allocate the at least one network resource over each respective time interval of the plurality of time intervals having a highest priority value over that respective time interval.
10. The system of claim 8 , wherein the instructions that, when executed, allocate the at least one network resource based on relative values of the respective priorities over the plurality of time intervals comprise:
instructions that, when executed, allocate the at least one network resource over each respective time interval of the plurality of time intervals to the plurality of tasks in proportion to their respective priorities over that respective time interval.
11. The system of claim 8 , wherein the finite time interval extends from a start time to an end time.
12. The system of claim 8 , wherein the instructions further comprise instructions that, when executed:
receive via a user interface information pertaining to the plurality of tasks; and
derive a priority value as a function of time for each task of the plurality of tasks from the received information pertaining to the plurality of tasks.
13. The system of claim 12 , wherein the instructions that, when executed, derive a priority value as a function of time for each task include instructions that, when executed, modify a generic priority function for each task based on the received information pertaining to the plurality of tasks.
14. The system of claim 8 , wherein the instructions further comprise instructions that, when executed, dynamically adjust the respective priority function of time for at least one task in response to network conditions.