利用形式化框架在全连接网络中定位恶意链接

Adel Khosravi, K. Mohammadi, M. Shiroie
{"title":"利用形式化框架在全连接网络中定位恶意链接","authors":"Adel Khosravi, K. Mohammadi, M. Shiroie","doi":"10.1109/ICSEng.2011.51","DOIUrl":null,"url":null,"abstract":"Byzantine agreement problem has been mostly studied for networks with fallible processors. However, link failure is a common problem in distributed system when the messages are relayed through individual processors and delivered to the receiver. There are few works on locating malicious faulty links using byzantine framework. The proposed protocol can detect/locate maximum number of malicious faulty links and tolerate maximum number of allowable faulty links to make each fault-free processor reaching a common agreement.","PeriodicalId":387483,"journal":{"name":"2011 21st International Conference on Systems Engineering","volume":"4 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-08-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Locating Malicious Links in Fully-Connected Networks Using a Formal Framework\",\"authors\":\"Adel Khosravi, K. Mohammadi, M. Shiroie\",\"doi\":\"10.1109/ICSEng.2011.51\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Byzantine agreement problem has been mostly studied for networks with fallible processors. However, link failure is a common problem in distributed system when the messages are relayed through individual processors and delivered to the receiver. There are few works on locating malicious faulty links using byzantine framework. The proposed protocol can detect/locate maximum number of malicious faulty links and tolerate maximum number of allowable faulty links to make each fault-free processor reaching a common agreement.\",\"PeriodicalId\":387483,\"journal\":{\"name\":\"2011 21st International Conference on Systems Engineering\",\"volume\":\"4 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-08-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 21st International Conference on Systems Engineering\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICSEng.2011.51\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 21st International Conference on Systems Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICSEng.2011.51","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

摘要

拜占庭协议问题主要是针对具有可错处理器的网络进行研究。然而,在分布式系统中,当消息通过单个处理器传递到接收方时,链路故障是一个常见的问题。利用拜占庭框架定位恶意错误链接的工作很少。该协议可以检测/定位最大数量的恶意故障链路,并允许最大数量的允许故障链路,使每个无故障处理器达到共同的协议。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Locating Malicious Links in Fully-Connected Networks Using a Formal Framework
Byzantine agreement problem has been mostly studied for networks with fallible processors. However, link failure is a common problem in distributed system when the messages are relayed through individual processors and delivered to the receiver. There are few works on locating malicious faulty links using byzantine framework. The proposed protocol can detect/locate maximum number of malicious faulty links and tolerate maximum number of allowable faulty links to make each fault-free processor reaching a common agreement.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信