Coordinated consensus in dynamic networks

Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Volumn , Issue , 2011, Pages 1-10

  Kuhn, Fabian ^a   Oshman, Rotem ^b   Moses, Yoram ^c  

^a UNIVERSITY OF LUGANO   (Switzerland)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^c TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

common knowledge; consensus; coordination; distributed algorithms; dynamic networks

Indexed keywords

COMMON KNOWLEDGE; COMMUNICATION GRAPHS; CONSENSUS; DETERMINISTIC FUNCTIONS; DISTRIBUTED ALGORITHM; DISTRIBUTED PROBLEMS; DYNAMIC GRAPH; DYNAMIC NETWORK; DYNAMIC NETWORKS; FUNDAMENTAL PROBLEM; GENERAL GRAPH; NETWORK TOPOLOGY; SYNCHRONOUS MODELS; UPPER BOUND;

ALGORITHMS; ELECTRIC NETWORK TOPOLOGY;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 79959879836     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1993806.1993808     Document Type: Conference Paper

References (24)

1. C. Avin, M. Koucky, and Z. Lotker. How to explore a fast-changing world (cover time of a simple random walk on evloving graphs). In Proc. 35th Coll. on Automata, Lang. and Programming (ICALP), pages 121-132, 2008.
2. A. Bar-Noy and D. Dolev. Consensus algorithms with one-bit messages. Distributed Computing, 4:105-110, 1991.
3. H. Baumann, P. Crescenzi, and P. Fraigniaud. Parsimonious flooding in dynamic graphs. In Proc. 28th Symp. on Principles of Distributed Computing (PODC), pages 260-269, 2009.
4. A. Casteigts, P. Flocchini, W. Quattrociocchi, and N. Santoro. Time-varying graphs and dynamic networks. CoRR, abs/1012.0009, 2010.
5. A. Clementi, C. Macci, A. Monti, F. Pasquale, and R. Silvestri. Flooding time in edge-markovian dynamic graphs. In Proc. 27th Symp. on Principles of Distributed Computing (PODC), pages 213-222, 2008.
6. A. E. F. Clementi, A. Monti, F. Pasquale, and R. Silvestri. Broadcasting in dynamic radio networks. J. Comput. Syst. Sci., 75(4):213-230, 2009.
7. D. Dolev, C. Dwork, O. Waarts, and M. Yung. Perfectly secure message transmission. J. ACM, 40(1):17-47, 1993.
8. C. Dwork and Y. Moses. Knowledge and common knowledge in a Byzantine environment: crash failures. Information and Computation, 88(2):156-186, 1990. (Pubitemid 20735592)
9. C. Dwork, D. Peleg, N. N Pippenger, and E. Upfal. Fault tolerance in networks of bounded degree. In Proc. 8th Symp. on Theory of Computing (STOC), pages 370-379, 1986.
10. R. Fagin, J. Y. Halpern, Y. Moses, and M. Y. Vardi. Reasoning about Knowledge. MIT Press, Cambridge, MA, 2003.
11. A. Fernández Anta, A. Milani, M. A. Mosteiro, and S. Zaks. Opportunistic information dissemination in mobile ad-hoc networks. In Proc. 24th Conference on Distributed Computing (DISC), pages 374-388, 2010.
12. A. Ferreira. Building a reference combinatorial model for MANETs. IEEE Network Magazine, 18(5):24-29, 2004.
13. A. Ferreira, A. Goldman, and J. Monteiro. Performance evaluation of routing protocols for MANETs with known connectivity patterns using evolving graphs. Wireless Networks, 16(3):627-640, 2010.
14. J. A. Garay and R. Ostrovsky. Almost-everywhere secure computation. In Proc. 27th EUROCRYPT, pages 307-323, 2008.
15. J. Y. Halpern and Y. Moses. Knowledge and common knowledge in a distributed environment. J. ACM, 37(3):549-587, 1990.
16. F. Kuhn, C. Lenzen, T. Locher, and R. Oshman. Optimal gradient clock synchronization in dynamic networks. In Proc. 29th Symp. on Principles of Distributed Computing (PODC), pages 430-439, 2010.
17. F. Kuhn, T. Locher, and R. Oshman. Gradient clock synchronization in dynamic networks. In Proc. 21st Symp. Paralellism in Algorithms and Architectures (SPAA), pages 270-279, 2009.
18. F. Kuhn, N. Lynch, and R. Oshman. Distributed computation in dynamic networks. In Proc. 42nd Symp. on Theory of Computing (STOC), pages 513-522, 2010.
19. F. Kuhn and R. Oshman. Dynamic networks: models and algorithms. SIGACT News, 42:82-96, March 2011.
20. T. Mizrahi and Y. Moses. Continuous consensus via common knowledge. Distributed Computing, 20(5):305-321, 2008.
21. Y. Moses and M. R. Tuttle. Programming simultaneous actions using common knowledge. Algorithmica, 3:121-169, 1988. (Pubitemid 18550591)
22. R. O'Dell and R. Wattenhofer. Information dissemination in highly dynamic graphs. In Proc. 9th Joint Workshop on Foundations of Mobile Computing (DIALM-POMC), pages 104-110, 2005.
23. M. Pease, R. Shostak, and L. Lamport. Reaching agreement in the presence of faults. J. ACM, 27(2):228-234, 1980.
24. N. Santoro and P. Widmayer. Time is not a healer. In Proc. 6th Symp. on Theoretical Aspects of Computer Science (STACS), pages 304-313. Springer-Verlag, 1989.