skip to main content
10.1145/3603166.3632126acmconferencesArticle/Chapter ViewAbstractPublication PagesuccConference Proceedingsconference-collections
research-article

SDKV: A Smart and Distributed Key-Value Store for the Edge-Cloud Continuum

Published: 04 April 2024 Publication History

Abstract

Many time-critical and data-intensive distributed applications for the computing continuum depend on low-latency, scalable, and highly available distributed key value storages. In this paper, we introduce SDKV, a scalable -Smart and Distributed Key-Value- store for the Edge-Cloud continuum to automatically place data in close proximity to clients resulting in low response times. The clients of SDKV can influence data availability and access latency by specifying the number of replicas and the desired level of data consistency (strong or eventual) on a per key-value pair basis, which favors the support of a wide range of applications. Results reveal that for different workloads and client access behaviors, SDKV outperforms existing distributed data storages and their data placement algorithms by 12--69% for both consistency models. Moreover, the proposed placement algorithm of SDKV provides fast decision times and scales linearly with the number of keys.

References

[1]
Birju Tank and Vaibhav Gandhi. A Comparative Study on Cloud Computing, Edge Computing and Fog Computing. 01 2023.
[2]
Zhe Wu, Michael Butkiewicz, Dorian Perkins, Ethan Katz-Bassett, and Harsha V Madhyastha. Spanstore: Cost-effective geo-replicated storage spanning multiple cloud services. In Proceedings of the Twenty-Fourth ACM Symposium on Operating Systems Principles, pages 292--308, 2013.
[3]
Karim Sonbol, Öznur Özkasap, Ibrahim Al-Oqily, and Moayad Aloqaily. Edgekv: Decentralized, scalable, and consistent storage for the edge. Journal of Parallel and Distributed Computing, 144:28--40, 2020.
[4]
Joshua Guarnieri and Aleksey Charapko. Linearizable low-latency reads at the edge. In Proceedings of the 10th Workshop on Principles and Practice of Consistency for Distributed Data, pages 77--83, 2023.
[5]
Ricardo Vilaça, Rui Oliveira, and José Pereira. A correlation-aware data placement strategy for key-value stores. In Distributed Applications and Interoperable Systems: 11th IFIP WG 6.1 International Conference, DAIS 2011, Reykjavik, Iceland, June 6--9, 2011. Proceedings 11, pages 214--227. Springer, 2011.
[6]
J Paiva, P Ruivo, P Romano, and L Rodrigues. Auto placer. ACM Transactions on Autonomous and Adaptive Systems, 9(4), 2015.
[7]
José S Costa Filho, Denis M Cavalcante, Leonardo O Moreira, and Javam C Machado. An adaptive replica placement approach for distributed key-value stores. Concurrency and Computation: Practice and Experience, 32(11):e5675, 2020.
[8]
Giuseppe DeCandia, Deniz Hastorun, Madan Jampani, Gunavardhan Kakulapati, Avinash Lakshman, Alex Pilchin, Swaminathan Sivasubramanian, Peter Vosshall, and Werner Vogels. Dynamo: Amazon's highly available key-value store. ACM SIGOPS operating systems review, 41(6):205--220, 2007.
[9]
Joseph Noor, Mani Srivastava, and Ravi Netravali. Portkey: Adaptive key-value placement over dynamic edge networks. In Proceedings of the ACM Symposium on Cloud Computing, pages 197--213, 2021.
[10]
Yanling Shao, Chunlin Li, and Hengliang Tang. A data replica placement strategy for iot workflows in collaborative edge and cloud environments. Computer Networks, 148:46--59, 2019.
[11]
Eryang Cao, Pengwei Wang, Chungang Yan, and Changjun Jiang. A cloudedge-combined data placement strategy based on user access regions. In 2020 6th International Conference on Big Data and Information Analytics (BigDIA), pages 243--250. IEEE, 2020.
[12]
Wenyu Shi and Qiang Tang. Cost-optimized data placement strategy for social network with security awareness in edge-cloud computing environment. Journal of Combinatorial Optimization, 45(1):22, 2023.
[13]
SDKV GitHub repository. https://github.com/DistributedSystemsTools/SDKV, September 2023.
[14]
Abdullah Talha Kabakus and Resul Kara. A performance evaluation of in-memory databases. Journal of King Saud University-Computer and Information Sciences, 29(4):520--525, 2017.
[15]
Antonios Katsarakis, Vasilis Gavrielatos, MR Siavash Katebzadeh, Arpit Joshi, Aleksandar Dragojevic, Boris Grot, and Vijay Nagarajan. Hermes: A fast, fault-tolerant and linearizable replication protocol. In Proceedings of the Twenty-Fifth International Conference on Architectural Support for Programming Languages and Operating Systems, pages 201--217, 2020.
[16]
Maurice P Herlihy and Jeannette M Wing. Linearizability: A correctness condition for concurrent objects. ACM Transactions on Programming Languages and Systems (TOPLAS), 12(3):463--492, 1990.
[17]
Leslie Lamport. Paxos made simple. ACM SIGACT News (Distributed Computing Column) 32, 4 (Whole Number 121, December 2001), pages 51--58, 2001.
[18]
Aleksey Charapko, Ailidani Ailijiang, and Murat Demirbas. Pigpaxos: Devouring the communication bottlenecks in distributed consensus. In Proceedings of the 2021 International Conference on Management of Data, pages 235--247, 2021.
[19]
Tushar D Chandra, Vassos Hadzilacos, and Sam Toueg. An algorithm for replicated objects with efficient reads. In Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing, pages 325--334, 2016.
[20]
Deepthi K Madathil, Rajani B Thota, Paulina Paul, and Tao Xie. A static data placement strategy towards perfect load-balancing for distributed storage clusters. In 2008 IEEE International Symposium on Parallel and Distributed Processing, pages 1--8. IEEE, 2008.
[21]
Yang Liu, Chase Q Wu, Meng Wang, Aiqin Hou, and Yongqiang Wang. On a dynamic data placement strategy for heterogeneous hadoop clusters. In 2018 International Symposium on Networks, Computers and Communications (ISNCC), pages 1--7. IEEE, 2018.
[22]
Yehuda Vardi. Network tomography: Estimating source-destination traffic intensities from link data. Journal of the American statistical association, 91(433):365--377, 1996.
[23]
David Karger, Eric Lehman, Tom Leighton, Rina Panigrahy, Matthew Levine, and Daniel Lewin. Consistent hashing and random trees: Distributed caching protocols for relieving hot spots on the world wide web. In Proceedings of the twenty-ninth annual ACM symposium on Theory of computing, pages 654--663, 1997.
[24]
Ramon R. Fontes, Samira Afzal, Samuel H. B. Brito, Mateus A. S. Santos, and Christian Esteve Rothenberg. Mininet-wifi: Emulating software-defined wireless networks. In 2015 11th International Conference on Network and Service Management (CNSM), pages 384--389, 2015.
[25]
MongoDB. Mongodb. https://www.mongodb.com/, April 2023.
[26]
Redis. Redis. https://redis.com/, April 2023.
[27]
Brian F Cooper, Adam Silberstein, Erwin Tam, Raghu Ramakrishnan, and Russell Sears. Benchmarking cloud serving systems with ycsb. In Proceedings of the 1st ACM symposium on Cloud computing, pages 143--154, 2010.

Index Terms

  1. SDKV: A Smart and Distributed Key-Value Store for the Edge-Cloud Continuum

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM Conferences
    UCC '23: Proceedings of the IEEE/ACM 16th International Conference on Utility and Cloud Computing
    December 2023
    502 pages
    ISBN:9798400702341
    DOI:10.1145/3603166
    Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

    Sponsors

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    Published: 04 April 2024

    Check for updates

    Author Tags

    1. distributed storage
    2. key-value storage
    3. data placement
    4. replica management
    5. edge-cloud continuum

    Qualifiers

    • Research-article

    Conference

    UCC '23
    Sponsor:

    Acceptance Rates

    Overall Acceptance Rate 38 of 125 submissions, 30%

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • 0
      Total Citations
    • 88
      Total Downloads
    • Downloads (Last 12 months)88
    • Downloads (Last 6 weeks)5
    Reflects downloads up to 17 Jan 2025

    Other Metrics

    Citations

    View Options

    Login options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Media

    Figures

    Other

    Tables

    Share

    Share

    Share this Publication link

    Share on social media