TY - JOUR
T1 - Exploiting coding and recommendation to improve cache efficiency of reliability-aware wireless edge caching networks
AU - Fu, Yaru
AU - Yu, Quan
AU - Wong, Angus K.Y.
AU - Shi, Zheng
AU - Wang, Hong
AU - Quek, Tony Q.S.
N1 - Publisher Copyright:
© 2002-2012 IEEE.
PY - 2021/11/1
Y1 - 2021/11/1
N2 - In this paper, a full-stack perspective that involves content coding, caching and recommendation is presented for wireless edge caching networks. Therein, content coding and recommendations are utilized to ensure the reliability of the network and to boost the gain of edge caching, respectively. Specifically, with a well-designed coding pattern, the concurrently occurred data corruptions of multiple access points (APs) can be successfully recovered. Whilst, the successful content retrieval is warranted with highly selective retrieval sets. Further, by offering personalized recommendations, the cache hitting at network edges can be promoted. On these grounds, a cache hit ratio maximization problem for reliability-aware wireless edge caching system is formulated, considering the successful content retrieval and repair, total repair cost requirements, cache capacity budget of each AP, and recommendation quality and quantity per user. To solve this intractable problem, a framework with two steps is developed, which leads to construction of a suitable coding schema with the minimum repair cost per content to satisfy the retrieval and repair criteria, thus achieving a stabilized optimal solution regarding the joint cache placement and recommendation decisions from a game-theoretical viewpoint. Finally, extensive numerical simulations are performed to confirm the superior performance of our devised algorithms compared with benchmark baselines.
AB - In this paper, a full-stack perspective that involves content coding, caching and recommendation is presented for wireless edge caching networks. Therein, content coding and recommendations are utilized to ensure the reliability of the network and to boost the gain of edge caching, respectively. Specifically, with a well-designed coding pattern, the concurrently occurred data corruptions of multiple access points (APs) can be successfully recovered. Whilst, the successful content retrieval is warranted with highly selective retrieval sets. Further, by offering personalized recommendations, the cache hitting at network edges can be promoted. On these grounds, a cache hit ratio maximization problem for reliability-aware wireless edge caching system is formulated, considering the successful content retrieval and repair, total repair cost requirements, cache capacity budget of each AP, and recommendation quality and quantity per user. To solve this intractable problem, a framework with two steps is developed, which leads to construction of a suitable coding schema with the minimum repair cost per content to satisfy the retrieval and repair criteria, thus achieving a stabilized optimal solution regarding the joint cache placement and recommendation decisions from a game-theoretical viewpoint. Finally, extensive numerical simulations are performed to confirm the superior performance of our devised algorithms compared with benchmark baselines.
KW - Cache hit ratio
KW - multi-failure pattern
KW - recommendations
KW - repair cost
KW - retrieval set
KW - wireless edge caching
UR - http://www.scopus.com/inward/record.url?scp=85107219120&partnerID=8YFLogxK
U2 - 10.1109/TWC.2021.3081682
DO - 10.1109/TWC.2021.3081682
M3 - Article
AN - SCOPUS:85107219120
SN - 1536-1276
VL - 20
SP - 7243
EP - 7256
JO - IEEE Transactions on Wireless Communications
JF - IEEE Transactions on Wireless Communications
IS - 11
ER -