TY - JOUR
T1 - Coded computation against processing delays for virtualized cloud-based channel decoding
AU - Aliasgari, Malihe
AU - Kliewer, Jorg
AU - Simeone, Osvaldo
N1 - Publisher Copyright:
© 1972-2012 IEEE.
PY - 2019/1
Y1 - 2019/1
N2 - The uplink of a cloud radio access network architecture is studied in which decoding at the cloud takes place via network function virtualization on commercial off-the-shelf servers. In order to mitigate the impact of straggling decoders in this platform, a novel coding strategy is proposed, whereby the cloud re-encodes the received frames via a linear code before distributing them to the decoding processors. Transmission of a single frame is considered first, and upper bounds on the resulting frame unavailability probability as a function of the decoding latency are derived by assuming a binary symmetric channel for uplink communications. Then, the analysis is extended to account for random frame arrival times. In this case, the tradeoff between an average decoding latency and the frame error rate is studied for two different queuing policies, whereby the servers carry out per-frame decoding or continuous decoding, respectively. Numerical examples demonstrate that the bounds are useful tools for code design and that coding is instrumental in obtaining a desirable compromise between decoding latency and reliability.
AB - The uplink of a cloud radio access network architecture is studied in which decoding at the cloud takes place via network function virtualization on commercial off-the-shelf servers. In order to mitigate the impact of straggling decoders in this platform, a novel coding strategy is proposed, whereby the cloud re-encodes the received frames via a linear code before distributing them to the decoding processors. Transmission of a single frame is considered first, and upper bounds on the resulting frame unavailability probability as a function of the decoding latency are derived by assuming a binary symmetric channel for uplink communications. Then, the analysis is extended to account for random frame arrival times. In this case, the tradeoff between an average decoding latency and the frame error rate is studied for two different queuing policies, whereby the servers carry out per-frame decoding or continuous decoding, respectively. Numerical examples demonstrate that the bounds are useful tools for code design and that coding is instrumental in obtaining a desirable compromise between decoding latency and reliability.
KW - Cloud radio access network
KW - Coded computation
KW - Large deviation
KW - Network function virtualization
KW - Queueing
UR - http://www.scopus.com/inward/record.url?scp=85053331659&partnerID=8YFLogxK
U2 - 10.1109/TCOMM.2018.2869791
DO - 10.1109/TCOMM.2018.2869791
M3 - Article
AN - SCOPUS:85053331659
SN - 0090-6778
VL - 67
SP - 28
EP - 39
JO - IEEE Transactions on Communications
JF - IEEE Transactions on Communications
IS - 1
M1 - 8463544
ER -