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.
Discussion(0)
No comments yet. Be the first to comment.