Abstract
With similarity-based content delivery, the request for a content can be satisfied by delivering a related content under a dissimilarity cost. This letter addresses the joint optimization of caching and similarity-based delivery decisions across a network so as to minimize the weighted sum of average delay and dissimilarity cost. A convergent alternate gradient descent ascent algorithm is first introduced for an offline scenario with prior knowledge of the request rates, and then extended to an online setting. Numerical results validate the advantages of the approach with respect to standard per-cache solutions.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
