Mobile Byzantine Agreement on Arbitrary Network
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.
Keywordsagreement problem Byzantine fault distributed network distributed algorithm mobile Byzantine agreement problem
Unable to display preview. Download preview PDF.
- 1.Banu, N., Souissi, S., Izumi, T., Wada, K.: An improved Byzantine agreement algorithm for synchronous systems with mobile faults. Int’l J. Computer Applications 43, 21 (2011)Google Scholar
- 3.Biely, M., Charron, B., Gaillard, A., Hutle, M., Schiper, A., Widder, J.: Tolerating Corrupted Communication. Swiss National Science Foundation, 200021–111701 (2007)Google Scholar
- 4.Buhrman, H., Garay, J.A., Hoepman, J.: Optimal resiliency against mobile faults. In: Proc. 25th Int’l Symp. Fault-Tolerant Computing (FTCS 1995), pp. 83–88 (1995)Google Scholar
- 5.Diestel, R.: Graph Theory. Springer (1997)Google Scholar
- 12.Nesterenko, M., Rora, A.: Tolerance to unbounded Byzantine faults. In: Proc. of 21st IEEE Symposium on Reliable Distributed Systems (SRDS 2002), pp. 22–29 (2002)Google Scholar