TY - JOUR
T1 - Renaming in synchronous message passing systems with Byzantine failures
AU - Okun, Michael
AU - Barak, Amnon
AU - Gafni, Eli
PY - 2008/4
Y1 - 2008/4
N2 - We study the renaming problem in a fully connected synchronous network with Byzantine failures. We show that when the original namespace of the processors is unbounded, this problem cannot be solved in an a priori bounded number of rounds for t ≥(n+n mod 3)/3, where n is the size of the network and t is the number of failures. On the other hand, for n > 3t, we present a Byzantine renaming algorithm that runs in O(lg n) rounds. In addition, we present a fast, efficient strong renaming algorithm for n > t, which runs in O(lg 2[N0/n]rounds, where N 0 is the value of the highest identifier among all the correct processors.
AB - We study the renaming problem in a fully connected synchronous network with Byzantine failures. We show that when the original namespace of the processors is unbounded, this problem cannot be solved in an a priori bounded number of rounds for t ≥(n+n mod 3)/3, where n is the size of the network and t is the number of failures. On the other hand, for n > 3t, we present a Byzantine renaming algorithm that runs in O(lg n) rounds. In addition, we present a fast, efficient strong renaming algorithm for n > t, which runs in O(lg 2[N0/n]rounds, where N 0 is the value of the highest identifier among all the correct processors.
KW - Byzantine failures
KW - Renaming problem
KW - Synchronous message passing model
UR - http://www.scopus.com/inward/record.url?scp=41549084606&partnerID=8YFLogxK
U2 - 10.1007/s00446-007-0045-x
DO - 10.1007/s00446-007-0045-x
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:41549084606
SN - 0178-2770
VL - 20
SP - 403
EP - 413
JO - Distributed Computing
JF - Distributed Computing
IS - 6
ER -