具有拜占庭故障和小系统同步的一致性

International Conference on Dependable Systems and Networks (DSN'06) Pub Date : 2006-06-25 DOI:10.1109/DSN.2006.22

M. Aguilera, C. Delporte-Gallet, H. Fauconnier, S. Toueg

{"title":"具有拜占庭故障和小系统同步的一致性","authors":"M. Aguilera, C. Delporte-Gallet, H. Fauconnier, S. Toueg","doi":"10.1109/DSN.2006.22","DOIUrl":null,"url":null,"abstract":"We study consensus in a message-passing system where only some of the n2 links exhibit some synchrony. This problem was previously studied for systems with process crashes; we now consider Byzantine failures. We show that consensus can be solved in a system where there is at least one non-faulty process whose links are eventually timely; all other links can be arbitrarily slow. We also show that, in terms of problem solvability, such a system is strictly weaker than one where all links are eventually timely","PeriodicalId":228470,"journal":{"name":"International Conference on Dependable Systems and Networks (DSN'06)","volume":"235 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"45","resultStr":"{\"title\":\"Consensus with Byzantine Failures and Little System Synchrony\",\"authors\":\"M. Aguilera, C. Delporte-Gallet, H. Fauconnier, S. Toueg\",\"doi\":\"10.1109/DSN.2006.22\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We study consensus in a message-passing system where only some of the n2 links exhibit some synchrony. This problem was previously studied for systems with process crashes; we now consider Byzantine failures. We show that consensus can be solved in a system where there is at least one non-faulty process whose links are eventually timely; all other links can be arbitrarily slow. We also show that, in terms of problem solvability, such a system is strictly weaker than one where all links are eventually timely\",\"PeriodicalId\":228470,\"journal\":{\"name\":\"International Conference on Dependable Systems and Networks (DSN'06)\",\"volume\":\"235 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-06-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"45\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Conference on Dependable Systems and Networks (DSN'06)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/DSN.2006.22\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Conference on Dependable Systems and Networks (DSN'06)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DSN.2006.22","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 45

摘要

我们研究了一个消息传递系统中的一致性，在这个系统中，只有n2个链路中的某些链路表现出一定的同步。这个问题以前是针对进程崩溃的系统研究的;我们现在考虑拜占庭式的失败。我们表明，共识可以在一个系统中得到解决，其中至少有一个无故障的过程，其链接最终是及时的;所有其他链接都可以任意慢。我们还表明，就问题的可解决性而言，这样的系统严格弱于所有环节最终都是及时的系统

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Consensus with Byzantine Failures and Little System Synchrony

We study consensus in a message-passing system where only some of the n2 links exhibit some synchrony. This problem was previously studied for systems with process crashes; we now consider Byzantine failures. We show that consensus can be solved in a system where there is at least one non-faulty process whose links are eventually timely; all other links can be arbitrarily slow. We also show that, in terms of problem solvability, such a system is strictly weaker than one where all links are eventually timely

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

International Conference on Dependable Systems and Networks (DSN'06)

自引率

0.00%

发文量