Key points are not available for this paper at this time.
The emergence of mobile applications like self-driving cars, networked gaming, virtual reality, and augmented reality has created a demand for computation-intensive and latency critical applications. The dense deployment of base stations (BSs) makes the overlapping coverage of BS that induces the placement of services and routing the requests to the appropriate node is a challenging issue. Further, the limited resources at the edge node invite additional problems of allocating the existing limited edge resources cooperatively to fulfil the user demands. To address the problems mentioned above, we formulate the cooperative service placement and routing problem by placing the diversified latency critical services to maximize the time utility with the deadline and resource constraints. The problem is formulated as an integer linear programming problem for cooperative service placement in mobile edge networks. A greedy and randomized rounding technique is presented to solve the service caching and request routing problems decomposed from the proposed problem. Further, a heuristic algorithm based on the circular convex set is presented to solve the proposed NP-hard problem. Extensive simulation results demonstrate that the proposed cooperative service placement schemes significantly improve the delay, cache hit ratio, load on cloud, and time utility performance compared with existing mechanisms.
Somesula et al. (Fri,) studied this question.