Service Caching For Edge Computing-Enabled Heterogeneous Networks

In this paper, we consider a edge computing (EC)- enabled heterogeneous network. By using tools from stochastic geometry and queuing theory, we derive the service probability. Then, we formulate the service probability maximization problem with respect to (w.r.t.) the service caching decision. By using successive convex approximation (SCA), we obtain a stationary point of the non-convex problem. Finally, by using numerical results, we show the proposed solution achieves a higher service probability than the baseline schemes.