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.
This work is supported in part by JSPS KAKENHI (No. 22300004, No. 24650008, No. 23700019, and No. 24106005).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
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)
Biely, M., Hutle, M.: Consensus when all processes may be Byzantine for some time. In: Guerraoui, R., Petit, F. (eds.) SSS 2009. LNCS, vol. 5873, pp. 120–132. Springer, Heidelberg (2009)
Biely, M., Charron, B., Gaillard, A., Hutle, M., Schiper, A., Widder, J.: Tolerating Corrupted Communication. Swiss National Science Foundation, 200021–111701 (2007)
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)
Diestel, R.: Graph Theory. Springer (1997)
Dolev, D.: The Byzantine generals strike again. J. Algorithms 3, 14–30 (1982)
Dolev, D., Strong, H.R.: Authenticated algorithms for Byzantine agreement. SIAM J. Computing 12(4), 656–666 (1983)
Fisher, M.J., Lynch, N.A., Paterson, M.S.: Impossibility of distributed consensus with one faulty process. J. ACM 32(2), 374–382 (1985)
Garay, J.A.: Reaching (and maintaining) agreement in the presence of mobile faults. In: Tel, G., Vitányi, P.M.B. (eds.) WDAG 1994. LNCS, vol. 857, pp. 253–264. Springer, Heidelberg (1994)
Lamport, L., Shostak, R., Pease, M.: The Byzantine generals problem. ACM Trans. Programming Languages and Systems 4, 382–401 (1982)
Masuzawa, T., Tixeuil, S.: Bounding the impact of unbounded attacks in stabilization. In: Datta, A.K., Gradinariu, M. (eds.) SSS 2006. LNCS, vol. 4280, pp. 440–453. Springer, Heidelberg (2006)
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)
Pease, M., Shostak, R., Lamport, L.: Reaching agreement in the presence of fault. J. ACM 27(2), 228–234 (1980)
Santoro, N., Widmayer, P.: Time is not a healer. In: Cori, R., Monien, B. (eds.) STACS 1989. LNCS, vol. 349, pp. 304–313. Springer, Heidelberg (1989)
Schmid, U., Weiss, B., Keidar, I.: Impossibility results and lower bounds for concensus under link failures. SIAM J. Computing 38(5), 1912–1951 (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer International Publishing Switzerland
About this paper
Cite this paper
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. https://doi.org/10.1007/978-3-319-03850-6_17
Download citation
DOI: https://doi.org/10.1007/978-3-319-03850-6_17
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-03849-0
Online ISBN: 978-3-319-03850-6
eBook Packages: Computer ScienceComputer Science (R0)