A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Filters
Communication Complexity of Consensus in Anonymous Message Passing Systems
[chapter]
2011
Lecture Notes in Computer Science
Preserved Fulltext
We consider the message complexity of achieving consensus in synchronous anonymous message passing systems. Unlabeled processors (nodes) communicate through links of a network. ...
In each round every processor can exchange messages with all neighbors and the duration of each transmission is one round. ...
In this paper we consider a generalized version of consensus in synchronous anonymous message passing systems. ...
doi:10.1007/978-3-642-25873-2_14
fatcat:iycm4mrwpba7hcbq4pgsuwvoyy
Hundreds of impossibility results for distributed computing
2003
Distributed computing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2014; you can also visit the original URL.
The file type is application/pdf.
In message-passing models, processes send messages to one another via communication channels. ...
The parameters of the models considered include synchrony, fault-tolerance, di erent communication media, and randomization. The resource bounds refer to time, space and message complexity. ...
Our work was supported by the Natural Sciences and Engineering Research Council of Canada and by Communications and Information Technology Ontario. ...
doi:10.1007/s00446-003-0091-y
fatcat:4m7ylsvxxfdpjdpc26bfdcncaa
Recent Results on Fault-Tolerant Consensus in Message-Passing Networks
[article]
2016
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
This paper surveys important results on fault-tolerant consensus in message-passing networks, and the focus is on results from the past decade. ...
We also discuss Bitcoin, which can be related to solving Byzantine consensus in anonymous systems, and compare Bitcoin with BFT systems and Byzantine consensus. ...
Acknowledgment We would like to thank the anonymous reviewers from SIROCCO 2016 for encouragement and suggestions. We also acknowledge Nitin H. ...
arXiv:1608.07923v1
fatcat:6cqh3mlijrb3vgcbio2j2j3sju
Consensus in Anonymous Distributed Systems: Is There a Weakest Failure Detector?
2010
2010 24th IEEE International Conference on Advanced Information Networking and Applications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Finally, the paper addresses the question of the weakest failure detector to solve consensus in an asynchronous crash-prone anonymous system. ...
problem in anonymous systems. ...
Consensus in non-anonymous message-passing systems Consensus is one of the most famous distributed computing problem. ...
doi:10.1109/aina.2010.19
dblp:conf/aina/BonnetR10
fatcat:iqfuziuy2rgnvl2tyeuiavvdnq
Anonymity Preserving Byzantine Vector Consensus
[article]
2020
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
We prove our algorithm correct and show that it preserves anonymity with at most a linear communication overhead and constant message overhead when compared to a recent consensus baseline. ...
Collecting anonymous opinions finds various applications ranging from simple whistleblowing, releasing secretive information, to complex forms of voting, where participants rank candidates by order of ...
Since reaching consensus deterministically is impossible in failure-prone asynchronous message-passing systems [29] , we assume that partial synchrony holds among processes in P in Section 4. ...
arXiv:1902.10010v2
fatcat:q4x5ibrna5c5xcekldaug7hc6m
Membrane Systems and Distributed Computing
[chapter]
2003
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2008; you can also visit the original URL.
The file type is application/pdf.
We support the idea that P systems can become a primary model for distributed computing, particularly for message-passing algorithms. ...
The example is implemented using a P system library created by the authors to simulate the main functions of a P system, and an MPI program that takes advantage of the highly parallel features provided ...
In membrane systems the process of passing objects through membranes in both directions is similar to message passing. ...
doi:10.1007/3-540-36490-0_12
fatcat:w5v33hauy5cgdnllfkhk3juk4u
A Novel Trade Transaction Agreement Algorithm Using Blockchain Consensus Mechanism
2021
Scientific Programming
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
As a typical decentralized distributed data storage system, consensus reached among all participants in a blockchain system requires a consensus mechanism to be realized. ...
However, some existing consensus mechanisms still have some problems in various aspects. Therefore, this paper proposes a trade deal algorithm based on the blockchain mechanism of consensus. ...
, and anonymous to encrypt the message flow to realize the concept of decentralized energy trading system validation. ...
doi:10.1155/2021/5343337
fatcat:wcsl3vspazaddli3jll7myveom
Failure Detectors in Homonymous Distributed Systems (with an Application to Consensus)
2012
2012 IEEE 32nd International Conference on Distributed Computing Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Hence, the paper provides us with the first proof showing that consensus can be solved in anonymous systems with only partial synchrony (and a majority of correct processes). ...
Finally, two algorithms are presented that use these failure detectors to solve consensus in homonymous asynchronous systems where there is no initial knowledge of the membership. ...
The latter paper [16] mainly explores consensus in a shared memory system with anonymous processes, and bounds the complexity (namely, individual write and step complexities) of solving consensus with ...
doi:10.1109/icdcs.2012.13
dblp:conf/icdcs/ArevaloAIJR12
fatcat:le4i3vvqrnbebduh7r4nxxngha
Failure detectors in homonymous distributed systems (with an application to consensus)
2015
Journal of Parallel and Distributed Computing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Hence, the paper provides us with the first proof showing that consensus can be solved in anonymous systems with only partial synchrony (and a majority of correct processes). ...
Finally, two algorithms are presented that use these failure detectors to solve consensus in homonymous asynchronous systems where there is no initial knowledge of the membership. ...
The latter paper [16] mainly explores consensus in a shared memory system with anonymous processes, and bounds the complexity (namely, individual write and step complexities) of solving consensus with ...
doi:10.1016/j.jpdc.2015.05.007
fatcat:ibop3qtfqvbbbceidvztdxswom
The Price of Anonymity: Optimal Consensus Despite Asynchrony, Crash and Anonymity
[chapter]
2009
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf.
communication system a reliable shared memory system [33], or a reliable message passing system [22] . ...
While t + 1 is a lower bound on the number of rounds to solve consensus in both synchronous message passing systems [1, 21, 31] , and asynchronous message passing systems equipped with a perfect failure ...
This makes us inclined to think that, when comparing to asynchronous non-anonymous system enriched with a perfect failure detector (in which case consensus can be solved in min(t + 1, f + 2) rounds), anonymity ...
doi:10.1007/978-3-642-04355-0_35
fatcat:lv77dvekmbeuhmibd56vypuuyq
The Price of Anonymity
2011
ACM Transactions on Autonomous and Adaptive Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf.
communication system a reliable shared memory system [33], or a reliable message passing system [22] . ...
While t + 1 is a lower bound on the number of rounds to solve consensus in both synchronous message passing systems [1, 21, 31] , and asynchronous message passing systems equipped with a perfect failure ...
This makes us inclined to think that, when comparing to asynchronous non-anonymous system enriched with a perfect failure detector (in which case consensus can be solved in min(t + 1, f + 2) rounds), anonymity ...
doi:10.1145/2019591.2019592
fatcat:qmbg6w2ubnckhgpv4jrntedxxi
Eventual election of multiple leaders for solving consensus in anonymous systems
2015
Journal of Supercomputing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Not only in anonymous message-passing systems the consensus problem is solved, but also several solutions are presented in the literature to achieve consensus in anonymous shared memory systems [3, 4, ...
Consensus in anonymous systems is introduced for first time in [5] . In it, the authors solve consensus with a majority of processes that never crashes and using the failure detector AP. ...
Anonymous system AS AS is a message-passing system formed by a finite set IJ = {/?j}j =1 " ofnprocesses fully interconnected by links. ...
doi:10.1007/s11227-015-1460-6
fatcat:gpyw2uczojfx7j3ztctturuy3u
Consensus and collision detectors in radio networks
2008
Distributed computing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf.
complexity of the problem. ...
In a novel break from existing work, we introduce a collision-prone communication model in which each node may lose an arbitrary subset of the messages sent by its neighbors during each round. ...
Acknowledgments We thank the three anonymous reviewers for their insightful and comprehensive editorial suggestions. The resulting paper is much stronger due to their efforts. ...
doi:10.1007/s00446-008-0056-2
fatcat:5ovk6b2gxzhftl3hhb7h2dwb44
Failure Detectors in Homonymous Distributed Systems (with an Application to Consensus)
[article]
2011
arXiv
pre-print
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
Other Versions
Hence, the paper provides us with the first proof showing that consensus can be solved in anonymous systems with only partial synchrony (and a majority of correct processes). ...
This paper addresses the consensus problem in homonymous distributed systems where processes are prone to crash failures and have no initial knowledge of the system membership ("homonymous" means that ...
The latter paper [7] mainly explores consensus in a shared memory system with anonymous processes, and bounds the complexity (namely, individual write and step complexities) of solving consensus with ...
arXiv:1110.1842v3
fatcat:xpewtsmd7jefjkvrbyireqpu6e
Topological Methods in Distributed Computing (Dagstuhl Seminar 16282)
2016
Dagstuhl Reports
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
In the last 10-15 years, there has been an increasing body of work on applications of topology in theoretical distributed computing. ...
This report documents the program and the outcomes of Dagstuhl Seminar 16282 "Topological Methods in Distributed Computing", which was attended by 22 international researchers, both junior and senior. ...
In the 80s it was realized (due in particular to the work of Fischer, Lynch and Paterson) that certain standard tasks (Consensus) cannot be solved in standard computational models (such as Message-Passing ...
doi:10.4230/dagrep.6.7.31
dblp:journals/dagstuhl-reports/Feichtner-Kozlov16
fatcat:4ka6w55ee5geppiwvxtmy5jx5m
« Previous
Showing results 1 — 15 out of 33,113 results