TY - GEN
T1 - Coded Computation Against Straggling Decoders for Network Function Virtualization
AU - Aliasgari, Malihe
AU - Kliewer, Jorg
AU - Simeone, Osvaldo
N1 - Publisher Copyright:
© 2018 IEEE.
PY - 2018/8/15
Y1 - 2018/8/15
N2 - The uplink of a cloud radio access network architecture is studied in which decoding at the cloud takes place via network function virtualization (NFV) on commercial off-the-shelf (COTS) servers. In order to mitigate the impact of straggling decoders in the cloud computing 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. Upper bounds on the resulting frame unavailability probability (FUP) as a function of the decoding latency are derived by assuming a binary symmetric channel for uplink communications. The bounds leverage large deviation results for correlated variables, and depend on the properties of both the uplink linear channel code adopted at the user and the NFV linear code applied at the cloud. Numerical examples demonstrate that the bounds are useful tools for code design, and that coding is instrumental in obtaining a desirable tradeoff between FUP and decoding latency.
AB - The uplink of a cloud radio access network architecture is studied in which decoding at the cloud takes place via network function virtualization (NFV) on commercial off-the-shelf (COTS) servers. In order to mitigate the impact of straggling decoders in the cloud computing 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. Upper bounds on the resulting frame unavailability probability (FUP) as a function of the decoding latency are derived by assuming a binary symmetric channel for uplink communications. The bounds leverage large deviation results for correlated variables, and depend on the properties of both the uplink linear channel code adopted at the user and the NFV linear code applied at the cloud. Numerical examples demonstrate that the bounds are useful tools for code design, and that coding is instrumental in obtaining a desirable tradeoff between FUP and decoding latency.
KW - C-RAN
KW - Coded computation
KW - Large deviation
KW - Network function virtualization
UR - http://www.scopus.com/inward/record.url?scp=85052484909&partnerID=8YFLogxK
U2 - 10.1109/ISIT.2018.8437525
DO - 10.1109/ISIT.2018.8437525
M3 - Conference contribution
AN - SCOPUS:85052484909
SN - 9781538647806
T3 - IEEE International Symposium on Information Theory - Proceedings
SP - 711
EP - 715
BT - 2018 IEEE International Symposium on Information Theory, ISIT 2018
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2018 IEEE International Symposium on Information Theory, ISIT 2018
Y2 - 17 June 2018 through 22 June 2018
ER -