Executing variable-priority jobs using multiple statistical thresholds in cellular networks

1. A method of managing variable-priority flows in a network, said method comprising:

utilizing at least one processor to execute computer code configured to perform the steps of:

receiving requests for transmission of digital content from client devices, each request being associated with a priority, the requests including at least one lower-priority delayable request and at least one higher-priority request; and

controlling at least one flow associated with the at least one lower-priority request in the presence of at least one flow for the at least one higher-priority request, said controlling comprising:

scheduling the flow associated with the at least one lower-priority delayable request for throughput;

monitoring a current throughput of the flow associated with the at least one lower-priority delayable request;

comparing the monitored current throughput to a predetermined threshold;

based on the comparison, determining that the monitored current throughput of the flow associated with the at least one lower-priority delayable request has fallen below the predetermined threshold; and

in response to determining that the monitored current throughput of the flow associated with the at least one lower-priority delayable request has fallen below the predetermined threshold, halting throughput of the flow associated with the at least one lower-priority delayable request.

2. The method according to claim 1 , wherein said controlling is governed by at least one of:

present and historical network conditions; and

present and historical conditions related to demand.

3. The method according to claim 1 wherein:

said controlling comprises prioritizing at least one lower-priority flow on the basis of a cost function;

the cost function being based on a current lag time of at least one lower-priority flow through the network with respect to at least one expected delivery time.

4. The method according to claim 1 , wherein the predetermined threshold is determined based on a cumulative distribution of past throughputs in the network.

5. The method according to claim 1 , comprising monitoring to ensure that throughput of at least one scheduled flow remains above the predetermined threshold between two scheduling periods.

6. The method according to claim 1 , comprising adjusting the predetermined threshold based on at least one of:

progress of at least one current flow, at least one current network condition, and at least one statistical parameter.

7. The method according to claim 6 , wherein said adjusting comprises adjusting the predetermined threshold based at least on current progress of at least one delayed low-priority flow.

8. The method according to claim 6 , wherein:

said adjusting comprises adjusting the predetermined threshold based at least on the at least one statistical parameter; and

the at least one statistical parameter is based on at least one historical distribution of flow throughputs in the network.

9. The method according to claim 1 , wherein said controlling comprises scheduling at least one lower-priority flow for transmission at fair share if:

current throughput of at least one lower-priority flow through the network is lower than a second threshold; and

at least one other lower-priority flow has a current throughput lower than the first threshold.

10. The method according to claim 1 , wherein the network comprises a cellular network.

11. The method according to claim 10 , wherein said controlling comprises operating jointly with a fair scheduler of at least one base station of a cellular network.

12. The method according to claim 1 , wherein said controlling comprises estimating a number of schedulable data flows during a predetermined time period.

13. An apparatus comprising:

at least one processor; and

a computer readable storage medium having computer readable program code embodied therewith and executable by the at least one processor, the computer readable program code comprising:

computer readable program code configured to receive requests for transmission of digital content from client devices, each request being associated with a priority, the requests including at least one lower-priority delayable request and at least one higher-priority request; and

computer readable program code configured to control at least one flow associated with the at least one lower-priority delayable request in the presence of at least one flow for the at least one higher-priority request;

wherein the controlling comprises:

scheduling the flow associated with the at least one lower-priority delayable request for throughput;

monitoring a current throughput of the flow associated with the at least one lower-priority delayable request;

comparing the monitored current throughput to a predetermined threshold;

based on the comparison, determining that the monitored current throughput of the flow associated with the at least one lower-priority delayable request has fallen below the predetermined threshold; and

in response to determining that the monitored current throughput of the flow associated with the at least one lower-priority delayable request has fallen below the predetermined threshold, halting throughput of the flow associated with the at least one lower-priority delayable request.

14. A computer program product comprising:

a non-transitory computer readable storage medium having computer readable program code embodied therewith, the computer readable program code comprising:

computer readable program code configured to receive requests for transmission of digital content from client devices, each request being associated with a priority, the requests including at least one lower-priority delayable request and at least one higher-priority request; and

computer readable program code configured to control at least one flow associated with the at least one lower-priority request in the presence of at least one flow for the at least one higher-priority request;

wherein the controlling comprises:

scheduling the flow associated with the at least one lower-priority delayable request for throughput;

monitoring a current throughput of the flow associated with the at least one lower-priority delayable request;

comparing the monitored current throughput to a predetermined threshold;

based on the comparison, determining that the monitored current throughput of the flow associated with the at least one lower-priority delayable request has fallen below the predetermined threshold; and

in response to determining that the monitored current throughput of the flow associated with the at least one lower-priority delayable request has fallen below the predetermined threshold, halting throughput of the flow associated with the at least one lower-priority delayable request.

15. The computer program product according to claim 14 , wherein the controlling of at least one flow associated with the at least one lower-priority request is governed by at least one of:

present and historical network conditions; and

present and historical conditions related to demand.

16. The computer program product according to claim 14 , wherein the predetermined threshold is determined based on a cumulative distribution of past throughputs in the network.

17. The computer program product according to claim 14 , wherein said computer readable program code is configured to adjust the predetermined threshold based on at least one of: progress of at least one current flow, at least one current network condition, and at least one statistical parameter.

18. The computer program product according to claim 14 , wherein said computer readable program code is configured to schedule at least one lower-priority flow for transmission at fair share if:

current throughput of at least one lower-priority flow through the network is lower than a second threshold; and

at least one other lower-priority flow has a current throughput lower than the first threshold.

19. The computer program product according to claim 14 , wherein the network comprises a cellular network.

20. A method comprising:

designating at least one lower-priority delay-tolerant flow in a cellular network; and

controlling the at least one lower-priority delay-tolerant flow to restrict an effect on throughput of at least one higher-priority flow in the cellular network;

said controlling comprising:

scheduling the at least one lower-priority delay-tolerant flow for transmission;

monitoring a current throughput of the at least one lower-priority delay-tolerant flow;

comparing the monitored current throughput of the at least one lower-priority delay-tolerant flow to a threshold, the threshold being chosen based on a cumulative distribution of historical throughputs through the cellular network;

based on the comparison, determining that the monitored current throughput of the at least one lower-priority delay-tolerant flow has fallen below the threshold; and

in response to determining that the monitored current throughput of the at least one lower-priority delay-tolerant flow has fallen below the threshold, halting throughput of the at least one lower-priority delay-tolerant flow.