Linear algorithm for data retrieval performance optimization in self-encryption hybrid data centers
Maen M. Al Assaf, Mohammad Qatawneh, AlaaAldin AlRadhi
Abstract
Contemporary data centers implement hybrid storage systems that consist of layers from solid-state drives (SSDs) and hard disk drives (HDDs). Due to their high data retrieval speed, SSDs layer is used to store important data blocks that have features like high frequency of access. To boost their security level, many of such systems implement self-encryption algorithms like advanced encryption standard (AES), Blowfish, and triple data encryption standard (3DES) with different key sizes that vary in their complexity and their decryption latency whenever a block is requested for read. Frequently accessed data blocks with increased decryption latencies are better to be migrated to the SSDs layer to decrease their retrieval latency. In this paper, we introduce a linear complexity algorithm hybrid self-encryption storage data migration (HSESM) that migrates important data blocks that requires long decryption latencies from the HDDs layer to the SSDs one. Performance evaluation shows that HSESM data migration process can reduce data blocks read latencies in 13.71%-23.61% under worst-case scenarios.