Probabilistic Caching Policy for Categorized Contents and Consecutive User Demands | IEEE Conference Publication | IEEE Xplore

Probabilistic Caching Policy for Categorized Contents and Consecutive User Demands


Abstract:

In wireless caching networks, each user generally consumes more than one content in a row, and the number of consecutive demands could vary for different users. In additi...Show More

Abstract:

In wireless caching networks, each user generally consumes more than one content in a row, and the number of consecutive demands could vary for different users. In addition, popular contents are usually classified into several categories. In this case for consecutive user demands, the content popularity model largely depends on the previously consumed contents, i.e., contents that belong to the same category as the previously consumed content would be highly popular. Based on this observation, this paper proposes an optimal probabilistic caching policy for consecutive user demands in categorized contents. The proposed caching scheme maximizes the minimum of the success probabilities for content delivery of all users when individual users request different numbers of contents in a row. Comparing with the content placement optimized for one-shot request, intensive numerical results verify the impacts of categorized contents and consecutive user demands on the caching policy.
Date of Conference: 20-24 May 2019
Date Added to IEEE Xplore: 15 July 2019
ISBN Information:

ISSN Information:

Conference Location: Shanghai, China

References

References is not available for this document.