Coded computation against straggling decoders for network function virtualization

M Aliasgari, J Kliewer… - 2018 IEEE International …, 2018 - ieeexplore.ieee.org
2018 IEEE International Symposium on Information Theory (ISIT), 2018ieeexplore.ieee.org
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 …
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.
ieeexplore.ieee.org
以上显示的是最相近的搜索结果。 查看全部搜索结果