Highly dynamic distributed computing with byzantine failures

Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Volumn , Issue , 2013, Pages 176-183

  Guerraoui, Rachid ^a   Huc, Florian ^a   Kermarrec, Anne Marie ^b  

^a EPFL   (Switzerland)

^b INRIA   (France)

Author keywords

Byzantine failures; Dynamic networks; Random walks

Indexed keywords

BYZANTINE FAILURES; COMMUNICATION COST; DYNAMIC NETWORK; HIGH PROBABILITY; NODE ARRIVAL; POLYLOGARITHMIC; RANDOM WALK;

COMPUTATION THEORY;

EID: 84883492472     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2484239.2484263     Document Type: Conference Paper

References (33)

1. D. Aldous and J. Fill. Reversible markov chains and random walks on graphs. http://stat-www.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.
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.
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.
9. R. Baldoni, S. Bonomi, and M. Raynal. An implementation in a churn prone environment. In SIROCCO, pages 15-29, 2009.
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.
11. Z. Galil and M. Yung. Partitioned encryption and achieving simultaneity by partitioning. Information Processing Letters, 26(2): 81-88, 1987.
12. S. Gambs, R. Guerraoui, H. Harkous, F. Huc, and A.-M. Kermarrec. Scalable and secure polling in dynamic distributed networks. SRDS, 2012.
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.
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.
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.
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.
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.
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.
23. F. Kuhn, S. Schmid, and R. Wattenhofer. Towards worst-case churn resistant peer-to-peer systems. Distributed Computing, 22(4): 249-267, 2010.
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.
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.
26. C. Law and K. Siu. Distributed construction of random expander graphs. In Proceedi ngs 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.
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 comm uni cations, pages 161-172, 2001.
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.
31. C. Scheideler. How to spread adversarial nodes? Rotate! Proceedings of the 37th annual symposium on Theory of computing (STOC'05), page 704, 2005.
32. C. Scheideler and S. Schmid. A distributed and oblivious heap. Automata, Languages and Programming, pages 571-582, 2009.
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.