{"title":"Fast consensus under eventually stabilizing message adversaries","authors":"Manfred Schwarz, Kyrill Winkler, U. Schmid","doi":"10.1145/2833312.2833323","DOIUrl":null,"url":null,"abstract":"This paper1 is devoted to deterministic consensus in synchronous dynamic networks with unidirectional links, which are under the control of an omniscient message adversary. Motivated by unpredictable node/system initialization times and long-lasting periods of massive transient faults, we consider message adversaries that guarantee periods of less erratic message loss only eventually: We present a tight bound of 2D + 1 for the termination time of consensus under a message adversary that eventually guarantees a single vertex-stable root component with dynamic network diameter D, as well as a simple algorithm that matches this bound. It effectively halves the termination time 4D + 1 achieved by the fastest consensus algorithm known so far. We also introduce a generalized, considerably stronger variant of our message adversary, and show that our new algorithm, unlike the existing one, still works correctly under it.","PeriodicalId":113772,"journal":{"name":"Proceedings of the 17th International Conference on Distributed Computing and Networking","volume":"62 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-08-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"15","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 17th International Conference on Distributed Computing and Networking","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2833312.2833323","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 15
Abstract
This paper1 is devoted to deterministic consensus in synchronous dynamic networks with unidirectional links, which are under the control of an omniscient message adversary. Motivated by unpredictable node/system initialization times and long-lasting periods of massive transient faults, we consider message adversaries that guarantee periods of less erratic message loss only eventually: We present a tight bound of 2D + 1 for the termination time of consensus under a message adversary that eventually guarantees a single vertex-stable root component with dynamic network diameter D, as well as a simple algorithm that matches this bound. It effectively halves the termination time 4D + 1 achieved by the fastest consensus algorithm known so far. We also introduce a generalized, considerably stronger variant of our message adversary, and show that our new algorithm, unlike the existing one, still works correctly under it.