Cloud storage tier optimization through storage object classification

Wedi'i Gadw mewn:
Manylion Llyfryddiaeth
Cyhoeddwyd yn:Computing. Archives for Informatics and Numerical Computation vol. 106, no. 11 (Nov 2024), p. 3389
Prif Awdur: Khan, Akif Quddus
Awduron Eraill: Matskin, Mihhail, Prodan, Radu, Bussler, Christoph, Roman, Dumitru, Soylu, Ahmet
Cyhoeddwyd:
Springer Nature B.V.
Pynciau:
Mynediad Ar-lein:Citation/Abstract
Full Text - PDF
Tagiau: Ychwanegu Tag
Dim Tagiau, Byddwch y cyntaf i dagio'r cofnod hwn!

MARC

LEADER 00000nab a2200000uu 4500
001 3116784684
003 UK-CbPIL
022 |a 0010-485X 
022 |a 1436-5057 
024 7 |a 10.1007/s00607-024-01281-2  |2 doi 
035 |a 3116784684 
045 2 |b d20241101  |b d20241130 
084 |a 65752  |2 nlm 
100 1 |a Khan, Akif Quddus  |u Norwegian University of Science and Technology, Gjøvik, Norway (GRID:grid.5947.f) (ISNI:0000 0001 1516 2393) 
245 1 |a Cloud storage tier optimization through storage object classification 
260 |b Springer Nature B.V.  |c Nov 2024 
513 |a Journal Article 
520 3 |a Cloud storage adoption has increased over the years given the high demand for fast processing, low access latency, and ever-increasing amount of data being generated by, e.g., Internet of Things applications. In order to meet the users’ demands and provide a cost-effective solution, cloud service providers offer tiered storage; however, keeping the data in one tier is not cost-effective. In this respect, cloud storage tier optimization involves aligning data storage needs with the most suitable and cost-effective storage tier, thus reducing costs while ensuring data availability and meeting performance requirements. Ideally, this process considers the trade-off between performance and cost, as different storage tiers offer different levels of performance and durability. It also encompasses data lifecycle management, where data is automatically moved between tiers based on access patterns, which in turn impacts the storage cost. In this respect, this article explores two novel classification approaches, rule-based and game theory-based, to optimize cloud storage cost by reassigning data between different storage tiers. Four distinct storage tiers are considered: premium, hot, cold, and archive. The viability and potential of the proposed approaches are demonstrated by comparing cost savings and analyzing the computational cost using both fully-synthetic and semi-synthetic datasets with static and dynamic access patterns. The results indicate that the proposed approaches have the potential to significantly reduce cloud storage cost, while being computationally feasible for practical applications. Both approaches are lightweight and industry- and platform-independent. 
653 |a Computing costs 
653 |a Game theory 
653 |a Cost analysis 
653 |a Classification 
653 |a Data storage 
653 |a Internet of Things 
653 |a Cloud computing 
653 |a Cost effectiveness 
653 |a Synthetic data 
653 |a Optimization 
653 |a Cost reduction 
653 |a Cost control 
700 1 |a Matskin, Mihhail  |u KTH Royal Institute of Technology, Stockholm, Sweden (GRID:grid.5037.1) (ISNI:0000 0001 2158 1746) 
700 1 |a Prodan, Radu  |u University of Klagenfurt, Klagenfurt, Austria (GRID:grid.7520.0) (ISNI:0000 0001 2196 3349) 
700 1 |a Bussler, Christoph  |u Robert Bosch LLC, Sunnyvale, USA (GRID:grid.420831.c) (ISNI:0000 0004 0529 6285) 
700 1 |a Roman, Dumitru  |u SINTEF AS, Oslo, Norway (GRID:grid.4319.f) (ISNI:0000 0004 0448 3150); OsloMet – Oslo Metropolitan University, Oslo, Norway (GRID:grid.412414.6) (ISNI:0000 0000 9151 4445) 
700 1 |a Soylu, Ahmet  |u OsloMet – Oslo Metropolitan University, Oslo, Norway (GRID:grid.412414.6) (ISNI:0000 0000 9151 4445) 
773 0 |t Computing. Archives for Informatics and Numerical Computation  |g vol. 106, no. 11 (Nov 2024), p. 3389 
786 0 |d ProQuest  |t ABI/INFORM Global 
856 4 1 |3 Citation/Abstract  |u https://www.proquest.com/docview/3116784684/abstract/embedded/7BTGNMKEMPT1V9Z2?source=fedsrch 
856 4 0 |3 Full Text - PDF  |u https://www.proquest.com/docview/3116784684/fulltextPDF/embedded/7BTGNMKEMPT1V9Z2?source=fedsrch