Details
| Original language | English |
|---|---|
| Pages (from-to) | 63-72 |
| Number of pages | 10 |
| Journal | Computer communications |
| Volume | 84 |
| Publication status | Published - 15 Jun 2016 |
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.
Keywords
- Mobile uplink, Resource allocation, Scheduling, Stochastic network calculus
ASJC Scopus subject areas
- Computer Science(all)
- Computer Networks and Communications
Cite this
- Standard
- Harvard
- Apa
- Vancouver
- BibTeX
- RIS
In: Computer communications, Vol. 84, 15.06.2016, p. 63-72.
Research output: Contribution to journal › Article › Research › peer review
}
TY - JOUR
T1 - Queue-aware uplink scheduling with stochastic guarantees
AU - Rizk, Amr
AU - Fidler, Markus
N1 - Funding information: The research leading to these results has received funding from the European Research Council under an ERC Starting Grant “UnIQue”. The work by A.R. has been supported in parts by the DAAD Postdoc program.
PY - 2016/6/15
Y1 - 2016/6/15
N2 - 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.
AB - 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.
KW - Mobile uplink
KW - Resource allocation
KW - Scheduling
KW - Stochastic network calculus
UR - http://www.scopus.com/inward/record.url?scp=84960511119&partnerID=8YFLogxK
U2 - 10.1016/j.comcom.2016.02.014
DO - 10.1016/j.comcom.2016.02.014
M3 - Article
AN - SCOPUS:84960511119
VL - 84
SP - 63
EP - 72
JO - Computer communications
JF - Computer communications
SN - 0140-3664
ER -