User Preference Aware Lossy Data Compression for Edge Caching

Yawei Lu; Wei Chen; H. Vincent Poor

doi:10.1109/GLOBECOM42002.2020.9348242

User Preference Aware Lossy Data Compression for Edge Caching

Yawei Lu, Wei Chen, H. Vincent Poor

Research output: Contribution to journal › Conference article › peer-review

2 Scopus citations

Abstract

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.

Original language	English (US)
Article number	9348242
Journal	Proceedings - IEEE Global Communications Conference, GLOBECOM
Volume	2020-January
DOIs	https://doi.org/10.1109/GLOBECOM42002.2020.9348242
State	Published - Dec 2020
Externally published	Yes
Event	2020 IEEE Global Communications Conference, GLOBECOM 2020 - Virtual, Taipei, Taiwan, Province of China Duration: Dec 7 2020 → Dec 11 2020

All Science Journal Classification (ASJC) codes

Artificial Intelligence
Computer Networks and Communications
Hardware and Architecture
Signal Processing

Access to Document

10.1109/GLOBECOM42002.2020.9348242

Cite this

@article{f309552badbf42caa53b81bf520e8dea,

title = "User Preference Aware Lossy Data Compression for Edge Caching",

abstract = "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.",

author = "Yawei Lu and Wei Chen and Poor, {H. Vincent}",

note = "Publisher Copyright: {\textcopyright} 2020 IEEE.; 2020 IEEE Global Communications Conference, GLOBECOM 2020 ; Conference date: 07-12-2020 Through 11-12-2020",

year = "2020",

month = dec,

doi = "10.1109/GLOBECOM42002.2020.9348242",

language = "English (US)",

volume = "2020-January",

journal = "Proceedings - IEEE Global Communications Conference, GLOBECOM",

issn = "2334-0983",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - JOUR

T1 - User Preference Aware Lossy Data Compression for Edge Caching

AU - Lu, Yawei

AU - Chen, Wei

AU - Poor, H. Vincent

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 article

AN - SCOPUS:85101218617

SN - 2334-0983

VL - 2020-January

JO - Proceedings - IEEE Global Communications Conference, GLOBECOM

JF - Proceedings - IEEE Global Communications Conference, GLOBECOM

M1 - 9348242

T2 - 2020 IEEE Global Communications Conference, GLOBECOM 2020

Y2 - 7 December 2020 through 11 December 2020

ER -

User Preference Aware Lossy Data Compression for Edge Caching

Abstract

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this