Constrained app data caching over edge server graphs in edge computing environment

Xia, Xiaoyu, Chen, Feifei, Grundy, John, Abdelrazek, Mohamed, Jin, Hai and He, Qiang 2021, Constrained app data caching over edge server graphs in edge computing environment, IEEE transactions on services computing, pp. 1-13, doi: 10.1109/tsc.2021.3062017.

Attached Files
Name Description MIMEType Size Downloads

Title Constrained app data caching over edge server graphs in edge computing environment
Author(s) Xia, XiaoyuORCID iD for Xia, Xiaoyu orcid.org/0000-0003-3526-3217
Chen, FeifeiORCID iD for Chen, Feifei orcid.org/0000-0001-5455-3792
Grundy, John
Abdelrazek, MohamedORCID iD for Abdelrazek, Mohamed orcid.org/0000-0003-3812-9785
Jin, Hai
He, Qiang
Journal name IEEE transactions on services computing
Start page 1
End page 13
Total pages 13
Publisher Institute of Electrical and Electronics Engineers
Place of publication Piscataway, N.J.
Publication date 2021-02-24
ISSN 2372-0204
Keyword(s) edge computing
data caching
optimization
approximation algorithm
Summary In recent years, edge computing, as an extension of cloud computing, has emerged as a promising paradigm for powering a variety of applications demanding low latency, e.g., virtual or augmented reality, interactive gaming, real-time navigation, etc. In the edge computing environment, edge servers are deployed at base stations to offer highly-accessible computing capacities to nearby end-users, e.g., CPU, RAM, storage, etc. From a service provider's perspective, caching app data on edge servers can ensure low latency in its users' data retrieval. Given constrained cache spaces on edge servers due to their physical sizes, the optimal data caching strategy must minimize overall user latency. In this paper, we formulate this Constrained Edge Data Caching (CEDC) problem as a constrained optimization problem from the service provider's perspective and prove its NP-hardness. We propose an optimal approach named CEDC-IP to solve this CEDC problem exactly with the Integer Programming technique. We also provide an approximation algorithm named CEDC-A for finding approximate solutions to large-scale CEDC problems efficiently and prove its approximation ratio. CEDC-IP and CEDC-A are evaluated on a real-world data set and a synthesized data set. The results demonstrate that they significantly outperform four representative approaches.
Language eng
DOI 10.1109/tsc.2021.3062017
Indigenous content off
Field of Research 0803 Computer Software
0805 Distributed Computing
0806 Information Systems
HERDC Research category C1 Refereed article in a scholarly journal
Persistent URL http://hdl.handle.net/10536/DRO/DU:30148812

Connect to link resolver
 
Unless expressly stated otherwise, the copyright for items in DRO is owned by the author, with all rights reserved.

Versions
Version Filter Type
Citation counts: TR Web of Science Citation Count  Cited 0 times in TR Web of Science
Scopus Citation Count Cited 0 times in Scopus
Google Scholar Search Google Scholar
Access Statistics: 52 Abstract Views, 2 File Downloads  -  Detailed Statistics
Created: Mon, 08 Mar 2021, 20:22:36 EST

Every reasonable effort has been made to ensure that permission has been obtained for items included in DRO. If you believe that your rights have been infringed by this repository, please contact drosupport@deakin.edu.au.