TY - GEN
T1 - User Preference Aware Lossy Data Compression for Edge Caching
AU - Lu, Yawei
AU - Chen, Wei
AU - Poor, H. Vincent
N1 - Funding Information:
This research was supported in part by the U.S. National Science Foundation under Grants CCF-0939370 and CCF-1908308, the National Natural Science Foundation of China under Grant No. 61671269, and the National Key Research and Development Program 2018YFA0701601.
Publisher Copyright:
© 2020 IEEE.
PY - 2020/12
Y1 - 2020/12
N2 - In order to handle users' heterogeneous quality of service requirements at the network edge, user preference aware lossy data compression is presented for edge caching. The symbols generated by an information source are compressed and then are transmitted to a base station. Before being transmitted to users, the symbols can be re-compressed at the network edge. User preferences are described by weights on the symbols. All possible values of the rates over the transmission links and the distortions suffered by the users form an achievable domain. The achievable domain is a convex set and an optimization problem is formulated in order to obtain its lower boundary. For discrete sources, the optimization problem is nonconvex and a DCA-based iterative algorithm is proposed to provide suboptimal code designs.
AB - In order to handle users' heterogeneous quality of service requirements at the network edge, user preference aware lossy data compression is presented for edge caching. The symbols generated by an information source are compressed and then are transmitted to a base station. Before being transmitted to users, the symbols can be re-compressed at the network edge. User preferences are described by weights on the symbols. All possible values of the rates over the transmission links and the distortions suffered by the users form an achievable domain. The achievable domain is a convex set and an optimization problem is formulated in order to obtain its lower boundary. For discrete sources, the optimization problem is nonconvex and a DCA-based iterative algorithm is proposed to provide suboptimal code designs.
UR - http://www.scopus.com/inward/record.url?scp=85101218617&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85101218617&partnerID=8YFLogxK
U2 - 10.1109/GLOBECOM42002.2020.9348242
DO - 10.1109/GLOBECOM42002.2020.9348242
M3 - Conference contribution
AN - SCOPUS:85101218617
T3 - 2020 IEEE Global Communications Conference, GLOBECOM 2020 - Proceedings
BT - 2020 IEEE Global Communications Conference, GLOBECOM 2020 - Proceedings
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2020 IEEE Global Communications Conference, GLOBECOM 2020
Y2 - 7 December 2020 through 11 December 2020
ER -