Token Bucket-based Throughput Constraining in Cross-layer Schedulers

摘要

In this paper we consider upper and lower constraining users’ service rates in a slotted, cross-layerscheduler context. Such schedulers often cannot guarantee these bounds, despite the usefulness inadhering to Quality of Service (QoS) requirements, aiding the admission control system or providingdifferent levels of service to users.We approach this problem with a low-complexity algorithm that is easily integrated in any utilityfunction-based cross-layer scheduler. The algorithm modifies the weights of the associated NetworkUtility Maximization problem, rather than for example applying a token bucket to the scheduler’soutput or adding constraints in the physical layer.We study the efficacy of the algorithm through simulations with various schedulers from literatureand mixes of traffic. The metrics we consider show that we can bound the average service ratewithin about five slots, for most schedulers. Schedulers whose weight is very volatile are moredifficult to constrain.