research-article

Highly dynamic distributed computing with byzantine failures

Authors:

Rachid Guerraoui,

Anne-Marie KermarrecAuthors Info & Claims

PODC '13: Proceedings of the 2013 ACM symposium on Principles of distributed computing

Pages 176 - 183

https://doi.org/10.1145/2484239.2484263

Published: 22 July 2013 Publication History

Abstract

This paper shows for the first time that distributed computing can be both reliable and efficient in an environment that is both highly dynamic and hostile. More specifically, we show how to maintain clusters of size O(log N), each containing more than two thirds of honest nodes with high probability, within a system whose size can vary polynomially with respect to its initial size. Furthermore, the communication cost induced by each node arrival or departure is polylogarithmic with respect to N, the maximal size of the system. Our clustering can be achieved despite the presence of a Byzantine adversary controlling a fraction τ ≤ ¹⁄₃-ε of the nodes, for some fixed constant ε > 0, independent of N. So far, such a clustering could only be performed for systems whose size can vary constantly and it was not clear whether that was at all possible for polynomial variances.

References

[1]

D. Aldous and J. Fill. Reversible markov chains and random walks on graphs. http://statwww.berkeley.edu/users/aldous/RWG/book.html.

[2]

J. Aspnes and U. Wieder. The expansion and mixing time of skip graphs with applications. ACM Symposium on Parallelism in Algorithms and Architectures (SPAA'05), pages 126--134, 2005.

Digital Library

[3]

J. Aspnes and Y. Yin. Distributed algorithms for maintaining dynamic expander graphs. Citeseer, 2008.

[4]

J. Augustine, G. Pandurangan, P. Robinson, and E. Upfal. Towards robust and efficient computation in dynamic peer-to-peer networks. Arxiv preprint, arXiv:1108.0809, 2011.

[5]

B. Awerbuch and C. Scheideler. Group spreading: A protocol for provably secure distributed name service. Automata, Languages and Programming, pages 187--210, 2004.

[6]

B. Awerbuch and C. Scheideler. Towards scalable and robust overlay networks. In Proceedings of the International Workshop on Peer-To-Peer Systems (IPTPS'07), 2007.

[7]

B. Awerbuch and C. Scheideler. Towards a scalable and robust DHT. Theory of Computing Systems, 45(2):234--260, 2009.

Digital Library

[8]

R. Baldoni, S. Bonomi, and A. S. Nezhad. An algorithm for implementing bft registers in distributed systems with bounded churn. In SSS, pages 32--46, 2011.

Digital Library

[9]

R. Baldoni, S. Bonomi, and M. Raynal. An implementation in a churn prone environment. In SIROCCO, pages 15--29, 2009.

Digital Library

[10]

H. Baumann, P. Crescenzi, and P. Fraigniaud. Parsimonious flooding in dynamic graphs. In Proceedings of the 28th symposium on Principles of distributed computing (PODC'09), 2009.

Digital Library

[11]

Z. Galil and M. Yung. Partitioned encryption and achieving simultaneity by partitioning. Information Processing Letters, 26(2):81--88, 1987.

Digital Library

[12]

S. Gambs, R. Guerraoui, H. Harkous, F. Huc, and A.-M. Kermarrec. Scalable and secure polling in dynamic distributed networks. SRDS, 2012.

Digital Library

[13]

J. Garay, J. Katz, R. Kumaresan, and H. Zhou. Adaptively secure broadcast, revisited. In 30th annual Symposium on Principles of Distributed Computing (PODC'11), 2011.

Digital Library

[14]

A. Giurgiu, R. Guerraoui, K. Huguenin, and A. Kermarrec. Computing in social networks. Stabilization, Safety, and Security of Distributed Systems, pages 332--346, 2010.

Digital Library

[15]

C. Gkantsidis, M. Mihail, and A. Saberi. Random walks in peer-to-peer networks. In Proceedings of the 23rd Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM'2004), volume 1, 2004.

[16]

R. Guerraoui, F. Huc, and A.-M. Kermarrec. Highly dynamic distributed computing with byzantine failures. Arxiv preprint, arXiv:1202.3084, 2013.

Digital Library

[17]

M. Habib, C. McDiarmid, J. Ramirez-Alfonsin, and B. Reed. Probabilistic Methods for Algorithmic Discrete Mathematics. Springer Verlag, Berlin, 1998.

[18]

V. King, S. Lonargan, J. Saia, and A. Trehan. Load balanced scalable byzantine agreement through quorum building, with full information. Distributed Computing and Networking, pages 203--214, 2011.

[19]

V. King and J. Saia. Scalable Byzantine Computation. ACM SIGACT News, 41(3), 2010.

Digital Library

[20]

M. Krebs and A. Shaheen. Expander Families and Cayley Graphs: A Beginner's Guide. Oxford University Press, USA, 2011.

[21]

F. Kuhn, N. Lynch, and R. Oshman. Distributed computation in dynamic networks. In Proceedings of the 42nd symposium on Theory of computing (STOC'10), pages 513--522, 2010.

Digital Library

[22]

F. Kuhn, Y. Moses, and R. Oshman. Coordinated consensus in dynamic networks. In Proceedings of the 30th annual symposium on Principles of distributed computing (PODC'11), pages 1--10, 2011.

Digital Library

[23]

F. Kuhn, S. Schmid, and R. Wattenhofer. Towards worst-case churn resistant peer-to-peer systems. Distributed Computing, 22(4):249--267, 2010.

Digital Library

[24]

K. L., E. Liberty, and O. Somekh. Estimating sizes of social networks via biased sampling. In Proceedings of the 20th international conference on World wide web, pages 597--606. ACM, 2011.

Digital Library

[25]

L. Lamport, R. Shostak, and M. Pease. The Byzantine Generals Problem. ACM Transactions on Programming Languages and Systems (TOPLAS'82), 4(3):382--401, July 1982.

Digital Library

[26]

C. Law and K. Siu. Distributed construction of random expander graphs. In Proceedings of 22nd Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM'2003), pages 2133--2143, 2003.

[27]

X. Li, J. Misra, and C. Plaxton. Active and concurrent topology maintenance. Distributed Computing, pages 320--334, 2004.

[28]

G. Pandurangan and A. Trehan. Xheal: localized self-healing using expanders. In Proceedings of the 30th annual symposium on Principles of distributed computing (PODC'11), pages 301--310, 2011.

Digital Library

[29]

S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker. A scalable content-addressable network. In Conference on Applications, technologies, architectures, and protocols for computer communications, pages 161--172, 2001.

Digital Library

[30]

A. Rowstron and P. Druschel. Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems. In Proceedings of Middleware'01, pages 329--350, 2001.

Digital Library

[31]

C. Scheideler. How to spread adversarial nodes? Rotate! Proceedings of the 37th annual symposium on Theory of computing (STOC'05), page 704, 2005.

Digital Library

[32]

C. Scheideler and S. Schmid. A distributed and oblivious heap. Automata, Languages and Programming, pages 571--582, 2009.

Digital Library

[33]

B. Zhao, L. Huang, J. Stribling, S. Rhea, A. Joseph, and J. Kubiatowicz. Tapestry: A resilient global-scale overlay for service deployment. IEEE Journal on Selected Areas in Communications, 22(1):41--53, 2004.

Digital Library

Cited By

Chaurasia BVerma AVerma P(2024)An in-depth and insightful exploration of failure detection in distributed systemsComputer Networks10.1016/j.comnet.2024.110432247(110432)Online publication date: Jun-2024
https://doi.org/10.1016/j.comnet.2024.110432
Gupta DSaia JYoung M(2023)Bankrupting Sybil despite churnJournal of Computer and System Sciences10.1016/j.jcss.2023.02.004135(89-124)Online publication date: Aug-2023
https://doi.org/10.1016/j.jcss.2023.02.004
Zhou SHuang HLi RLiu JZheng Z(2023)ComAvgComputer Communications10.1016/j.comcom.2023.09.004211:C(147-156)Online publication date: 1-Nov-2023
https://dl.acm.org/doi/10.1016/j.comcom.2023.09.004
Show More Cited By

Index Terms

Highly dynamic distributed computing with byzantine failures
1. Theory of computation
  1. Randomness, geometry and discrete structures

Recommendations

Scalable and Secure Polling in Dynamic Distributed Networks
SRDS '12: Proceedings of the 2012 IEEE 31st Symposium on Reliable Distributed Systems

We consider the problem of securely conducting a poll in synchronous dynamic networks equipped with a Public Key Infrastructure (PKI). Whereas previous distributed solutions had a communication cost of $O(n^2)$ in an $n$ nodes system, we present SPP (...
Containing Byzantine Failures with Control Zones
We consider the problem of reliably broadcasting messages in a network where some nodes are likely to fail. We consider the most general failure model: the Byzantine model, where the failing nodes have an arbitrary behavior, and may actively try to ...
Asynchronous Byzantine Agreement with optimal resilience

We present an efficient, optimally-resilient Asynchronous Byzantine Agreement (ABA) protocol involving $$n = 3t+1$$n=3t+1 parties over a completely asynchronous network, tolerating a computationally unbounded Byzantine adversary, capable of corrupting ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

PODC '13: Proceedings of the 2013 ACM symposium on Principles of distributed computing

July 2013

422 pages

ISBN:9781450320658

DOI:10.1145/2484239

General Chair:
Panagiota Fatourou
FORTH ICS & University of Crete, Greece
,
Program Chair:
Gadi Taubenfeld
IDC, Israel

Copyright © 2013 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 22 July 2013

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Conference

PODC '13

Sponsor:

PODC '13: ACM Symposium on Principles of Distributed Computing

July 22 - 24, 2013

Québec, Montréal, Canada

Acceptance Rates

PODC '13 Paper Acceptance Rate 37 of 145 submissions, 26%;

Overall Acceptance Rate 740 of 2,477 submissions, 30%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

43
Total Citations
View Citations
593
Total Downloads

Downloads (Last 12 months)12
Downloads (Last 6 weeks)1

Reflects downloads up to 30 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

Chaurasia BVerma AVerma P(2024)An in-depth and insightful exploration of failure detection in distributed systemsComputer Networks10.1016/j.comnet.2024.110432247(110432)Online publication date: Jun-2024
https://doi.org/10.1016/j.comnet.2024.110432
Gupta DSaia JYoung M(2023)Bankrupting Sybil despite churnJournal of Computer and System Sciences10.1016/j.jcss.2023.02.004135(89-124)Online publication date: Aug-2023
https://doi.org/10.1016/j.jcss.2023.02.004
Zhou SHuang HLi RLiu JZheng Z(2023)ComAvgComputer Communications10.1016/j.comcom.2023.09.004211:C(147-156)Online publication date: 1-Nov-2023
https://dl.acm.org/doi/10.1016/j.comcom.2023.09.004
Aradhya VGilbert SHobor A(2023)Robust Overlays Meet BlockchainsStabilization, Safety, and Security of Distributed Systems10.1007/978-3-031-44274-2_15(191-206)Online publication date: 30-Sep-2023
https://doi.org/10.1007/978-3-031-44274-2_15
Augustine JChatterjee SPandurangan GAgrawal KLee I(2022)A Fully-Distributed Scalable Peer-to-Peer Protocol for Byzantine-Resilient Distributed Hash TablesProceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures10.1145/3490148.3538588(87-98)Online publication date: 11-Jul-2022
https://dl.acm.org/doi/10.1145/3490148.3538588
Augustine JBhat WNair S(2022)Plateau: A Secure and Scalable Overlay Network for Large Distributed Trust ApplicationsStabilization, Safety, and Security of Distributed Systems10.1007/978-3-031-21017-4_5(69-83)Online publication date: 9-Nov-2022
https://doi.org/10.1007/978-3-031-21017-4_5
Dotan MPignolet YSchmid STochner SZohar A(2021)Survey on Blockchain NetworkingACM Computing Surveys10.1145/345316154:5(1-34)Online publication date: 25-May-2021
https://dl.acm.org/doi/10.1145/3453161
Zou YYu DYu JZhang YDressler FCheng X(2021)Distributed Byzantine-Resilient Multiple-Message Dissemination in Wireless NetworksIEEE/ACM Transactions on Networking10.1109/TNET.2021.306932429:4(1662-1675)Online publication date: Aug-2021
https://doi.org/10.1109/TNET.2021.3069324
Cason DFynn EMilosevic NMilosevic ZBuchman EPedone F(2021)The design, architecture and performance of the Tendermint Blockchain Network2021 40th International Symposium on Reliable Distributed Systems (SRDS)10.1109/SRDS53918.2021.00012(23-33)Online publication date: Sep-2021
https://doi.org/10.1109/SRDS53918.2021.00012
Soleymani MMahdavifar HAvestimehr A(2021)Analog Lagrange Coded ComputingIEEE Journal on Selected Areas in Information Theory10.1109/JSAIT.2021.30563772:1(283-295)Online publication date: Mar-2021
https://doi.org/10.1109/JSAIT.2021.3056377
Show More Cited By

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents