Next-generation wireless networks will provide users ubiquitous low-latency computing services using devices at the network edge, called mobile edge computing (MEC). The key operation of MEC is to offload computation intensive tasks from users. Since each edge device comprises an access point (AP) and a computer server (CS), an MEC network can be decomposed as a radio access network cascaded with a CS network. Based on the architecture, we investigate network-constrained latency performance, namely communication latency and computation latency, under the constraints of radio-access connectivity and CS stability. To this end, a spatial random network is modeled featuring random node distribution, parallel computing, non-orthogonal multiple access, and random computation-task generation. Given the model and the said network constraints, we derive the scaling laws of communication latency and computation latency with respect to network-load parameters (density of mobiles and their task-generation rates) and network-resource parameters (bandwidth, density of APs/CSs, and CS computation rate). Essentially, the analysis involves the interplay of the theories of stochastic geometry, queueing, and parallel computing. Combining the derived scaling laws quantifies the tradeoffs between the latencies, network connectivity, and network stability. The results provide useful guidelines for MEC-network provisioning and planning by avoiding either of the cascaded radio access network or CS network being a performance bottleneck.
In REF , the authors studied the latency performance of a large-scale MEC network.
Wireless Networks for Mobile Edge Computing: Spatial Modeling and Latency Analysis
IEEE Transactions on Wireless Communications
IEEE Transactions on Wireless Communications
Computer Science Mathematics