Content caching offers an effective solution to reduce the traffic load and alleviate the burden on backhaul links in future wireless networks. In this paper, we study the converged networks to push and cache the popular services. The popular services are delivered by the broadcasting networks, and cached in the router nodes in a distributed cache network. Due to the limited storage capacity of the router node, we formulate the service scheduling problem as a Markov Decision Process (MDP), aiming to maximize the equivalent throughput. Considering the large state space involved in the distributed cache network, it is great challenge to obtain a tractable solution by the classical optimization algorithm. To tackle this problem, we propose a service scheduling strategy based on deep Q-learning. Simulation results demonstrate that the proposed scheme can significantly improve the equivalent throughput of the converged networks.
Distributed Caching Popular Services by Using Deep Q-Learning in Converged Networks
2019-09-01
835533 byte
Aufsatz (Konferenz)
Elektronische Ressource
Englisch
IEEE | 2023
|Get safeguards ready for converged networks
British Library Online Contents | 2005
Flexible TWDM PON with WDM overlay for converged services
British Library Online Contents | 2015
|