IDEAS home Printed from https://ideas.repec.org/a/gam/jftint/v13y2021i7p181-d592328.html
   My bibliography  Save this article

Data Chunks Placement Optimization for Hybrid Storage Systems

Author

Listed:
  • Agil Yolchuyev

    (Department of Networked Systems and Services, Budapest University of Technology and Economics, Magyar Tudosok krt. 2, 1117 Budapest, Hungary)

  • Janos Levendovszky

    (Department of Networked Systems and Services, Budapest University of Technology and Economics, Magyar Tudosok krt. 2, 1117 Budapest, Hungary)

Abstract

“Hybrid Cloud Storage” (HCS) is a widely adopted framework that combines the functionality of public and private cloud storage models to provide storage services. This kind of storage is especially ideal for organizations that seek to reduce the cost of their storage infrastructure with the use of “Public Cloud Storage” as a backend to on-premises primary storage. Despite the higher performance, the hybrid cloud has latency issues, related to the distance and bandwidth of the public storage, which may cause a significant drop in the performance of the storage systems during data transfer. This issue can become a major problem when one or more private storage nodes fail. In this paper, we propose a new framework for optimizing the data uploading process that is currently used with hybrid cloud storage systems. The optimization is concerned with spreading the data over the multiple storages in the HCS system according to some predefined objective functions. Furthermore, we also used Network Coding technics for minimizing data transfer latency between the receiver (private storages) and transmitter nodes.

Suggested Citation

  • Agil Yolchuyev & Janos Levendovszky, 2021. "Data Chunks Placement Optimization for Hybrid Storage Systems," Future Internet, MDPI, vol. 13(7), pages 1-12, July.
    • Handle: RePEc:gam:jftint:v:13:y:2021:i:7:p:181-:d:592328
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/1999-5903/13/7/181/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/1999-5903/13/7/181/
    Download Restriction: no
    ---><---

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jftint:v:13:y:2021:i:7:p:181-:d:592328. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.