Deakin University
Browse

Cost-Effective App Data Distribution in Edge Computing

Version 2 2024-06-04, 15:05
Version 1 2020-07-23, 11:32
journal contribution
posted on 2024-06-04, 15:05 authored by X Xia, Feifei ChenFeifei Chen, Q He, JC Grundy, Mohamed AbdelrazekMohamed Abdelrazek, H Jin
Edge computing, as an extension of cloud computing, distributes computing and storage resources from centralized cloud to distributed edge servers, to power a variety of applications demanding low latency, e.g., IoT services, virtual reality, real-time navigation, etc. From an app vendor's perspective, app data needs to be transferred from the cloud to specific edge servers in an area to serve the app users in the area. However, according to the pay-as-you-go business model, distributing a large amount of data from the cloud to edge servers can be expensive. The optimal data distribution strategy must minimize the cost incurred, which includes two major components, the cost of data transmission between the cloud to edge servers and the cost of data transmission between edge servers. In the meantime, the delay constraint must be fulfilled - the data distribution must not take too long. In this paper, we make the first attempt to formulate this Edge Data Distribution (EDD) problem from the app vendor's perspective and prove its NP-hardness. We propose an optimal approach named EDD-IP and an O(k)-approximation algorithm named EDD-A. EDD-IP and EDD-A are evaluated on a real-world dataset and the results demonstrate that they significantly outperform three representative approaches.

History

Journal

IEEE Transactions on Parallel and Distributed Systems

Volume

32

Pagination

31-44

Location

Piscataway, N.J.

ISSN

1045-9219

eISSN

1558-2183

Language

English

Publication classification

C1 Refereed article in a scholarly journal

Issue

1

Publisher

IEEE COMPUTER SOC