TY - JOUR
T1 - Multicast pushing with content request delay information
AU - Lu, Yawei
AU - Chen, Wei
AU - Poor, H. Vincent
N1 - Funding Information:
Manuscript received January 18, 2017; revised August 1, 2017 and October 29, 2017; accepted November 7, 2017. Date of publication November 14, 2017; date of current version March 15, 2018. This research was supported in part by the US National Science Foundation under Grant CNS-1456793, the National Science Foundation of China under Grant Nos. 61671269 and 61621091, and the National 10000-Talent Program of China. The associate editor coordinating the review of this paper and approving it for publication was B. Liang. (Corresponding author: Wei Chen.) Y. Lu and W. Chen are with the Department of Electronic Engineering and Tsinghua National Laboratory for Information Science and Technology, Tsinghua University, Beijing 100084, China (e-mail: lyw15@ mails.tsinghua.edu.cn; wchen@tsinghua.edu.cn).
Publisher Copyright:
© 1972-2012 IEEE.
PY - 2018/3
Y1 - 2018/3
N2 - Multicasting can reduce network traffic in multiuser systems by serving multiple users simultaneously. The benefits of multicasting basically come from the overlapping and synchronism of user requests. Pushing and caching are techniques that prestore content items in buffers closer to users based on the prediction of user requests, thereby providing a promising approach to eliminating the asynchronism of user requests and creating multicasting opportunities. This paper studies a multiuser wireless communication system, in which the buffers for caching are deployed in the user terminals. Based on the request delay information (RDI) which describes when the users request content items in a deterministic or statistical way, a joint pushing and caching (JPC) method is presented to schedule the content items pushed by the base station and cached in the user buffers. In this paper, multicasting JPC systems work in two modes, without or with the feedback of RDI. Furthermore, RDI is classified into three forms, namely, noncausal, statistical, and causal. Static and dynamic JPC policies are, respectively, proposed for the two work modes. In addition, the effective throughput resulting from JPC under the three forms of RDI is demonstrated via theoretical analysis and simulation.
AB - Multicasting can reduce network traffic in multiuser systems by serving multiple users simultaneously. The benefits of multicasting basically come from the overlapping and synchronism of user requests. Pushing and caching are techniques that prestore content items in buffers closer to users based on the prediction of user requests, thereby providing a promising approach to eliminating the asynchronism of user requests and creating multicasting opportunities. This paper studies a multiuser wireless communication system, in which the buffers for caching are deployed in the user terminals. Based on the request delay information (RDI) which describes when the users request content items in a deterministic or statistical way, a joint pushing and caching (JPC) method is presented to schedule the content items pushed by the base station and cached in the user buffers. In this paper, multicasting JPC systems work in two modes, without or with the feedback of RDI. Furthermore, RDI is classified into three forms, namely, noncausal, statistical, and causal. Static and dynamic JPC policies are, respectively, proposed for the two work modes. In addition, the effective throughput resulting from JPC under the three forms of RDI is demonstrated via theoretical analysis and simulation.
KW - Multicasting
KW - effective throughput
KW - joint pushing and caching
KW - request delay information
UR - http://www.scopus.com/inward/record.url?scp=85036579626&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85036579626&partnerID=8YFLogxK
U2 - 10.1109/TCOMM.2017.2773522
DO - 10.1109/TCOMM.2017.2773522
M3 - Article
AN - SCOPUS:85036579626
SN - 0090-6778
VL - 66
SP - 1078
EP - 1092
JO - IEEE Transactions on Communications
JF - IEEE Transactions on Communications
IS - 3
ER -