TY - GEN
T1 - Latency and Reliability-Aware Task Offloading and Resource Allocation for Mobile Edge Computing
AU - Liu, Chen Feng
AU - Bennis, Mehdi
AU - Poor, H. Vincent
N1 - Publisher Copyright:
© 2017 IEEE.
PY - 2017/7/2
Y1 - 2017/7/2
N2 - While mobile edge computing (MEC) alleviates the computation and power limitations of mobile devices, additional latency is incurred when offloading tasks to remote MEC servers. In this work, the power-delay tradeoff in the context of task offloading is studied in a multi-user MEC scenario. In contrast with current system designs relying on average metrics (e.g., the average queue length and average latency), a novel network design is proposed in which latency and reliability constraints are taken into account. This is done by imposing a probabilistic constraint on users' task queue lengths and invoking results from extreme value theory to characterize the occurrence of low- probability events in terms of queue length (or queuing delay) violation. The problem is formulated as a computation and transmit power minimization subject to latency and reliability constraints, and solved using tools from Lyapunov stochastic optimization. Simulation results demonstrate the effectiveness of the proposed approach, while examining the power-delay tradeoff and required computational resources for various computation intensities.
AB - While mobile edge computing (MEC) alleviates the computation and power limitations of mobile devices, additional latency is incurred when offloading tasks to remote MEC servers. In this work, the power-delay tradeoff in the context of task offloading is studied in a multi-user MEC scenario. In contrast with current system designs relying on average metrics (e.g., the average queue length and average latency), a novel network design is proposed in which latency and reliability constraints are taken into account. This is done by imposing a probabilistic constraint on users' task queue lengths and invoking results from extreme value theory to characterize the occurrence of low- probability events in terms of queue length (or queuing delay) violation. The problem is formulated as a computation and transmit power minimization subject to latency and reliability constraints, and solved using tools from Lyapunov stochastic optimization. Simulation results demonstrate the effectiveness of the proposed approach, while examining the power-delay tradeoff and required computational resources for various computation intensities.
UR - http://www.scopus.com/inward/record.url?scp=85050463584&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85050463584&partnerID=8YFLogxK
U2 - 10.1109/GLOCOMW.2017.8269175
DO - 10.1109/GLOCOMW.2017.8269175
M3 - Conference contribution
AN - SCOPUS:85050463584
T3 - 2017 IEEE Globecom Workshops, GC Wkshps 2017 - Proceedings
SP - 1
EP - 7
BT - 2017 IEEE Globecom Workshops, GC Wkshps 2017 - Proceedings
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2017 IEEE Global Telecommunications Conference, GC 2017
Y2 - 4 December 2017 through 8 December 2017
ER -