In this paper we consider upper and lower constraining users' service rates
in a slotted, cross-layer scheduler context. Such schedulers often cannot
guarantee these bounds, despite the usefulness in adhering to Quality of
Service (QoS) requirements, aiding the admission control system or providing
different levels of service to users. We approach this problem with a
low-complexity algorithm that is easily integrated in any utility
function-based cross-layer scheduler. The algorithm modifies the weights of the
associated Network Utility Maximization problem, rather than for example
applying a token bucket to the scheduler's output or adding constraints in the
physical layer. We study the efficacy of the algorithm through simulations with
various schedulers from literature and mixes of traffic. The metrics we
consider show that we can bound the average service rate within about five
slots, for most schedulers. Schedulers whose weight is very volatile are more
difficult to constrain.Comment: 11 pages, 10 figures. Presented at 6th International Conference on
Computer Science, Engineering and Information. Published in AIRCC
http://airccse.org/csit/V9N13.htm