TY - GEN
T1 - Sequential Hypothesis Criterion Based Optimal Caching Schemes Over Mobile Wireless Networks
AU - Zhang, Xi
AU - Zw, Qixuan
AU - Poor, H. Vincent
N1 - Publisher Copyright:
© 2020 IEEE.
PY - 2020/6
Y1 - 2020/6
N2 - The sequential hypothesis testing technique has been broadly applied in a large number of engineering applications because it provides the efficient rules to make a decision of accepting one of hypotheses at any stage of the experiment. One important application is the optimal caching scheme design in 5G and beyond mobile wireless networks through observing the data contents requested by mobile users as an experiment and making a decision on what distribution of the requested data-content is. Making this decision, cache stations in mobile wireless network are able to estimate the popularity of requested data contents in the future and thus proactively cache the popular data contents in nearby mobile users to avoid the retransmission and its delay for the same data, optimizing the time-sensitive data download services. Towards this end, we model the optimal caching as the estimation strategy problem of future data popularity through developing the optimal stopping and decision rules under the Zipf sequential hypothesis testing. First, we show that our developed Zipf sequential hypothesis testing is exponentially bounded. Then, we derive the lower bound of the stopping time. Finally, we derive the closed-form solution of optimal stopping and decision rules for sequential hypothesis testing under the Zipf distribution.
AB - The sequential hypothesis testing technique has been broadly applied in a large number of engineering applications because it provides the efficient rules to make a decision of accepting one of hypotheses at any stage of the experiment. One important application is the optimal caching scheme design in 5G and beyond mobile wireless networks through observing the data contents requested by mobile users as an experiment and making a decision on what distribution of the requested data-content is. Making this decision, cache stations in mobile wireless network are able to estimate the popularity of requested data contents in the future and thus proactively cache the popular data contents in nearby mobile users to avoid the retransmission and its delay for the same data, optimizing the time-sensitive data download services. Towards this end, we model the optimal caching as the estimation strategy problem of future data popularity through developing the optimal stopping and decision rules under the Zipf sequential hypothesis testing. First, we show that our developed Zipf sequential hypothesis testing is exponentially bounded. Then, we derive the lower bound of the stopping time. Finally, we derive the closed-form solution of optimal stopping and decision rules for sequential hypothesis testing under the Zipf distribution.
KW - Sequential hypothesis testing
KW - Zipf distribution
KW - optimal cache schemes
KW - optimal stopping and decision rules
UR - http://www.scopus.com/inward/record.url?scp=85090412628&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85090412628&partnerID=8YFLogxK
U2 - 10.1109/ISIT44484.2020.9174031
DO - 10.1109/ISIT44484.2020.9174031
M3 - Conference contribution
AN - SCOPUS:85090412628
T3 - IEEE International Symposium on Information Theory - Proceedings
SP - 1254
EP - 1258
BT - 2020 IEEE International Symposium on Information Theory, ISIT 2020 - Proceedings
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2020 IEEE International Symposium on Information Theory, ISIT 2020
Y2 - 21 July 2020 through 26 July 2020
ER -