Joint Pushing and Caching for Bandwidth Utilization Maximization in Wireless Networks

摘要

Joint pushing and caching is recognized as an efficient remedy to the problem of spectrum scarcity incurred by tremendous mobile data traffic. In this paper, we design the optimal joint pushing and caching policy to maximize bandwidth utilization, which is of fundamental importance to mobile telecom carriers. In particular, we consider a multiuser wireless network with multicast opportunities where each user is equipped with a cache of limited size. First, we formulate the stochastic optimization problem as an infinite horizon average cost Markov decision process. By the structural analysis, we show that how the optimal policy achieves a balance between the current transmission cost and the future average transmission cost. We also show that the optimal average transmission cost decreases with the cache sizes, revealing a tradeoff between storage and bandwidth. Then, due to the fact that obtaining a numerical optimal solution suffers the curse of dimensionality and implementing it requires a centralized controller and global system information, we develop a low-complexity decentralized policy (LDP) by using a linear approximation of the value function and transforming challenging discrete optimization problems into difference of convex (DC) problems, which can be efficiently solved by using DC algorithms. We also obtain an upper bound on the performance gap between the average cost of LDP and the minimum average cost, which can be easily evaluated. Next, we propose an online decentralized algorithm to implement the proposed LDP, when priori knowledge of user demand processes is not available. Finally, using numerical results, we demonstrate the advantage of the proposed solutions over some existing designs. The results in this paper offer useful guidelines for designing practical cache-enabled multiuser wireless networks.