Brief announcement: order-preserving renaming in synchronous message passing systems with byzantine faults

• Authors: Oksana Denysyuk;Luis Rodrigues
• Venue: PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
• Year: 2012

Renaming is a fundamental problem in distributed computing which consists in a set of processors picking distinct names from a given namespace. We are interested in a stronger variant of the problem in which the processors have to pick new names according to the initial order of their original ids. We assume a fully connected synchronous message passing system consisting of N processors, s of which can exhibit Byzantine behavior. In a synchronous model, renaming can be solved using consensus. However, it is known that renaming is "easier" than consensus. Therefore, in this work we are mainly concerned with the efficiency of performing renaming and briefly describe two contributions in this direction. The first contribution consists in an order-preserving renaming algorithm for N 3t2 with constant step complexity and target namespace of size N2+Nt. As a second contribution we present an order preserving renaming algorithm with O(log N) step complexity and target namespace of size 2N, for N 3t. Full version of this paper is available in [2].