Abstract
The concentrated popularity distribution of video files and the caching of popular files on users and their subsequent distribution via device-to-device (D2D) communications have dramatically increased the throughput of wireless video networks. However, since popularity distribution is not time-invariant, and the files available in the neighborhood can change when other users move into and out of the neighborhood, there is a need for replacement of cache content. In this work, we propose a practical and feasible replacement architecture for base station (BS) assisted wireless D2D caching networks by exploiting the broadcasting of the BS. Based on the proposed architecture, we formulate a caching content replacement problem, with the goal of maximizing the time-average service rate under the cost constraint and queue stability. We combine the reward-to-go concept and the drift-plus-penalty methodology to develop a solution framework for the problem at hand. To realize the solution framework, two algorithms are proposed. The first algorithm is simple, but exploits only the historical record. The second algorithm can exploit both the historical record and future information, but is complex. Our simulation results indicate that when dynamics exist, the systems exploiting the proposed designs can outperform the systems using a static policy.
Highlights
The demand of wireless traffic has increased dramatically in the past several years, and this demand is expected to continue to grow in the future [2]
To provide a general design for the network, we describe the network using several random processes, i.e., service process that describes the services for video file requests, arrival process that describes the arrivals of requests, and outage process that describes the dropping of requests
We propose a solution framework that incorporates the reward-to-go concept into the drift-plus-penalty methodology and discuss the insights and benefits gained from adopting this framework
Summary
The demand of wireless traffic has increased dramatically in the past several years, and this demand is expected to continue to grow in the future [2]. Based on real-data observations, [34] established a workload model and developed simple caching content replacement policies for edge-caching networks These caching replacement policies for femtocaching do not carry over to D2D caching networks due to the following: (i) the use of more constrained wireless channels demands a specific architecture for conducting replacement; (ii) the distributed file-caching structure and intertwined D2D cooperations and communications between users result in a more complicated and constrained conditions for making replacement decisions; and (iii) the locally available cached files can change with time due to user mobility, e.g., users carrying critical files could vanish right after the replacement actions. The first algorithm makes myopic decisions to minimize the upper bound of the drift-plus-penalty term This approach is fairly simple; it uses historical record and present system states without considering future information. The simulation results provide insights into the dynamic replacement process performed in this paper
Sign-in/Register to view highlights & summary 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.
