互联网分布式系统的高效容错算法

Swati Mishra, S. K. Panda
{"title":"互联网分布式系统的高效容错算法","authors":"Swati Mishra, S. K. Panda","doi":"10.4018/IJKDB.2017010106","DOIUrl":null,"url":null,"abstract":"In the current era, Internet is the fastest growing technology. It is a global network of distributed systems that interconnects with each other to share various resources and computation. The complexity of the distributed systems is rapidly increasing, which leads to an increased susceptibility of failure to the participating computers such as clients and servers and their interconnections. Therefore, the main challenge is to address such failures and develop efficient algorithms to tolerate such failures. In this paper, four fault tolerant algorithms, namely server-based fault tolerant SFT, client-based fault tolerant CFT, client-server fault tolerant CSFT and connection fault tolerant CoFT are proposed to deal with the above challenge. The proposed algorithms are evaluated in terms of number of failures NOF, load factor LF and load standard deviation LSD and compared with an existing algorithm. The comparison results show the superior performance of the proposed algorithms.","PeriodicalId":160270,"journal":{"name":"Int. J. Knowl. Discov. Bioinform.","volume":"71 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Efficient Fault Tolerant Algorithms for Internet Distributed Systems\",\"authors\":\"Swati Mishra, S. K. Panda\",\"doi\":\"10.4018/IJKDB.2017010106\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In the current era, Internet is the fastest growing technology. It is a global network of distributed systems that interconnects with each other to share various resources and computation. The complexity of the distributed systems is rapidly increasing, which leads to an increased susceptibility of failure to the participating computers such as clients and servers and their interconnections. Therefore, the main challenge is to address such failures and develop efficient algorithms to tolerate such failures. In this paper, four fault tolerant algorithms, namely server-based fault tolerant SFT, client-based fault tolerant CFT, client-server fault tolerant CSFT and connection fault tolerant CoFT are proposed to deal with the above challenge. The proposed algorithms are evaluated in terms of number of failures NOF, load factor LF and load standard deviation LSD and compared with an existing algorithm. The comparison results show the superior performance of the proposed algorithms.\",\"PeriodicalId\":160270,\"journal\":{\"name\":\"Int. J. Knowl. Discov. Bioinform.\",\"volume\":\"71 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Int. J. Knowl. Discov. Bioinform.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.4018/IJKDB.2017010106\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Int. J. Knowl. Discov. Bioinform.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4018/IJKDB.2017010106","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

在当今时代,互联网是发展最快的技术。它是一个由分布式系统组成的全球网络,这些系统相互连接,共享各种资源和计算。分布式系统的复杂性正在迅速增加,这导致参与计算机(如客户端和服务器及其互连)的故障易感性增加。因此,主要的挑战是解决此类故障并开发有效的算法来容忍此类故障。本文提出了四种容错算法,即基于服务器的容错SFT、基于客户端的容错CFT、客户端-服务器容错CSFT和连接容错CoFT来应对上述挑战。用失效次数NOF、负载因子LF和负载标准差LSD对所提算法进行了评价,并与现有算法进行了比较。对比结果表明,所提算法具有较好的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Efficient Fault Tolerant Algorithms for Internet Distributed Systems
In the current era, Internet is the fastest growing technology. It is a global network of distributed systems that interconnects with each other to share various resources and computation. The complexity of the distributed systems is rapidly increasing, which leads to an increased susceptibility of failure to the participating computers such as clients and servers and their interconnections. Therefore, the main challenge is to address such failures and develop efficient algorithms to tolerate such failures. In this paper, four fault tolerant algorithms, namely server-based fault tolerant SFT, client-based fault tolerant CFT, client-server fault tolerant CSFT and connection fault tolerant CoFT are proposed to deal with the above challenge. The proposed algorithms are evaluated in terms of number of failures NOF, load factor LF and load standard deviation LSD and compared with an existing algorithm. The comparison results show the superior performance of the proposed algorithms.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信