TY - JOUR
T1 - Revenue Maximization for Content-Oriented Wireless Caching Networks (CWCNs) with Repair and Recommendation Considerations
AU - Fu, Yaru
AU - Yu, Quan
AU - Quek, Tony Q.S.
AU - Wen, Wanli
N1 - Funding Information:
This work was supported in part by the National Natural Science Foundation of China (NSFC) under Grant 61801342 and Grant 61971239.
Publisher Copyright:
© 2002-2012 IEEE.
PY - 2021/1
Y1 - 2021/1
N2 - To maintain reliability of content-oriented wireless caching networks (CWCNs), repair mechanism is of necessity to be considered due to the natural that storage entities are individually unreliable and thus subject to failure on account of hardware error, network congestion or software updating. Meanwhile, recommendation is tunable for edge caching performance improvement. In this paper, we study the revenue maximization problem for CWCNs with both repair and recommendation considerations. The formulated problem is an integer non-convex and non-linear problem, and thus is difficult to be solved. The difficulties are intrinsically derived from the implicit weighted sum costs (WSCs) as regards storage and repair of each content and the coupling among the Boolean variables. For the sake of analytical tractability, a two-step methodology is developed. Specifically, we first explore the optimal storage and repair amount among the content providers to minimize the WSCs in terms of successfully fixing any occurred data corruption for the stored contents. Thereof, an explicit instance is provided to show how the contents can be coded, stored and then repaired in our network given that an error occurs. Based on the obtained storage and repair amount vectors, we solve the resultant joint caching and recommendation decision making problem (DMP). To be more specific, we decouple the DMP into a pair of subproblems, namely a cache placement and a recommendation optimization subproblems. For each subproblem, a globally optimal and a time-efficient suboptimal solutions are developed, respectively. Later, a versatile iterative paradigm is devised to do the decision making jointly. The convergence performance and the complexity analysis of the proposed algorithms are rigorously analyzed. Numerical results confirm the convergence performance of our iterative algorithms and illustrate their revenue improvements compared to various baseline schemes.
AB - To maintain reliability of content-oriented wireless caching networks (CWCNs), repair mechanism is of necessity to be considered due to the natural that storage entities are individually unreliable and thus subject to failure on account of hardware error, network congestion or software updating. Meanwhile, recommendation is tunable for edge caching performance improvement. In this paper, we study the revenue maximization problem for CWCNs with both repair and recommendation considerations. The formulated problem is an integer non-convex and non-linear problem, and thus is difficult to be solved. The difficulties are intrinsically derived from the implicit weighted sum costs (WSCs) as regards storage and repair of each content and the coupling among the Boolean variables. For the sake of analytical tractability, a two-step methodology is developed. Specifically, we first explore the optimal storage and repair amount among the content providers to minimize the WSCs in terms of successfully fixing any occurred data corruption for the stored contents. Thereof, an explicit instance is provided to show how the contents can be coded, stored and then repaired in our network given that an error occurs. Based on the obtained storage and repair amount vectors, we solve the resultant joint caching and recommendation decision making problem (DMP). To be more specific, we decouple the DMP into a pair of subproblems, namely a cache placement and a recommendation optimization subproblems. For each subproblem, a globally optimal and a time-efficient suboptimal solutions are developed, respectively. Later, a versatile iterative paradigm is devised to do the decision making jointly. The convergence performance and the complexity analysis of the proposed algorithms are rigorously analyzed. Numerical results confirm the convergence performance of our iterative algorithms and illustrate their revenue improvements compared to various baseline schemes.
UR - http://www.scopus.com/inward/record.url?scp=85091909177&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85091909177&partnerID=8YFLogxK
U2 - 10.1109/TWC.2020.3024644
DO - 10.1109/TWC.2020.3024644
M3 - Article
AN - SCOPUS:85091909177
SN - 1536-1276
VL - 20
SP - 284
EP - 298
JO - IEEE Transactions on Wireless Communications
JF - IEEE Transactions on Wireless Communications
IS - 1
M1 - 9206079
ER -