دانلود رایگان مقاله زمانبندی آپ لینک صف آگاه با تضمین استوکستیک

Abstract

Adaptive resource allocation arises naturally as a technique to optimize resource utilization in communication networks with scarce resources under dynamic conditions. One prominent example is cellular communication where service providers seek to utilize the costly resources in the most effective way. In this work, we investigate an uplink resource allocation scheme that takes into account the buffer occupation at the transmitter to retain a given level of quality of service (QoS). First, we regard exact results for the class of Poisson traffic where we investigate the sensitivity of the resource adaptation and QoS level to the actuating variables. We show relevant resource savings in comparison with a static allocation. Further, we regard a queueing setting with general random arrival and service processes. In particular, we consider the service of wireless fading channels. We show two different resource adaptation mechanisms that depend on the strictness of different assumptions. Finally, we present simulation results that show substantial resource savings using the queue-aware scheduling scheme, where we provide insight on the implementation and operation of such an adaptive system.

6. Conclusions

In this work, we presented an adaptive resource allocation scheme that provides probabilistic quality of service guarantees based on transmit buffer occupation. Adaptive resource allocation enables the optimization of the resource utilization in communication networks under dynamic conditions. First, we used exact formulae for the class of Poisson traffic to show substantial resource savings under certain conditions compared to static resource allocations. We also showed the robustness of the adaptive system with respect to misadaptation and resource limitation. Motivated by the exact results we provided a general framework for implementing queue-aware scheduling that takes as input general traf- fic arrival and service processes. We considered a wireless channel model and described two algorithms for adaptive resource allocation. Using the example of a cellular network we presented simulation results that show the performance gain with queue-aware scheduling. The adaptive system saves resources, while retaining a given QoS level. We showed a brief example of the performance of the adaptive system in multi-user scenarios together with insight and recommendations for the operation of queue-aware scheduling.