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

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.

[1]  Suhas N. Diggavi,et al.  Multi-level coded caching , 2014, 2014 IEEE International Symposium on Information Theory.

[2]  Ke Zhang,et al.  Energy-Efficient Offloading for Mobile Edge Computing in 5G Heterogeneous Networks , 2016, IEEE Access.

[3]  Xiaohu You,et al.  Decentralized Asynchronous Coded Caching in Fog-RAN , 2018, 2018 IEEE 88th Vehicular Technology Conference (VTC-Fall).

[4]  Xinbing Wang,et al.  Coded caching under arbitrary popularity distributions , 2015, 2015 Information Theory and Applications Workshop (ITA).

[5]  Jaime Llorca,et al.  Order-Optimal Rate of Caching and Coded Multicasting With Random Demands , 2015, IEEE Transactions on Information Theory.

[6]  Deniz Gündüz,et al.  Decentralized Caching and Coded Delivery With Distinct Cache Capacities , 2017, IEEE Transactions on Communications.

[7]  Gennian Ge,et al.  Centralized Coded Caching Schemes: A Hypergraph Theoretical Approach , 2016, IEEE Transactions on Information Theory.

[8]  Jaime Llorca,et al.  An efficient multiple-groupcast coded multicasting scheme for finite fractional caching , 2015, 2015 IEEE International Conference on Communications (ICC).

[9]  Xinbing Wang,et al.  Coded caching for files with distinct file sizes , 2015, 2015 IEEE International Symposium on Information Theory (ISIT).

[10]  Urs Niesen,et al.  Decentralized coded caching attains order-optimal memory-rate tradeoff , 2013, 2013 51st Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[11]  Urs Niesen,et al.  Online Coded Caching , 2013, IEEE/ACM Transactions on Networking.

[12]  Jesús Gómez-Vilardebó,et al.  A Novel Centralized Coded Caching Scheme With Coded Prefetching , 2018, IEEE Journal on Selected Areas in Communications.

[13]  Urs Niesen,et al.  Coding for caching: fundamental limits and practical challenges , 2016, IEEE Communications Magazine.

[14]  Hooshang Ghasemi,et al.  Improved lower bounds for coded caching , 2015, 2015 IEEE International Symposium on Information Theory (ISIT).

[15]  Jaime Llorca,et al.  Caching and coded multicasting: Multiple groupcast index coding , 2014, 2014 IEEE Global Conference on Signal and Information Processing (GlobalSIP).

[16]  Mehdi Bennis,et al.  Living on the edge: The role of proactive caching in 5G wireless networks , 2014, IEEE Communications Magazine.

[17]  Urs Niesen,et al.  Coded caching for delay-sensitive content , 2014, 2015 IEEE International Conference on Communications (ICC).

[18]  Hui Liu,et al.  Order-Optimal Decentralized Coded Caching Schemes with Good Performance in Finite File Size Regime , 2016, 2016 IEEE Global Communications Conference (GLOBECOM).

[19]  Urs Niesen,et al.  Fundamental limits of caching , 2012, 2013 IEEE International Symposium on Information Theory.

[20]  Xiaofei Wang,et al.  Cache in the air: exploiting content caching and delivery techniques for 5G systems , 2014, IEEE Communications Magazine.

[21]  Walid Saad,et al.  Proactive edge computing in latency-constrained fog networks , 2017, 2017 European Conference on Networks and Communications (EuCNC).

[22]  Li Tang,et al.  Coded Caching Schemes With Reduced Subpacketization From Linear Block Codes , 2017, IEEE Transactions on Information Theory.

[23]  Urs Niesen,et al.  Fundamental Limits of Caching , 2014, IEEE Trans. Inf. Theory.

[24]  Urs Niesen,et al.  Coded Caching With Nonuniform Demands , 2017, IEEE Transactions on Information Theory.

[25]  Jaime Llorca,et al.  Finite-Length Analysis of Caching-Aided Coded Multicasting , 2014, IEEE Transactions on Information Theory.

[26]  Walid Saad,et al.  An online secretary framework for fog network formation with minimal latency , 2017, 2017 IEEE International Conference on Communications (ICC).

[27]  Hooshang Ghasemi,et al.  Asynchronous coded caching , 2017, 2017 IEEE International Symposium on Information Theory (ISIT).

[28]  H. Vincent Poor,et al.  Coded Joint Pushing and Caching With Asynchronous User Requests , 2018, IEEE Journal on Selected Areas in Communications.

[29]  Xiaohu You,et al.  User Preference Learning-Based Edge Caching for Fog Radio Access Network , 2018, IEEE Transactions on Communications.

[30]  Xiaohu Tang,et al.  On the Placement Delivery Array Design for Centralized Coded Caching Scheme , 2015, IEEE Transactions on Information Theory.

[31]  Chao Tian,et al.  Fundamental Limits of Coded Caching: From Uncoded Prefetching to Coded Prefetching , 2017, IEEE Journal on Selected Areas in Communications.