Demand Based File Replication and Consistency Mechanism

M. Vardhan, A. Goel, A. Verma, D. S. Kushwaha
{"title":"Demand Based File Replication and Consistency Mechanism","authors":"M. Vardhan, A. Goel, A. Verma, D. S. Kushwaha","doi":"10.1109/ICCCT.2012.74","DOIUrl":null,"url":null,"abstract":"File replication and consistency are well known techniques in distributed systems to address the key issues such as scalability, reliability and fault tolerance. For many years, file replication and consistency in distributed environment has been researched to enhance and optimize the availability and reliability of the entire system. An effort has been made in the present work to propose a file popularity based, adaptive, on demand, reliable and comprehensive file replication and consistency mechanism. This paper introduces a group of File Replication Servers (FRS) that is responsible for ensuring the file availability, in order to fulfill the file request. The present work proposes Hybrid file update propagation mechanism so as to minimize the number of updates. Proposed model replicates the file, from one node to the other node, when the total number of request for a particular file reaches a threshold value. Proposed approach is implemented on JAVA platform. Based on the file popularity, model creates and updates the file replica on the server. The proposed Hybrid approach is compared with write invalidate and write update propagation policies. Comparison results show that for balanced load hybrid file update propagation model updates the optimum number of replicas. Whereas, for unbalanced load, hybrid approach outperforms other two approaches by handling all the file requests with minimum number of updates.","PeriodicalId":235770,"journal":{"name":"2012 Third International Conference on Computer and Communication Technology","volume":"79 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-11-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 Third International Conference on Computer and Communication Technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCCT.2012.74","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

File replication and consistency are well known techniques in distributed systems to address the key issues such as scalability, reliability and fault tolerance. For many years, file replication and consistency in distributed environment has been researched to enhance and optimize the availability and reliability of the entire system. An effort has been made in the present work to propose a file popularity based, adaptive, on demand, reliable and comprehensive file replication and consistency mechanism. This paper introduces a group of File Replication Servers (FRS) that is responsible for ensuring the file availability, in order to fulfill the file request. The present work proposes Hybrid file update propagation mechanism so as to minimize the number of updates. Proposed model replicates the file, from one node to the other node, when the total number of request for a particular file reaches a threshold value. Proposed approach is implemented on JAVA platform. Based on the file popularity, model creates and updates the file replica on the server. The proposed Hybrid approach is compared with write invalidate and write update propagation policies. Comparison results show that for balanced load hybrid file update propagation model updates the optimum number of replicas. Whereas, for unbalanced load, hybrid approach outperforms other two approaches by handling all the file requests with minimum number of updates.
基于需求的文件复制和一致性机制
文件复制和一致性是分布式系统中众所周知的技术,用于解决诸如可伸缩性、可靠性和容错等关键问题。为了提高和优化整个系统的可用性和可靠性,人们对分布式环境下的文件复制和一致性进行了多年的研究。本文提出了一种基于流行度、自适应、随需应变、可靠、全面的文件复制与一致性机制。本文介绍了一组负责保证文件可用性的文件复制服务器(FRS),以满足文件请求。本文提出了混合文件更新传播机制,以最大限度地减少更新次数。当特定文件的请求总数达到阈值时,建议的模型将文件从一个节点复制到另一个节点。该方法在JAVA平台上实现。根据文件的流行程度,模型在服务器上创建和更新文件副本。将该方法与写无效传播策略和写更新传播策略进行了比较。对比结果表明,在均衡负载下,混合文件更新传播模型更新的副本数量最优。然而,对于不平衡负载,混合方法通过以最少的更新次数处理所有文件请求而优于其他两种方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信