Online data caching in edge-cloud collaborative system with the data center
Xinxin Han (),
Sijia Dai (),
Guichen Gao (),
Yang Wang () and
Yong Zhang ()
Additional contact information
Xinxin Han: Shenzhen Polytechnic
Sijia Dai: Chinese Academy of Sciences
Guichen Gao: Chinese Academy of Sciences
Yang Wang: Chinese Academy of Sciences
Yong Zhang: Chinese Academy of Sciences
Journal of Combinatorial Optimization, 2022, vol. 44, issue 5, No 9, 3363 pages
Abstract:
Abstract In edge computing, the edge node can provide certain accessible storage and computing resources for the surrounding users. Caching data on the edge node can quickly retrieve the required data and complete the user’s requests with low delay. However, the resources of edge servers are limited and sometimes have to gain the data by transfering from other servers or buying from data centers at the cloud. Traditionally, data center is just regard as a place of purchasing data, and the data is always available for the buyer after purchase. However, we believe that these data have a validity period. After the buyer purchases the data, it only provides limited calls for free. Based on this assumption, in this paper, we study the data caching problem in the edge-cloud collaborative system to minimize the total cost. Without knowing the information of users’ future request flow, we propose an online algorithm. What’s more, the asymptotic competition ratio of the algorithm in the worst case is 3.
Keywords: Collaborative system; Data caching; Edge computing; Online algorithm; Competitive ratio (search for similar items in EconPapers)
Date: 2022
References: View complete reference list from CitEc
Citations:
Downloads: (external link)
http://link.springer.com/10.1007/s10878-022-00892-9 Abstract (text/html)
Access to the full text of the articles in this series is restricted.
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:44:y:2022:i:5:d:10.1007_s10878-022-00892-9
Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878
DOI: 10.1007/s10878-022-00892-9
Access Statistics for this article
Journal of Combinatorial Optimization is currently edited by Thai, My T.
More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().