Exploiting Rateless Codes in Cloud Storage Systems

被引:34
作者
Anglano, Cosimo [1 ]
Gaeta, Rossano [2 ]
Grangetto, Marco [2 ]
机构
[1] Univ Piemonte Orientale, DiSIT Comp Sci Inst, Alessandria, Italy
[2] Univ Turin, Dipartimento Informat, I-10149 Turin, Italy
关键词
Cloud storage; rateless codes; availability; confidentiality; integrity; performance;
D O I
10.1109/TPDS.2014.2321745
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Block-level cloud storage (BLCS) offers to users and applications the access to persistent block storage devices (virtual disks) that can be directly accessed and used as if they were raw physical disks. In this paper we devise ENIGMA, an architecture for the back-end of BLCS systems able to provide adequate levels of access and transfer performance, availability, integrity, and confidentiality, for the data it stores. ENIGMA exploits LT rateless codes to store fragments of sectors on storage nodes organized in clusters. We quantitatively evaluate how the various ENIGMA system parameters affect the performance, availability, integrity, and confidentiality of virtual disks. These evaluations are carried out by using both analytical modeling (for availability, integrity, and confidentiality) and discrete event simulation (for performance), and by considering a set of realistic operational scenarios. Our results indicate that it is possible to simultaneously achieve all the objectives set forth for BLCS systems by using ENIGMA, and that a careful choice of the various system parameters is crucial to achieve a good compromise among them. Moreover, they also show that LT coding-based BLCS systems outperform traditional BLCS systems in all the aspects mentioned before.
引用
收藏
页码:1313 / 1322
页数:10
相关论文
共 50 条
[31]   Simple Capacity-Achieving Ensembles of Rateless Erasure-Correcting Codes [J].
Yuan, Xiaojun ;
Sun, Rong ;
Ping, Li .
IEEE TRANSACTIONS ON COMMUNICATIONS, 2010, 58 (01) :110-117
[32]   Multi-relay cooperative transmission based on rateless codes and adaptive demodulation [J].
Lei, Weijia ;
Song, Haina .
IET COMMUNICATIONS, 2018, 12 (05) :586-594
[33]   Efficient Reliable Wireless Communications through Raptor Codes and Rateless Codes with Feedback [J].
Schulz, Philipp ;
Li, Yiyang ;
Trasl, Andreas ;
Barreto, Andre Noll ;
Fettweis, Gerhard .
IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS (ICC 2022), 2022, :704-709
[34]   Throughput of Rateless Codes Over Broadcast Erasure Channels [J].
Yang, Yang ;
Shroff, Ness B. .
IEEE-ACM TRANSACTIONS ON NETWORKING, 2015, 23 (01) :126-137
[35]   Analysing Threats in Cloud Storage [J].
Yahya, Fara ;
Walters, Robert J. ;
Wills, Gary B. .
2015 WORLD CONGRESS ON INTERNET SECURITY (WORLDCIS), 2015, :44-48
[36]   ENERGY-EFFICIENT RELAYING USING RATELESS CODES [J].
Buehler, Joerg ;
Stanczak, Slawomir .
2013 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH AND SIGNAL PROCESSING (ICASSP), 2013, :4943-4947
[37]   Optimized Degree Distribution of Rateless Codes With Lower Complexity [J].
Yin, Junpeng ;
Fu, Yusun ;
Tang, Jinhui ;
Huang, Haobo .
IEEE COMMUNICATIONS LETTERS, 2024, 28 (03) :458-462
[38]   Rateless Protograph LDPC Codes for Quantum Key Distribution [J].
Tarable, Alberto ;
Paganelli, Rudi Paolo ;
Ferrari, Marco .
IEEE TRANSACTIONS ON QUANTUM ENGINEERING, 2024, 5 :1-11
[39]   Weakly secure regenerating codes for cloud storage against eavesdropper [J].
Liu, Jian ;
Wang, Hui-Mei ;
Xian, Ming ;
Huang, Kun .
Dianzi Yu Xinxi Xuebao/Journal of Electronics and Information Technology, 2014, 36 (05) :1221-1228
[40]   Rateless Codes for Distributed Computations with Sparse Compressed Matrices [J].
Mallick, Ankur ;
Joshi, Gauri .
2019 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2019, :2793-2797