We address this problem by proposing a two-time-scale framework that jointly optimizes service (data & code) placement and request scheduling.

Feb 3, 2021 · Furthermore, we develop a polynomial-time request scheduling algorithm by computing the maximum flow in a carefully constructed auxiliary graph, ...

When some of the edge clouds are heavily loaded, it has been shown that users can benefit from getting served by non- nearest edge clouds in the same ...

Abstract—Mobile edge computing provides the opportunity for wireless users to exploit the power of cloud computing without a large communication delay.

To serve data-intensive applications (e.g., video analytics, machine learning tasks) from the edge, we need, in addition to computation resources, storage ...

Dive into the research topics of 'Service placement and request scheduling for data-intensive applications in edge clouds'. Together they form a unique ...

This work develops a polynomial-time algorithm that achieves a constant-factor approximation under certain conditions and proposes a two-time-scale ...

Mar 5, 2021 · To serve data-intensive applications (e.g., video analytics, machine learning tasks) from the edge, we need, in addition to computation ...

To serve data-intensive applications (e.g., augmented reality, video analytics) from the edge, we need, in addition to CPU cycles and memory for computation, ...

Jan 16, 2019 · Service Placement and Request Scheduling for Data-intensive Applications in Edge Clouds. April 2019. DOI:10.1109/INFOCOM.2019.8737368.