Method of scheduling and admission control for guaranteed bit rate and/or maximum bit rate services
View Patent ↗The present invention provides a method of scheduling guaranteed bit rate and/or maximum bit rate applications. Embodiments of the method may include setting, for a mobile node during a time interval, a first weight equal to a sum of a previous first weight associated with the mobile node during a previous time interval and a correction factor that is a linear function of a difference between a first bit rate and an indication of a throughput of the mobile node. Embodiments of the method may also include scheduling communication with the mobile node based on the first weight.
1. A method, comprising:
setting, for a mobile node during a time interval, a first weight equal to a sum of a previous first weight associated with the mobile node during a previous time interval and a correction factor that is a linear function of a difference between a first bit rate and an indication of a throughput of the mobile node; and
scheduling communication with the mobile node based on the first weight.
2. The method of claim 1 , wherein scheduling said communication with the mobile node comprises scheduling said communication with the mobile node using the larger of the first weight and a weight associated with best effort scheduling.
3. The method of claim 1 , comprising determining the correction factor as a function of a difference between a guaranteed bit rate for the mobile node and a throughput of the mobile node during the time interval or an over-the-air transport block size of the mobile node during the time interval.
4. The method of claim 1 , wherein scheduling said communication with the mobile node comprises scheduling communication with the mobile node over at least one channel using a priority that is determined by the first weight and an indication of a quality of said at least one channel.
5. The method of claim 1 , wherein setting the first weight for the first mobile node comprises setting a plurality of first weights for a plurality of mobile nodes, wherein each of the plurality of first weights is equal to a sum of a corresponding previous first weight during the previous time interval and a correction factor that is a linear function of a difference between a first bit rate and an indication of a throughput of the corresponding mobile node.
6. The method of claim 5 , comprising initializing the plurality of first weights for the plurality of mobile nodes using an iterative procedure that allocates a minimum bandwidth to achieve guaranteed bit rate for a first portion of the mobile nodes and fairly allocates remaining bandwidth to a second portion of the mobile nodes, and wherein each of the plurality of first weights is a function of the corresponding allocated bandwidth.
7. The method of claim 6 , wherein the first portion comprises all of the mobile nodes and the second portion is an empty set or wherein the first portion is an empty set and the second portion comprises all of the mobile nodes.
8. The method of claim 5 , wherein setting the first weight comprises setting the first weight equal to a sum of the previous first weight and a correction factor that is a linear function of a difference between a guaranteed bit rate and the indication of the throughput of the mobile node, and further comprising:
setting, for the mobile node during the time interval, a second weight equal to a sum of a previous second weight associated with the mobile node during the previous time interval and a correction factor that is a linear function of a difference between a maximum bit rate and the indication of the throughput of the mobile node; and
scheduling communication with the mobile node based on a final weight that is equal to the lesser of the second weight and the larger of the first weight and the weight associated with best effort scheduling.
9. The method of claim 8 , comprising initializing a plurality of final weights for a plurality of mobile nodes using an iterative procedure that allocates bandwidth to each of the mobile nodes subject to constraints imposed by at least one of a guaranteed bit rate or a maximum bit rate for each of the mobile nodes, and wherein each of the plurality of final weights is a function of the corresponding allocated bandwidth.
10. The method of claim 9 , comprising performing admission control based on results of the iterative procedure to allocate bandwidth to the mobile nodes.
11. The method of claim 9 , comprising scheduling communication for the plurality of mobile nodes based on the plurality of final weights.
12. The method of claim 11 , wherein scheduling communication for the plurality of mobile nodes comprises scheduling communication for at least one streaming application associated with the plurality of mobile nodes based on the plurality of final weights.
13. A method, comprising:
recursively defining a weight associated with a mobile node using a linear function of a previous value of the weight and a difference between a first bit rate and an indication of a throughput of the mobile node; and
scheduling communication with the mobile node based on the first weight.
14. The method of claim 13 , wherein scheduling said communication with the mobile node comprises scheduling communication with the mobile node over at least one channel using a priority that is determined by an indication of a quality of said at least one channel and the larger of the first weight and a weight associated with best effort scheduling.
15. The method of claim 13 , wherein recursively defining the weight comprises determining the correction factor as a function of a difference between a guaranteed bit rate for the mobile node and at least one of a throughput of the mobile node during the time interval or an over-the-air transport block size of the mobile node during the time interval.
16. The method of claim 15 , wherein recursively defining the weights comprises recursively defining the weight as the lesser of a second weight and the larger of the first weight and a rate associated with best effort scheduling, wherein the first weight is recursively defined by a previous first weight and a correction factor that is a linear function of a difference between the guaranteed bit rate and the indication of the throughput of the mobile node, and wherein the second weight is recursively defined by a previous second weight associated with the mobile node during the previous time interval and a correction factor that is a linear function of a difference between a maximum bit rate and the indication of the throughput of the mobile node.
17. The method of claim 16 , wherein recursively defining the weight for the first mobile node comprises recursively defining a plurality of weights for a plurality of mobile nodes, wherein each of the plurality of weights is recursively defined by a corresponding previous weight during the previous time interval and a correction factor that is a linear function of a difference between a first bit rate and an indication of a throughput of the corresponding mobile node.
18. The method of claim 17 , comprising initializing the plurality of weights for a plurality of mobile nodes using an iterative procedure that allocates bandwidth to each of the mobile nodes subject to constraints imposed by at least one of a guaranteed bit rate or a maximum bit rate for each of the mobile nodes, and wherein each of the plurality of weights is a function of the corresponding allocated bandwidth.
19. The method of claim 18 , comprising performing admission control based upon the iterative procedure to allocate bandwidth to the mobile nodes.
20. The method of claim 18 , wherein recursively defining the plurality of weights for the plurality of mobile nodes comprises recursively defining the plurality of weights for a first portion of the mobile nodes having a selected quality-of-service and a second portion of the mobile nodes that operate in best effort mode.
21. The method of claim 20 , wherein the first portion comprises all of the mobile nodes and the second portion is an empty set or wherein the first portion is an empty set and the second portion comprises all of the mobile nodes.
22. The method of claim 20 , comprising scheduling communication for the plurality of mobile nodes based on the plurality of weights.
23. The method of claim 22 , wherein scheduling communication for the plurality of mobile nodes comprises scheduling communication for at least one streaming application associated with the plurality of mobile nodes based on the plurality of weights.