Renaming in an asynchronous environment
Journal of the ACM (JACM)
Immediate atomic snapshots and fast renaming
PODC '93 Proceedings of the twelfth annual ACM symposium on Principles of distributed computing
Wait-free algorithms for fast, long-lived renaming
Science of Computer Programming
Long-lived renaming made adaptive
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
Fast, wait-free (2k-1)-renaming
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
Wait-free implementations in message-passing systems
Theoretical Computer Science
Reaching Agreement in the Presence of Faults
Journal of the ACM (JACM)
The topological structure of asynchronous computability
Journal of the ACM (JACM)
The Byzantine Generals Problem
ACM Transactions on Programming Languages and Systems (TOPLAS)
Distributed computing: fundamentals, simulations and advanced topics
Distributed computing: fundamentals, simulations and advanced topics
Distributed Algorithms
Adaptive and Efficient Algorithms for Lattice Agreement and Renaming
SIAM Journal on Computing
Polynominal and Adaptive Long-Lived (2k-1)-Renaming
DISC '00 Proceedings of the 14th International Conference on Distributed Computing
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
An Introduction to the Renaming Problem
PRDC '02 Proceedings of the 2002 Pacific Rim International Symposium on Dependable Computing
Efficient Algorithms for Anonymous Byzantine Agreement
Theory of Computing Systems
Agreement among unacquainted byzantine generals
DISC'05 Proceedings of the 19th international conference on Distributed Computing
Note: Strong order-preserving renaming in the synchronous message passing model
Theoretical Computer Science
| Hi-index | 0.00 |
We study the renaming problem in a fully connected synchronous network with Byzantine failures. We show that when faulty processors are able to cheat about their original identities, this problem cannot be solved in an a priori bounded number of rounds for $t\geq(n+n\textrm{ mod }3)/3$, where n is the size of the network and t is the number of failures. This result also implies a $t\geq(n+n\textrm{ mod }4)/2$ bound for the case of faulty processors that are not able to falsify their original identities. In addition, we present several Byzantine renaming algorithms based on distinct approaches, each providing a different tradeoff between its running time and the solution quality.