Evaluation of Reliable Data Storage in Cloud Using an Efficient Encryption Technique

Author(s):  
Saswati Sarkar ◽  
Anirban Kundu ◽  
Ayan Banerjee

Cloud-based reliable and protected data storage technique is proposed in this chapter. The proposed technique encrypts and protects data with less time consumption. Power consumption of storage is dependent upon capacity of storage and physical size of storage. Time analysis is presented graphically in this chapter. Reliable data storage is represented in cloud based proposed approach. Data is encrypted with minimum time complexity due to usage of proposed cloud-based reliable data storage. The competent ratio of time complexity is graphically observed in proposed data storage technique. Power consumption of storage has been typically dependent on the basis of capacity of storage and amount of storage. A ratio of power consumption and capacity of storage is presented in cloud-based approach. An efficient usage of energy is shown depending on current consumption and voltage in proposed reliable approach.

Author(s):  
Saswati Sarkar ◽  
Anirban Kundu ◽  
Ayan Banerjee

Cloud-based reliable and protected data storage technique is proposed in this chapter. The proposed technique encrypts and protects data with less time consumption. Power consumption of storage is dependent upon capacity of storage and physical size of storage. Time analysis is presented graphically in this chapter. Reliable data storage is represented in cloud based proposed approach. Data is encrypted with minimum time complexity due to usage of proposed cloud-based reliable data storage. The competent ratio of time complexity is graphically observed in proposed data storage technique. Power consumption of storage has been typically dependent on the basis of capacity of storage and amount of storage. A ratio of power consumption and capacity of storage is presented in cloud-based approach. An efficient usage of energy is shown depending on current consumption and voltage in proposed reliable approach.


Sensors ◽  
2021 ◽  
Vol 21 (3) ◽  
pp. 792
Author(s):  
Oleksandr Drozd ◽  
Grzegorz Nowakowski ◽  
Anatoliy Sachenko ◽  
Viktor Antoniuk ◽  
Volodymyr Kochan ◽  
...  

This paper presents a power-oriented monitoring of clock signals that is designed to avoid synchronization failure in computer systems such as FPGAs. The proposed design reduces power consumption and increases the power-oriented checkability in FPGA systems. These advantages are due to improvements in the evaluation and measurement of corresponding energy parameters. Energy parameter orientation has proved to be a good solution for detecting a synchronization failure that blocks logic monitoring circuits. Key advantages lay in the possibility to detect a synchronization failure hidden in safety-related systems by using traditional online testing that is based on logical checkability. Two main types of power-oriented monitoring are considered: detecting a synchronization failure based on the consumption and the dissipation of power, which uses temperature and current consumption sensors, respectively. The experiments are performed on real FPGA systems with the controlled synchronization disconnection and the use of the computer-aided design (CAD) utility to estimate the decreasing values of the energy parameters. The results demonstrate the limited checkability of FPGA systems when using the thermal monitoring of clock signals and success in monitoring by the consumption current.


2015 ◽  
Vol 738-739 ◽  
pp. 107-110
Author(s):  
Hui Lin

A Wireless Sensor Network is composed of sensor nodes powered by batteries. Thus, power consumption is the major challenge. In spite of so many research works discussing this issue from the aspects of network optimization and system design, so far not so many focus on optimizing power consumption of the Radio Frequency device, which consumes most of the energy. This paper describes the digital features of the Radio Frequency device used to optimize current consumption, and presents a practical approach to measure current consumption in static and dynamic scenarios in details, by which we evaluates the power saving effect. The results demonstrated that according to cycle times and application characteristics choosing appropriate features can prolong the lifetime of wireless sensor nodes.


2012 ◽  
Vol 10 (02) ◽  
pp. 1241007 ◽  
Author(s):  
SLAVICA DIMITRIEVA ◽  
PHILIPP BUCHER

Commonly used RNA folding programs compute the minimum free energy structure of a sequence under the pseudoknot exclusion constraint. They are based on Zuker's algorithm which runs in time O(n3). Recently, it has been claimed that RNA folding can be achieved in average time O(n2) using a sparsification technique. A proof of quadratic time complexity was based on the assumption that computational RNA folding obeys the "polymer-zeta property". Several variants of sparse RNA folding algorithms were later developed. Here, we present our own version, which is readily applicable to existing RNA folding programs, as it is extremely simple and does not require any new data structure. We applied it to the widely used Vienna RNAfold program, to create sibRNAfold, the first public sparsified version of a standard RNA folding program. To gain a better understanding of the time complexity of sparsified RNA folding in general, we carried out a thorough run time analysis with synthetic random sequences, both in the context of energy minimization and base pairing maximization. Contrary to previous claims, the asymptotic time complexity of a sparsified RNA folding algorithm using standard energy parameters remains O(n3) under a wide variety of conditions. Consistent with our run-time analysis, we found that RNA folding does not obey the "polymer-zeta property" as claimed previously. Yet, a basic version of a sparsified RNA folding algorithm provides 15- to 50-fold speed gain. Surprisingly, the same sparsification technique has a different effect when applied to base pairing optimization. There, its asymptotic running time complexity appears to be either quadratic or cubic depending on the base composition. The code used in this work is available at: http://sibRNAfold.sourceforge.net/ .


2016 ◽  
Vol 685 ◽  
pp. 805-810 ◽  
Author(s):  
P.A. Rahman ◽  
E.A. Muraveva ◽  
M.I. Sharipov

This paper deals with data storage systems based on fault-tolerant dual-disk RAID-1, which are widely used as high-reliable data storage systems and have acceptable overhead expenses in hardware implementation. Advanced reliability model of dual-disk RAID-1 array based on Markov chains, which takes into consideration finite time of disk replacement after disk failure, different disk failure rate in array’s normal and rebuild states, and probability of read errors during array rebuild procedure, are also overviewed in this paper. Mathematical solution of reliability model, calculation formula for mean time to data loss, estimation of disk and array reliability parameters and MTTDL calculation example are also provided.


Author(s):  
Andrei Tchernykh ◽  
Mikhail Babenko ◽  
Vanessa Miranda-Lopez ◽  
Alexander Yu. Drozdov ◽  
Arutyun Avetisyan

Sign in / Sign up

Export Citation Format

Share Document