OERD - On demand and efficient replication dereplication

0Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.
Get full text

Abstract

For many years, file replication and dereplication in distributed computing environment has been researched to enhance and optimize the scalability of the entire system. Although numerous work have been proposed on the issues of file replication, a comprehensive approach still misses out on various fronts. An effort has been made in the present work to propose a reliable and comprehensive file replication and memory aware dereplication mechanism for a trusted private cloud, based on the file threshold. The proposed approach introduces a File Replication Server (FRS) that is responsible for replicating the file on peer FRS, when the file threshold limit is reached. The proposed approach handles file replication, dereplication, access and performance transparency to the system, thereby ensuring the replication and dereplication decisions about the files in a seamless and efficient manner. The approach is simulated on JAVA platform. A comparative study of the proposed approach with the Request Reply Acknowledgement (RRA) and Request Reply (RR) protocol is presented, showing the significant reduction by 37.5% to 58%, in terms of total number of messages exchanged for file replication. © 2012 Springer-Verlag GmbH.

Cite

CITATION STYLE

APA

Manu, V., Paras, G., & Singh, K. D. (2012). OERD - On demand and efficient replication dereplication. In Advances in Intelligent and Soft Computing (Vol. 167 AISC, pp. 425–434). https://doi.org/10.1007/978-3-642-30111-7_40

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free