TY - GEN
T1 - Joint Pushing and Caching Based on Physical Layer Multicasting and Network Coding
AU - Lu, Yawei
AU - Chen, Wei
AU - Poor, H. Vincent
PY - 2017/7/1
Y1 - 2017/7/1
N2 - Caching is a promising technique to reduce traffic by storing popular content items in the buffers of users prior to user demand. In this paper, a two-phase physical layer multicasting system is investigated, in which the users are equipped with buffers and content request delay information (RDI) is available at the serving base station (BS). Based on RDI, transmissions are initiated to satisfy user requests within delay constraints. To minimize the expected traffic, a joint pushing and caching (JPC) method is presented to jointly determine the content items transmitted by the BS and cached in the user buffers. It is shown that minimizing the expected traffic can be transformed into a network coding problem. A framework is presented to formulate the JPC policies via optimization problems, which however are intractable. To find the optimal uncoded caching policy, the optimization problems are reduced to linear programs. In addition, a generalized coded caching algorithm is proposed to give a sub- optimal coded JPC policy. A lower bound on the expected traffic is also analyzed. Simulations show that the traffic resulting from the proposed algorithms approaches the lower bound if the buffer size is large.
AB - Caching is a promising technique to reduce traffic by storing popular content items in the buffers of users prior to user demand. In this paper, a two-phase physical layer multicasting system is investigated, in which the users are equipped with buffers and content request delay information (RDI) is available at the serving base station (BS). Based on RDI, transmissions are initiated to satisfy user requests within delay constraints. To minimize the expected traffic, a joint pushing and caching (JPC) method is presented to jointly determine the content items transmitted by the BS and cached in the user buffers. It is shown that minimizing the expected traffic can be transformed into a network coding problem. A framework is presented to formulate the JPC policies via optimization problems, which however are intractable. To find the optimal uncoded caching policy, the optimization problems are reduced to linear programs. In addition, a generalized coded caching algorithm is proposed to give a sub- optimal coded JPC policy. A lower bound on the expected traffic is also analyzed. Simulations show that the traffic resulting from the proposed algorithms approaches the lower bound if the buffer size is large.
UR - http://www.scopus.com/inward/record.url?scp=85046427509&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85046427509&partnerID=8YFLogxK
U2 - 10.1109/GLOCOM.2017.8254965
DO - 10.1109/GLOCOM.2017.8254965
M3 - Conference contribution
T3 - 2017 IEEE Global Communications Conference, GLOBECOM 2017 - Proceedings
SP - 1
EP - 6
BT - 2017 IEEE Global Communications Conference, GLOBECOM 2017 - Proceedings
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2017 IEEE Global Communications Conference, GLOBECOM 2017
Y2 - 4 December 2017 through 8 December 2017
ER -