Decentralized Caching Under Nonuniform File Popularity and Size: Memory-Rate Tradeoff Characterization
Authors: 
Yong Deng, Min DongAuthors Info & Claims
Yong Deng, Min DongAuthors Info & ClaimsPages 175 - 190
Abstract
This paper aims to characterize the memory-rate tradeoff for decentralized caching under nonuniform file popularity and size. We consider a recently proposed decentralized modified coded caching scheme (D-MCCS) and formulate the cache placement optimization problem to minimize the average rate for the D-MCCS. To solve this challenging non-convex optimization problem, we first propose a successive Geometric Programming (GP) approximation algorithm, which guarantees convergence to a stationary point but has high computational complexity. Next, we develop a low-complexity file-group-based approach, where we propose a popularity-first and size-aware (PF-SA) cache placement strategy to partition files into two groups, taking into account the nonuniformity in file popularity and size. Both algorithms do not require the knowledge of active users beforehand for cache placement. Numerical results show that they perform very closely to each other. We further develop a lower bound for decentralized caching under nonuniform file popularity and size as a non-convex optimization problem and solved it using a similar successive GP approximation algorithm. We show that the D-MCCS with the optimized cache placement attains this lower bound when no more than two active users request files at a time. The same is true for files with uniform size but nonuniform popularity and the optimal cache placement being symmetric among files. In these cases, the optimized D-MCCS characterizes the exact memory-rate tradeoff for decentralized caching. For general cases, our numerical results show that the average rate achieved by the optimized D-MCCS is very close to the lower bound.
References
[1]
Y. Deng and M. Dong, “Memory-rate tradeoff for decentralized caching under nonuniform file popularity,” in Proc. 19th Int. Symp. Modeling Optim. Mobile, Ad hoc, Wireless Netw. (WiOpt), Oct. 2021, pp. 1–8.
[2]
G. S. Paschos, G. Iosifidis, M. Tao, D. Towsley, and G. Caire, “The role of caching in future communication systems and networks,” IEEE J. Sel. Areas Commun., vol. 36, no. 6, pp. 1111–1125, Jun. 2018.
[3]
M. A. Maddah-Ali and U. Niesen, “Fundamental limits of caching,” IEEE Trans. Inf. Theory, vol. 60, no. 5, pp. 2856–2867, May 2014.
[4]
S. P. Shariatpanahi, S. A. Motahari, and B. H. Khalaj, “Multi-server coded caching,” IEEE Trans. Inf. Theory, vol. 62, no. 12, pp. 7253–7271, Dec. 2016.
[5]
N. Karamchandani, U. Niesen, M. A. Maddah-Ali, and S. N. Diggavi, “Hierarchical coded caching,” IEEE Trans. Inf. Theory, vol. 62, no. 6, pp. 3212–3229, Jun. 2016.
[6]
R. Pedarsani, M. A. Maddah-Ali, and U. Niesen, “Online coded caching,” IEEE/ACM Trans. Netw., vol. 24, no. 2, pp. 836–845, Apr. 2016.
[7]
M. Ji, G. Caire, and A. F. Molisch, “Fundamental limits of caching in wireless D2D networks,” IEEE Trans. Inf. Theory, vol. 62, no. 2, pp. 849–869, Feb. 2016.
[8]
A. Sengupta, R. Tandon, and O. Simeone, “Fog-aided wireless networks for content delivery: Fundamental latency tradeoffs,” IEEE Trans. Inf. Theory, vol. 63, no. 10, pp. 6650–6678, Oct. 2017.
[9]
A. M. Ibrahim, A. A. Zewail, and A. Yener, “Coded caching for heterogeneous systems: An optimization perspective,” IEEE Trans. Commun., vol. 67, no. 8, pp. 5321–5335, Aug. 2019.
[10]
D. Cao, D. Zhang, P. Chen, N. Liu, W. Kang, and D. Gündüz, “Coded caching with asymmetric cache sizes and link qualities: The two-user case,” IEEE Trans. Commun., vol. 67, no. 9, pp. 6112–6126, Sep. 2019.
[11]
Y. Deng and M. Dong, “Subpacketization level in optimal placement for coded caching with nonuniform file popularities,” in Proc. 53rd Asilomar Conf. Signals, Syst., Comput., Nov. 2019, pp. 1294–1298.
[12]
M. A. Maddah-Ali and U. Niesen, “Decentralized coded caching attains order-optimal memory-rate tradeoff,” IEEE/ACM Trans. Netw., vol. 23, no. 4, pp. 1029–1040, Aug. 2015.
[13]
M. Mohammadi Amiri, Q. Yang, and D. Gündüz, “Decentralized caching and coded delivery with distinct cache capacities,” IEEE Trans. Commun., vol. 65, no. 11, pp. 4657–4669, Nov. 2017.
[14]
U. Niesen and M. A. Maddah-Ali, “Coded caching with nonuniform demands,” IEEE Trans. Inf. Theory, vol. 63, no. 2, pp. 1146–1158, Feb. 2017.
[15]
M. Ji, A. M. Tulino, J. Llorca, and G. Caire, “Order-optimal rate of caching and coded multicasting with random demands,” IEEE Trans. Inf. Theory, vol. 63, no. 6, pp. 3923–3949, Jun. 2017.
[16]
J. Zhang, X. Lin, and X. Wang, “Coded caching under arbitrary popularity distributions,” IEEE Trans. Inf. Theory, vol. 64, no. 1, pp. 349–366, Jan. 2018.
[17]
J. Zhang, X. Lin, C.-C. Wang, and X. Wang, “Coded caching for files with distinct file sizes,” in Proc. IEEE Int. Symp. Inf. Theory (ISIT), Jun. 2015, pp. 1686–1690.
[18]
J. Zhang, X. Lin, and C. Wang, “Closing the gap for coded caching with distinct file sizes,” in Proc. IEEE Int. Symp. Inf. Theory (ISIT), Jul. 2019, pp. 687–691.
[19]
Q. Wang, Y. Cui, S. Jin, J. Zou, C. Li, and H. Xiong, “Optimization-based decentralized coded caching for files and caches with arbitrary sizes,” IEEE Trans. Commun., vol. 68, no. 4, pp. 2090–2105, Apr. 2020.
[20]
Q. Yu, M. A. Maddah-Ali, and A. S. Avestimehr, “The exact rate-memory tradeoff for caching with uncoded prefetching,” IEEE Trans. Inf. Theory, vol. 64, no. 2, pp. 1281–1296, Feb. 2018.
[21]
L. Zheng, Q. Chen, Q. Yan, and X. Tang, “Decentralized coded caching scheme with heterogeneous file sizes,” IEEE Trans. Veh. Technol., vol. 69, no. 1, pp. 818–827, Jan. 2020.
[22]
K. Wan, D. Tuninetti, and P. Piantanida, “An index coding approach to caching with uncoded cache placement,” IEEE Trans. Inf. Theory, vol. 66, no. 3, pp. 1318–1332, Mar. 2020.
[23]
Y. Deng and M. Dong, “Fundamental structure of optimal cache placement for coded caching with nonuniform demands,” IEEE Trans. Inf. Theory, vol. 68, no. 10, pp. 6528–6547, Oct. 2022.
[24]
Y. Deng and M. Dong, “Memory-rate tradeoff for caching with uncoded placement under nonuniform random demands,” IEEE Trans. Inf. Theory, vol. 68, no. 12, pp. 7850–7870, Dec. 2022.
[25]
A. M. Daniel and W. Yu, “Optimization of heterogeneous coded caching,” IEEE Trans. Inf. Theory, vol. 66, no. 3, pp. 1893–1919, Mar. 2020.
[26]
S. A. Saberali, L. Lampe, and I. F. Blake, “Full characterization of optimal uncoded placement for the structured clique cover delivery of nonuniform demands,” IEEE Trans. Inf. Theory, vol. 66, no. 1, pp. 633–648, Jan. 2020.
[27]
S. Jin, Y. Cui, H. Liu, and G. Caire, “Uncoded placement optimization for coded delivery,” 2017, arXiv:1709.06462.
[28]
A. Ramakrishnan, C. Westphal, and A. Markopoulou, “An efficient delivery scheme for coded caching,” in Proc. 27th Int. Teletraffic Congr., Sep. 2015, pp. 46–54.
[29]
K. Wan, D. Tuninetti, and P. Piantanida, “Novel delivery schemes for decentralized coded caching in the finite file size regime,” in Proc. IEEE Int. Conf. Commun. Workshops (ICC Workshops), May 2017, pp. 1183–1188.
[30]
S. M. Asghari, Y. Ouyang, A. Nayyar, and A. S. Avestimehr, “An approximation algorithm for optimal clique cover delivery in coded caching,” IEEE Trans. Commun., vol. 67, no. 7, pp. 4683–4695, Jul. 2019.
[31]
Y. Deng and M. Dong, “A novel nested coded delivery strategy for coded caching under nonuniform file popularity,” IEEE Commun. Lett., vol. 27, no. 3, pp. 807–811, Mar. 2023.
[32]
H. Cheng, C. Li, H. Xiong, and P. Frossard, “Optimal decentralized coded caching for heterogeneous files,” in Proc. 25th Eur. Signal Process. Conf. (EUSIPCO), Aug. 2017, pp. 2531–2535.
[33]
C. Chang and C. Wang, “Coded caching with heterogeneous file demand sets—The insufficiency of selfish coded caching,” in Proc. IEEE Int. Symp. Inf. Theory (ISIT), Jul. 2019, pp. 1–5.
[34]
C. Zhang, S. Wang, V. Aggarwal, and B. Peleato, “Coded caching with heterogeneous user profiles,” IEEE Trans. Inf. Theory, early access, Jun. 24, 2022. 10.1109/TIT.2022.3186210.
[35]
P. Hassanzadeh, A. M. Tulino, J. Llorca, and E. Erkip, “Rate-memory trade-off for caching and delivery of correlated sources,” IEEE Trans. Inf. Theory, vol. 66, no. 4, pp. 2219–2251, Apr. 2020.
[36]
Q. Yang and D. Gündüz, “Coded caching and content delivery with heterogeneous distortion requirements,” IEEE Trans. Inf. Theory, vol. 64, no. 6, pp. 4347–4364, Jun. 2018.
[37]
P. Hassanzadeh, A. M. Tulino, J. Llorca, and E. Erkip, “Rate-Distortion-Memory trade-offs in heterogeneous caching networks,” IEEE Trans. Wireless Commun., vol. 19, no. 5, pp. 3019–3033, May 2020.
[38]
E. Parrinello, A. Unsal, and P. Elia, “Fundamental limits of coded caching with multiple antennas, shared caches and uncoded prefetching,” IEEE Trans. Inf. Theory, vol. 66, no. 4, pp. 2252–2268, Apr. 2020.
[39]
M. Avriel, Advances in Geometric Programming. New York, NY, USA: PlenumPress, 1980.
[40]
M. Chiang, C. W. Tan, D. P. Palomar, D. O’neill, and D. Julian, “Power control by geometric programming,” IEEE Trans. Wireless Commun., vol. 6, no. 7, pp. 2640–2651, Jul. 2007.
Index Terms
- Decentralized Caching Under Nonuniform File Popularity and Size: Memory-Rate Tradeoff Characterization
Index terms have been assigned to the content through auto-classification.
Recommendations
Decentralized coded caching attains order-optimal memory-rate tradeoff
Replicating or caching popular content in memories distributed across the network is a technique to reduce peak network loads. Conventionally, the main performance gain of this caching was thought to result from making part of the requested data ...
File popularity characterisation
A key determinant of the effectiveness of a web cache is the locality of the files requested. In the past this has been difficult to model, as locality appears to be cache specific. We show that locality can be characterised with a single parameter, ...
Comments
Information & Contributors
Information
Published In
1558-2566 © 2023 IEEE. Personal use is permitted, but republication/redistribution requires IEEE permission. See https://www.ieee.org/publications/rights/index.html for more information.
Publisher
IEEE Press
Publication History
Published: 22 June 2023
Published in TON Volume 32, Issue 1
Qualifiers
- Research-article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 9Total Downloads
- Downloads (Last 12 months)9
- Downloads (Last 6 weeks)1
Reflects downloads up to 11 Aug 2024
Other Metrics
Citations
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in