Abstract
How to place and deliver the videos through edge caching networks is a hot and open issue on releasing the heavy loads of backhaul link caused by explosive growth of data traffic and frequent requests. To address this issue, a joint video caching and transmission scheme is studied. In specific, the successful transmission probability, energy efficiency and system average delay are first derived based on the stochastic geometry theory. A video caching optimization problem is then formulated to balance the energy efficiency and system average delay. Considering the high complexity of the problem solution, we propose a genetic-based video placement and delivery algorithm to obtain a near-optimal solution. The accuracy of the proposed algorithm is finally validated by simulation results.
Similar content being viewed by others
References
Ericsson (2017) Ericsson Mobility Report. [Online]. Available: http://www.ericsson.com/en/mobility-report/reports/november-2017
Wang X, Chen M, Taleb T, Ksentini A, Leung VCM (2014) Cache in the air: Exploiting content caching and delivery techniques for 5G systems. IEEE Commun Mag 52:131–139
Poularakis K, Iosifidis G, Sourlas V, Tassiulas L (2016) Exploiting caching and multicast for 5G wireless networks. IEEE Trans Wirel Commun 15:2995–3007
Chen Z, Lee J, Quek TQS, Kountouris M (2017) Cooperative caching and transmission design in cluster-centric small cell networks. IEEE Trans Wirel Commun 16:3401–3415
Tao M, Chen E, Zhou H, Yu W (2016) Content-centric sparse multicast beamforming for cache-enabled cloud RAN. IEEE Trans Wirel Commun 15:6118–6131
Zhou H, Tao M, Chen E, Yu W (2015) Content-centric multicast beamforming in cache-enabled cloud radio access networks. In: IEEE Global Communications Conference(GLOBECOM), pp 1–6
Liu D, Yang C (2016) Cache-enabled heterogeneous cellular networks: Comparison and tradeoffs. In: International Conference on Communications(ICC), pp 1–6
Wu Q, Li GY, Chen W, Ng DWK, Schober R (2017) An overview of sustainable green 5G networks. IEEE Wirel Commun 24:72–80
Xu F, Tao M, Liu K (2017) Fundamental tradeoff between storage and latency in cache-aided wireless interference networks. IEEE Trans Inform Theory 63:7464–7491
Liao J, Wong KK, Khandaker MRA, Zheng Z (2016) Optimizing cache placement for heterogeneous small cell networks. IEEE Commun Lett 21:120–123
Gabry F, Bioglio V, Land I (2016) On energy-efficient edge caching in heterogeneous networks. IEEE J Sel Areas Commun 34:3288–3298
Wen W, Cui Y, Zheng F-C, Jin S, Jiang Y (2017) Random caching based cooperative transmission in heterogeneous wireless networks. In: International Conference on Communications(ICC), pp 1–6
Cui Y, Jiang D (2017) Analysis and optimization of caching and multicasting in large-scale cache-enabled heterogeneous wireless networks. IEEE Trans Wirel Commun 250-264:16
Zhao Z, Peng M, Ding Z, Wang W, Poor HV (2016) Cluster content caching: an energy-efficient approach to improve quality of service in cloud radio access networks. IEEE J Sel Areas Commun 34:1207–1221
Chen B, Yang C, Molisch AF (2017) Cache-enabled device-to-device communications: Offloading gain and energy cost. IEEE Trans Wirel Commun 16:4519–4536
Sun R, Wang Y, Cheng N (2020) Qoe-driven Transmission-Aware Cache Placement and Cooperative Beamforming Design in cloud-RANs. IEEE Trans Veh Technol 69:636–650
Rahman GMS, Peng M, Yan S (2020) learning based joint cache and power allocation in fog radio access networks. IEEE Trans Veh Technol 99:1–11
Wen W, Cui Zheng Y, Fu-Chun S, Jiang JY (2018) Random caching based cooperative transmission in heterogeneous wireless networks. IEEE Trans Commun 66:2809–2825
Tanbourgi R, Singh S, Andrews JG, Jondral FK (2014) A tractable model for noncoherent joint-transmission base station cooperation. IEEE Trans Wirel Commun 13:4959– 4973
Nigam G, Minero P, Haenggi M (2014) Coordinated multipoint joint transmission in heterogeneous networks. IEEE Trans Commun 62:4134–4146
Baccelli F, Giovanidis A (2015) A stochastic geometry framework for analyzing pairwise-cooperative cellular networks. IEEE Trans Wirel Commun 14:794–808
Nigam G (2014) Coordinated multipoint joint transmission in heterogeneous networks. IEEE Trans Commun 62:4134–4146
Li K (2018) Optimization and analysis of probabilistic caching in N-tier heterogeneous networks. IEEE Trans Wirel Commun 17:1283–1297
Choi M (2018) Wireless video caching and dynamic streaming under differentiated quality requirements. IEEE J Sel Areas Commun 36:1245–1257
Nie W (2016) Hetnets with random DTX scheme: Local delay and energy efficiency. IEEE Trans Veh Technol 65:6601–6613
Chae SH, Ryu JY, Quek TQS, Choi W (2015) Cooperative transmission via caching helpers, IEEE Global Communications Conference (GLOBECOM), 1–6
Wen W, Cui Y, Zheng FC et al (2017) . Random Caching Based Cooperative Transmission in Heterogeneous Wireless Networks 66:2809–2825
Schwarz H (2007) Overview of the scalable video coding extension of the h.264/AVC standard. IEEE Trans Circuits Syst Video Technol 17:11036–1120
Wu L (2016) Caching-based scalable video transmission over cellular network. IEEE Commun Lett 20:1156–1159
Zhang X (2019) Economical caching for scalable videos in Cache-Enabled heterogeneous networks. EEE J Sel Areas Commun 37:1608–1621
Zhang X (2018) Energy-Efficient Caching for scalable videos in heterogeneous networks. IEEE J Sel Areas Commun 36:1802–1815
Nigam G, Minero P, Haenggi M (2014) Coordinated multipoint joint transmission in heterogeneous networks. IEEE Trans Commun 62:4134–4146
Baccelli F, Blaszczyszyn B (2009) Stochastic geometry and wireless networks. Volume I - Theory, Foundations and Trends in Networking 3:249–449
Haenggi M (2013) The local delay in Poisson networks. IEEE Trans Inf Theory 59:1788–1802
Cui Q, Yu X, Wang Y (2018) The SIR meta distribution in poisson cellular networks with base station cooperation. IEEE Trans Commun 66:1234–1249
Haenggi M (2016) The meta distribution of the SIR in Poisson bipolar and cellular networks. IEEE Trans Wirel Commun 15:2577–2589
Salehi M, Mohammadi A, Haenggi M (2017) Analysis of D2D underlaid cellular networks: SIR meta distribution and mean local delay. IEEE Trans Commun 65:2904–2916
Jiang Y, Wan C, Tao M (2020) Analysis and optimization of fog radio access networks with hybrid caching: delay and energy efficiency. IEEE Trans Wirel Commun 99:1–14
Acknowledgements
This work was supported in part by the National Natural Science Foundation of China under grants 61901078, 61771082 and 61871062, and in part by the Science and Technology Research Program of Chongqing Municipal Education Commission under grants KJQN201900609 and KJQN202000626, and in part by the Natural Science Foundation of Chongqing under grant cstc2020jcyj-zdxmX0024, and in part by University Innovation Research Group of Chongqing under grant CXQT20017.
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher’s note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
This article is part of the Topical Collection: Special Issue on Convergence of Edge Computing and Next Generation Networking Guest Editors: Deze Zeng, Geyong Min, Qiang He, and Song Guo
Appendices
Appendix A: Proof of Theorem 1
When cache is missed, the video is transmitted to user by the remote server through the return link and a SBS closest to the user. Let m denote the SBS closest to the typical user. Assuming t is the transmitted video symbol from SBS, the received signal y1 can be written as
where hm and hi are the channel gain from the SBS closest to user and all SBSs from Φ∖{m} respectively, rm and ri are the distance from the SBS closest to user and all SBSs from Φ∖{m}, respectively, so the SIR of typical user can be written as
According to the definition of STP, let \(\theta _{n,l}^{z,nocache} = {2^{B{R_{n,l}}/\left ({1 - {\rho _{bh}}} \right )W}} - 1,z \in \{ GU,WU\} \), we have
where \(\mathbb {P}\left \{ {SIR > \theta _{n,l}^{z,nocache}|{r_{m}} = x} \right \}\) is the STP under rm = x, \({f_{r}}\left (x \right )\) is the probability density function (PDF) of the distance rm.
where step (a) holds since \({\left | {{h_{m}}} \right |^{2}}\) obeys the exponential distribution with parameter 1, \({{\mathscr{L}}_{{I_{1}}}}\left ({\zeta _{n,l}^{z,nocache}} \right )\) is the Laplace transform of the interference generated by the HPPP-distribution SBSs that are farther than that in Φ∖{m}, which is calculated as
where step (b) can be obtained from that \({\left | {{h_{i,j}}} \right |^{2}}\) obeys the exponential distribution with parameter 1, and step (c) holds due to the probability generating functional (PGFL) of HPPP. The PDF of the distance rm is
Combining Eqs. 36, 37 and 38 to Eq. 35, we obtain Theorem 1.
Appendix B: proof of Theorem 2
When cache is missed, the SIR of WU is shown as follows
where Φ3 is the set consist of three SBSs closest to WU. Let \(\theta _{n,l}^{WU,nocache}\) denote the threshold of SIR of worst-case users, there holds
where \(\mathbb {P}\left \{ {SIR > \theta _{n,l}^{WU,nocache}|\chi = x} \right \}\) is the STP under χ = x,
where \({{\mathscr{L}}_{{I_{2}}}}\left ({\zeta _{n,l}^{WU,nocache}} \right )\) is the Laplace transform of the interference generated by the HPPP-distribution SBSs that are farther than that in Φ∖ΦK, which is calculated as
The joint pdf of the link distances is
Combining Eqs. 41, 42 and 43 to Eq. 40, we obtain Theorem 2.
Appendix C: proof of Theorem 3
Similarly, when cache is hit, the SIR of GU is expressed as
Let \(\theta _{n,l}^{GU,sch}\) denote the threshold of SIR of general users, we discuss the STP in two cases.
-
Case 1:
when K = 1, we have the following conclusion according to Appendix A
$$ \begin{array}{@{}rcl@{}} STP_{n,l}^{GU,sch} = 1/{~}_{2}{F_{1}}\left( { - \frac{2}{\alpha },1;1 - \frac{2}{\alpha }; - \theta_{n,l}^{GU,sch}} \right), \\ sch \in \left\{ {CSVC,CV,CMQL} \right\} \\ \end{array} $$(45) -
Case 2:
when \(K \geqslant 2\), there holds
$$ \begin{array}{@{}rcl@{}} STP_{n,l}^{GU,sch} &=& {\int}_{0}^{{x_{2}}} {{\int}_{{x_{1}}}^{{x_{3}}} { \cdot \cdot \cdot } } {\int}_{{x_{K - 1}}}^{\infty} {f_{\boldsymbol{r}}}\left( \boldsymbol{x} \right) \cdot \mathbb{P}\left\{ {SIR > \theta_{n,l}^{GU,sch}|r = x} \right\} \\&&d{x_{1}}d{x_{2}} \cdot \cdot \cdot d{x_{K}} \end{array} $$(46)where \(\mathbb {P}\left \{ {SIR > \theta _{n,l}^{GU,sch}|\boldsymbol {r = x}} \right \}\) is the STP under r = x,
$$ \begin{array}{@{}rcl@{}} &&\mathbb{P}\left\{ {SIR > \theta_{n,l}^{GU,sch}|r = x} \right\} \hfill \\ &&= \mathbb{P}\left\{ {\frac{{{{\left| {\sum\limits_{{b_{i}} \in {{\Phi}_{K}}} {\sqrt P } \cdot {h_{i}} \cdot r_{i}^{- \alpha /2}} \right|}^{2}}}}{{{I_{3}}}} > \theta_{n,l}^{GU,sch}|r = x} \right\} \hfill \\ &&= \mathbb{P}\!\left\{ \!{{{\left| {\sum\limits_{{b_{i}} \in {{\Phi}_{K}}} {{h_{i}} \cdot r_{i}^{- \alpha /2}} } \right|}^{2}} \!\!>\! \theta_{n,l}^{GU,sch} \cdot {I_{3}} \cdot {P^{- 1}}|r = x} \right\} \hfill \\ &&\mathop {\text{ = }}\limits^{(d)} {\mathbb{E}_{{I_{2}}}}\left[ {\exp \left( { - \theta_{n,l}^{GU,sch} \cdot {I_{3}} \cdot {P^{ - 1}}/\sum\limits_{{b_{i}} \in {{\Phi}_{K}}} {x_{i}^{- \alpha }} } \right)} \right] \hfill \\ &&{\text{ = }}{\mathcal{L}_{{I_{2}}}}\left( {\theta_{n,l}^{GU,sch} \cdot {P^{- 1}}/\sum\limits_{{b_{i}} \in {{\Phi}_{K}}} {x_{i}^{ - \alpha }} } \right) \hfill \end{array} $$(47)where step (d) holds since \({\left | {\sum \limits _{{b_{i}} \in {{\Phi }_{K}}} {{h_{i}} \cdot x_{i}^{- \alpha /2}} } \right |^{2}}\) obeys the exponential distribution with parameter \(1/\sum \limits _{{b_{i}} \in {{\Phi }_{K}}} {x_{i}^{- \alpha }}\), \({{\mathcal L}_{{I_{3}}}}\left ({\zeta _{n,l}^{GU,sch}} \right )\) is the Laplace transform of the interference generated by the HPPP-distribution SBSs that are farther than that in Φ∖ΦK, which is calculated as
$$ \begin{array}{@{}rcl@{}} &&{\mathcal{L}_{{I_{3}}}}\left( {\zeta_{n,l}^{GU,sch}} \right) = {\mathbb{E}_{{I_{3}}}}\left[ {\exp \left( { - \sum\limits_{{b_{j}} \in {\Phi} \backslash {{\Phi}_{K}}} {\zeta_{n,l}^{GU,sch} \cdot P} \cdot {{\left| {{h_{j}}} \right|}^{2}} \cdot x_{j}^{- \alpha }} \!\right)} \!\!\right] \hfill \\ &&= {\mathbb{E}_{{{\Phi}_{K}},{{\left| {{h_{i}}} \right|}^{2}}}}\left[ {\underset{{b_{j}} \in {\Phi} \backslash {{\Phi}_{K}}}{\prod} {\exp \left( { - \zeta_{n,l}^{GU,sch} \cdot P \cdot {{\left| {{h_{j}}} \right|}^{2}} \cdot x_{j}^{- \alpha }} \right)} } \right] \hfill \\ &&= {\mathbb{E}_{{{\Phi}_{K}}}}\left[ {\underset{{b_{j}} \in {\Phi} \backslash {{\Phi}_{K}}}{\prod} {{\mathbb{E}_{{{\left| {{h_{j}}} \right|}^{2}}}}\left[ {\exp \left( { - \zeta_{n,l}^{GU,sch} \cdot P \cdot {{\left| {{h_{j}}} \right|}^{2}} \cdot x_{j}^{- \alpha }} \right)} \right]} } \right] \hfill \\ &&= {\mathbb{E}_{{{\Phi}_{K}}}}\left[ {\underset{{b_{i}} \in {\Phi} \backslash {{\Phi}_{K}}}{\prod} {\frac{1}{{1 + \zeta_{n,l}^{GU,sch} \cdot P \cdot x_{j}^{- \alpha }}}} } \right] \hfill \\ &&= \exp \left( { - 2\pi \cdot \lambda \int\limits_{{x_{K}}}^{\infty} {\frac{{\zeta_{n,l}^{GU,sch} \cdot P \cdot {\psi^{- \alpha }}}}{{1 + \zeta_{n,l}^{GU,sch} \cdot P \cdot {\psi^{- \alpha }}}}\psi d\psi } } \right) \hfill \\ &&= \exp \left( { \!- \pi \cdot \lambda\! \cdot {x_{K}^{2}}\!\left( \! {{~}_{2}{F_{1}}\!\left( \! { - \frac{2}{\alpha },1;1 - \frac{2}{\alpha }, - \frac{{\theta_{n,l}^{GU,sch}}}{{\sum\limits_{{b_{i}} \in {{\Phi}_{K}}} {{{\left( {\frac{{{x_{i}}}}{{{x_{K}}}}} \right)}^{- \alpha }}} }}} \!\right) - 1\!} \right)} \!\right) \hfill\!\!\! \\ \end{array} $$(48)
The PDF of the distance from K SBSs nearest to typical users is
Obviously, when \(K \geqslant 2\), the calculation of the successful transmission probability involves multidimensional integral, which is difficult to calculate. Especially when K is large, according to [38], the nearest SBS to the typical user can be regarded as a uniform distribution in the circle with the typical user as the center and the radius rK. Therefore, joint distribution functions of the nearest K SBSs to typical users can be approximately written
Combining Eqs. 48, 49 and 50 to Eq. 46, we obtain Theorem 3.
Appendix D: Proof of Theorem 4
Similarly, when cache is hit, the SIR of WU is expressed as
Let \(\theta _{n,l}^{WU,sch}\) denote the threshold of SIR of worst-case users, the STP of WU is showed as follows
where \(\mathbb {P}\left \{ {SIR > \theta _{n,l}^{WU,sch}|\chi = x} \right \}\) is the STP under χ = x,
where \({{\mathscr{L}}_{{I_{4}}}}\left ({\zeta _{n,l}^{WU,sch}} \right )\) is the Laplace transform of the interference generated by the HPPP-distribution SBSs that are farther than that in Φ∖ΦK, which is calculated as
The joint PDF of the link distances is
Combining Eqs. 53, 54 and 55 to Eq. 52, we obtain Theorem 4.
Appendix E: Proof of Theorem 5
The number of video retransmissions is defined as the expectation of the reciprocal of successful transmission probability, i.e.
Theorem 5 is proved.
Rights and permissions
About this article
Cite this article
Wu, D., Xu, H., Li, Z. et al. Video placement and delivery in edge caching networks: Analytical model and optimization scheme. Peer-to-Peer Netw. Appl. 14, 3998–4013 (2021). https://doi.org/10.1007/s12083-021-01131-4
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s12083-021-01131-4