Abstract
We study the performance of caching schemes based on two different coding techniques. A heterogeneous network is assumed, in which cache-aided relays are connected through a backhaul link to a master node while no connection exits between users and the master node. The first caching scheme considers to fill the cache with encoded content while the second scheme considers to encode the content during the delivery phase. We compare the schemes by characterizing the average transmission load when users ask for downloading content to the network. We provide an approximation of the expression of the average load which allows a fast evaluation of the network behavior for each scheme considered. We further assume a constraint on the capacity of the backhaul link and derive the expression of the outage probability, i.e. the probability that the system is not able to serve the entire set of users demands. Finally, we examine and discuss how the derived analysis of a two relays scenario can be scaled to study the performance of a network with a generic number of relays.
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.
