Pith. sign in

REVIEW

Energy-Efficient Resource Allocation for Cache-Assisted Mobile Edge Computing

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1708.04813 v1 pith:6YV346KW submitted 2017-08-16 cs.IT math.IT

Energy-Efficient Resource Allocation for Cache-Assisted Mobile Edge Computing

classification cs.IT math.IT
keywords cachingcomputationcomputingproblemresultssolutioncache-assisteddownloading
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

In this paper, we jointly consider communication, caching and computation in a multi-user cache-assisted mobile edge computing (MEC) system, consisting of one base station (BS) of caching and computing capabilities and multiple users with computation-intensive and latency-sensitive applications. We propose a joint caching and offloading mechanism which involves task uploading and executing for tasks with uncached computation results as well as computation result downloading for all tasks at the BS, and efficiently utilizes multi-user diversity and multicasting opportunities. Then, we formulate the average total energy minimization problem subject to the caching and deadline constraints to optimally allocate the storage resource at the BS for caching computation results as well as the uploading and downloading time durations. The problem is a challenging mixed discrete-continuous optimization problem. We show that strong duality holds, and obtain an optimal solution using a dual method. To reduce the computational complexity, we further propose a low-complexity suboptimal solution. Finally, numerical results show that the proposed suboptimal solution outperforms existing comparison schemes.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.