Decentralized Asynchronous Coded Caching Design and Performance Analysis in Fog Radio Access Networks

January 13, 2019 Β· Declared Dead Β· πŸ› IEEE Transactions on Mobile Computing

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Yanxiang Jiang, Wenlong Huang, Mehdi Bennis, Fu-Chun Zheng arXiv ID 1901.04476 Category cs.IT: Information Theory Citations 33 Venue IEEE Transactions on Mobile Computing Last Checked 6 months ago
Abstract
In this paper, we investigate the problem of asynchronous coded caching in fog radio access networks (F-RANs). To minimize the fronthaul load, the encoding set collapsing rule and encoding set partition method are proposed to establish the relationship between the coded-multicasting contents for asynchronous and synchronous coded caching. Furthermore, a decentralized asynchronous coded caching scheme is proposed, which provides asynchronous and synchronous transmission methods for different delay requirements. The closed-form expression of the fronthaul load is established for the special case where the number of requests during each time slot is fixed, and the upper and lower bounds of the fronthaul load are given for the general case where the number of requests during each time slot is random. The simulation results show that our proposed scheme can create considerable coded-multicasting opportunities in asynchronous request scenarios.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Information Theory

Died the same way β€” πŸ‘» Ghosted