Cost-Driven Data Replication with Predictions
Fuente:
arXiv
Guardado en:
| Autores principales: | , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2024
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866910423075258368 |
|---|---|
| author | Zuo, Tianyu Tang, Xueyan Lee, Bu Sung |
| author_facet | Zuo, Tianyu Tang, Xueyan Lee, Bu Sung |
| contents | This paper studies an online replication problem for distributed data access. The goal is to dynamically create and delete data copies in a multi-server system as time passes to minimize the total storage and network cost of serving access requests. We study the problem in the emergent learning-augmented setting, assuming simple binary predictions about inter-request times at individual servers. We develop an online algorithm and prove that it is ($\frac{5+α}{3}$)-consistent (competitiveness under perfect predictions) and ($1 + \frac{1}α$)-robust (competitiveness under terrible predictions), where $α\in (0, 1]$ is a hyper-parameter representing the level of distrust in the predictions. We also study the impact of mispredictions on the competitive ratio of the proposed algorithm and adapt it to achieve a bounded robustness while retaining its consistency. We further establish a lower bound of $\frac{3}{2}$ on the consistency of any deterministic learning-augmented algorithm. Experimental evaluations are carried out to evaluate our algorithms using real data access traces. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2404_16489 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Cost-Driven Data Replication with Predictions Zuo, Tianyu Tang, Xueyan Lee, Bu Sung Data Structures and Algorithms This paper studies an online replication problem for distributed data access. The goal is to dynamically create and delete data copies in a multi-server system as time passes to minimize the total storage and network cost of serving access requests. We study the problem in the emergent learning-augmented setting, assuming simple binary predictions about inter-request times at individual servers. We develop an online algorithm and prove that it is ($\frac{5+α}{3}$)-consistent (competitiveness under perfect predictions) and ($1 + \frac{1}α$)-robust (competitiveness under terrible predictions), where $α\in (0, 1]$ is a hyper-parameter representing the level of distrust in the predictions. We also study the impact of mispredictions on the competitive ratio of the proposed algorithm and adapt it to achieve a bounded robustness while retaining its consistency. We further establish a lower bound of $\frac{3}{2}$ on the consistency of any deterministic learning-augmented algorithm. Experimental evaluations are carried out to evaluate our algorithms using real data access traces. |
| title | Cost-Driven Data Replication with Predictions |
| topic | Data Structures and Algorithms |
| url | https://arxiv.org/abs/2404.16489 |