Latency-Sensitive Data Allocation and Workload Consolidation for Cloud Storage

2018 | journal article; research paper. A publication with affiliation to the University of Göttingen.

Jump to: Cite & Linked | Documents & Media | Details | Version history

Cite this publication

​Latency-Sensitive Data Allocation and Workload Consolidation for Cloud Storage​
Yang, S.; Wieder, P. ; Aziz, M.; Yahyapour, R. ; Fu, X.   & Chen, X.​ (2018) 
IEEE Access6 pp. 76098​-76110​.​ DOI: https://doi.org/10.1109/ACCESS.2018.2883674 

Documents & Media

08548586.pdf9.25 MBAdobe PDF

License

Published Version

GRO License GRO License

Details

Authors
Yang, Song; Wieder, Philipp ; Aziz, Muzzamil; Yahyapour, Ramin ; Fu, Xiaoming ; Chen, Xu
Abstract
Customers often suffer from the variability of data access time in (edge) cloud storage service, caused by network congestion, load dynamics, and so on. One ef cient solution to guarantee a reliable latency-sensitive service (e.g., for industrial Internet of Things application) is to issue requests with multiple download/upload sessions which access the required data (replicas) stored in one or more servers, and use the earliest response from those sessions. In order to minimize the total storage costs, how to optimally allocate data in a minimum number of servers without violating latency guarantees remains to be a crucial issue for the cloud provider to deal with. In this paper, we study the latency-sensitive data allocation problem, the latency-sensitive data reallocation problem and the latency-sensitive workload consolidation problem for cloud storage. We model the data access time as a given distribution whose cumulative density function is known, and prove that these three problems are NP-hard. To solve them, we propose an exact integer nonlinear program (INLP) and a Tabu Search-based heuristic. The simulation results reveal that the INLP can always achieve the best performance in terms of lower number of used nodes and higher storage and throughput utilization, but this comes at the expense of much higher running time. The Tabu Searchbased heuristic, on the other hand, can obtain close-to-optimal performance, but in a much lower running time.
Issue Date
2018
Journal
IEEE Access 
Project
info:eu-repo/grantAgreement/EC/FP7/607584/EU//CLEANSKY
Organization
Gesellschaft für wissenschaftliche Datenverarbeitung 
eISSN
2169-3536
eISSN
2169-3536
Language
English

Reference

Citations


Social Media