Mobile Byzantine Agreement on Arbitrary Network

  • Toru Sasaki
  • Yukiko Yamauchi
  • Shuji Kijima
  • Masafumi Yamashita
Conference paper

DOI: 10.1007/978-3-319-03850-6_17

Volume 8304 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Sasaki T., Yamauchi Y., Kijima S., Yamashita M. (2013) Mobile Byzantine Agreement on Arbitrary Network. In: Baldoni R., Nisse N., van Steen M. (eds) Principles of Distributed Systems. OPODIS 2013. Lecture Notes in Computer Science, vol 8304. Springer, Cham

Abstract

The mobile Byzantine agreement problem on general network is investigated for the first time. We first show that the problem is unsolvable on any network with the order n and the vertex connectivity d, if n ≤ 6t or d ≤ 4t, where t is an upper bound on the number of faulty processes. Assuming full synchronization and the existence of a permanently non-faulty process, we next propose two t-resilient mobile Byzantine agreement algorithms for some families of not fully connected networks. They are optimal on some networks, in the sense that they correctly work if n > 6t and d > 4t.

Keywords

agreement problem Byzantine fault distributed network distributed algorithm mobile Byzantine agreement problem 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer International Publishing Switzerland 2013

Authors and Affiliations

  • Toru Sasaki
    • 1
  • Yukiko Yamauchi
    • 1
  • Shuji Kijima
    • 1
  • Masafumi Yamashita
    • 1
  1. 1.Graduate School of Information Science and Electrical EngineeringKyushu UniversityNishiJapan