虚拟子网网络中的高效恶意协议

Shu-Chin Wang, S. Liang, K. Yan, G. Zheng
{"title":"虚拟子网网络中的高效恶意协议","authors":"Shu-Chin Wang, S. Liang, K. Yan, G. Zheng","doi":"10.1109/ARES.2007.76","DOIUrl":null,"url":null,"abstract":"The fault-tolerance is an important research topic in the study of distributed systems. To cope with the influence from faulty processors, reaching a common agreement in the presence of faults before performing certain special tasks is essential. Therefore, the Byzantine Agreement (BA) problem has drawn more researcher attention as they explore deeper into the world of distributed systems. Traditionally, the BA problem is solved in a wired network. However, the mobile computers have become increasingly popular. This environment encourages distributed system design and practices that support mobile processors. A mobile ad-hoc network (MANET) is different from a wired network. The processors have high mobility. Therefore, to enhance fault-tolerance and MANET reliability, the BA problem in virtual subnet of MANET is revised in this paper. The proposed protocol uses a minimum number of message exchange rounds and can tolerate the maximum number of allowable faulty components and make each fault-free processor reach a common agreement in the virtual subnet of MANET","PeriodicalId":383015,"journal":{"name":"The Second International Conference on Availability, Reliability and Security (ARES'07)","volume":"337 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Efficient Malicious Agreement in a Virtual Subnet Network\",\"authors\":\"Shu-Chin Wang, S. Liang, K. Yan, G. Zheng\",\"doi\":\"10.1109/ARES.2007.76\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The fault-tolerance is an important research topic in the study of distributed systems. To cope with the influence from faulty processors, reaching a common agreement in the presence of faults before performing certain special tasks is essential. Therefore, the Byzantine Agreement (BA) problem has drawn more researcher attention as they explore deeper into the world of distributed systems. Traditionally, the BA problem is solved in a wired network. However, the mobile computers have become increasingly popular. This environment encourages distributed system design and practices that support mobile processors. A mobile ad-hoc network (MANET) is different from a wired network. The processors have high mobility. Therefore, to enhance fault-tolerance and MANET reliability, the BA problem in virtual subnet of MANET is revised in this paper. The proposed protocol uses a minimum number of message exchange rounds and can tolerate the maximum number of allowable faulty components and make each fault-free processor reach a common agreement in the virtual subnet of MANET\",\"PeriodicalId\":383015,\"journal\":{\"name\":\"The Second International Conference on Availability, Reliability and Security (ARES'07)\",\"volume\":\"337 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-04-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"The Second International Conference on Availability, Reliability and Security (ARES'07)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ARES.2007.76\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"The Second International Conference on Availability, Reliability and Security (ARES'07)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ARES.2007.76","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

摘要

容错是分布式系统研究中的一个重要课题。为了应对故障处理器的影响,在执行某些特殊任务之前,在存在故障的情况下达成共同协议是至关重要的。因此,随着人们对分布式系统世界的深入探索,拜占庭协议(BA)问题引起了越来越多的研究人员的关注。传统上,BA问题是在有线网络中解决的。然而,移动电脑已经变得越来越流行。这种环境鼓励支持移动处理器的分布式系统设计和实践。移动自组网(MANET)不同于有线网络。处理器具有很高的移动性。因此,为了提高MANET的容错性和可靠性,本文对MANET虚拟子网中的BA问题进行了修正。该协议使用最小的消息交换轮数和最大允许的故障组件数,并使每个无故障处理器在MANET虚拟子网内达成共同协议
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Efficient Malicious Agreement in a Virtual Subnet Network
The fault-tolerance is an important research topic in the study of distributed systems. To cope with the influence from faulty processors, reaching a common agreement in the presence of faults before performing certain special tasks is essential. Therefore, the Byzantine Agreement (BA) problem has drawn more researcher attention as they explore deeper into the world of distributed systems. Traditionally, the BA problem is solved in a wired network. However, the mobile computers have become increasingly popular. This environment encourages distributed system design and practices that support mobile processors. A mobile ad-hoc network (MANET) is different from a wired network. The processors have high mobility. Therefore, to enhance fault-tolerance and MANET reliability, the BA problem in virtual subnet of MANET is revised in this paper. The proposed protocol uses a minimum number of message exchange rounds and can tolerate the maximum number of allowable faulty components and make each fault-free processor reach a common agreement in the virtual subnet of MANET
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信