Design and Performance Characterization of Practically Realizable Graph-Based Security Aware Algorithms for Hierarchical and Non-hierarchical Cloud Architectures

Applications processing massive amount of data demand superior time-performance and data-storage capabilities. Many organizations are exploring Cloud Computing to manage such applications because of scalability and convenience of access from different geographic locations, whereas data security and privacy are few of the major concerns preventing them from fully embracing it. Data security while maintaining time-performance becomes an important consideration for designing data placement strategies. We first present the reader with a quick survey on the recent approaches and solutions in data placement oriented problems that address security concern and then characterize the performance for graph based algorithms that are practically realizable. We evaluated the performance of conventional strategies such as, Random, T-coloring and revisited these algorithms in the view of providing maximum security. We refer to our strategy as Data Security Preferential (DSP) data placement strategy and evaluated via rigorous performance evaluation tests to identify which strategy will best suit the requirements of the user on three state-of-the-art hierarchical cloud platforms viz., FatTree, ThreeTier and DCell and non-hierarchical cloud platforms.