Iterative approximate Byzantine consensus in arbitrary directed graphs-Reference-Cited by-同舟云学术

Iterative approximate Byzantine consensus in arbitrary directed graphs

Published:2024-05-22 Issue:3 Volume:37 Page:225-246
ISSN:0178-2770
Container-title:Distributed Computing
language:en
Short-container-title:Distrib. Comput.

Author:

Tseng Lewis,Liang Guanfeng,Vaidya Nitin H.

Funder

National Science Foundation

Army Research Office

Publisher

Springer Science and Business Media LLC

Link

https://link.springer.com/content/pdf/10.1007/s00446-024-00468-2.pdf

Reference37 articles.

1. Antoniadis, K., Guerraoui, R., Malkhi, D., Seredinschi, D.: State machine replication is more expensive than consensus. In: Schmid, U., Widder, J. (eds.) 32nd International Symposium on Distributed Computing, DISC 2018, New Orleans, LA, USA, October 15–19, 2018, LIPIcs, vol. 121, pp. 7:1–7:18. Schloss Dagstuhl-Leibniz-Zentrum für Informatik (2018). https://doi.org/10.4230/LIPIcs.DISC.2018.7

2. Attiya, H., Welch, J.: Distributed Computing: Fundamentals, Simulations, and Advanced Topics. Wiley Series on Parallel and Distributed Computing (2004)

3. Azadmanesh, A., Bajwa, H.: Global convergence in partially fully connected networks (PFCN) with limited relays. In: Industrial Electronics Society, 2001. IECON ’01. The 27th Annual Conference of the IEEE, vol. 3(3), pp. 2022–2025 (2001). https://doi.org/10.1109/IECON.2001.975602

4. Azadmanesh, M.H., Kieckhafer, R.: Asynchronous approximate agreement in partially connected networks. Int. J. Parallel Distrib. Syst. Netw. 5(1), 26–34 (2002)

5. Bénézit, F., Blondel, V.D., Thiran, P., Tsitsiklis, J.N., Vetterli, M.: Weighted gossip: distributed averaging using non-doubly stochastic matrices. In: IEEE International Symposium on Information Theory, ISIT 2010, June 13–18, 2010, Austin, Texas, USA, Proceedings, pp. 1753–1757. IEEE (2010). https://doi.org/10.1109/ISIT.2010.5513273