Sublinear bounds for randomized leader election

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 7730 LNCS, Issue , 2013, Pages 348-362

  Kutten, Shay ^a   Pandurangan, Gopal ^b,c   Peleg, David ^d   Robinson, Peter ^b   Trehan, Amitabh ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

^c Brown Univerity   (United States)

^d WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84883513951     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-35668-1_24     Document Type: Conference Paper

References (33)

1. Afek, Y., Gafni, E.: Time and message bounds for election in synchronous and asynchronous complete networks. SICOMP 20(2), 376-394 (1991)
2. Afek, Y., Matias, Y.: Elections in anonymous networks. Inf. Comput. 113(2), 312-330 (1994)
3. Angluin, D.: Local and global properties in networks of processors (extended abstract). In: STOC, pp. 82-93 (1980)
4. Augustine, J., Pandurangan, G., Robinson, P., Upfal, E.: Towards robust and efficient distributed computation in dynamic peer-to-peer networks. In: SODA (2012)
5. Snir, M., Scheiber, B.: Calling names on nameless networks. Inf. Comput. 113(1), 80-101 (1994)
6. Loui, M.C., Matsushita, T.A., West, D.B.: Election in a complete network with a sense of direction. Information Processing Letters 22(4), 185-187 (1986)
7. Chandra, T.D., Griesemer, R., Redstone, J.: Paxos made live - an engineering perspective (2006 invited talk). In: Proceedings of the 26th Annual ACM Symposium on Principles of Distributed Computing (2007)
8. Gallager, R.G., Humblet, P.A., Spira, P.M.: A distributed algorithm for minimum-weight spanning trees. ACM Trans. Program. Lang. Syst. 5(1), 66-77 (1983)
9. Gupta, I., van Renesse, R., Birman, K.P.: A Probabilistically Correct Leader Election Protocol for Large Groups. In: Herlihy, M.P. (ed.) DISC 2000. LNCS, vol. 1914, pp. 89-103. Springer, Heidelberg (2000)
10. Humblet, P.: Electing a leader in a clique in O (n log n) messages. Intern. Memo., Laboratory for Information and Decision Systems. M.I.T, Cambridge (1984)
11. Itai, A., Rodeh, M.: Symmetry breaking in distributed networks. Inf. Comput. 88(1), 60-87 (1990)
12. Khan, M., Kuhn, F., Malkhi, D., Pandurangan, G., Talwar, K.: Efficient distributed approximation algorithms via probabilistic tree embeddings. In: Proceedings of the Twenty-Seventh ACM Symposium on Principles of Distributed Computing, PODC 2008, pp. 263-272. ACM, New York (2008)
13. Korach, E., Kutten, S., Moran, S.: A modular technique for the design of efficient distributed leader finding algorithms. ACM Trans. Program. Lang. Syst. 12(1), 84-101 (1990)
14. Korach, E., Moran, S., Zaks, S.: Tight lower and upper bounds for some distributed algorithms for a complete network of processors. In: PODC 1984, pp. 199-207. ACM, New York (1984)
15. Korach, E., Moran, S., Zaks, S.: The optimality of distributive constructions of minimum weight and degree restricted spanning trees in a complete network of processors. SIAM Journal on Computing 16(2), 231-236 (1987)
16. Korach, E., Moran, S., Zaks, S.: Optimal lower bounds for some distributed algorithms for a complete network of processors. Theoretical Computer Science 64(1), 125-132 (1989)
17. Lamport, L.: Time, clocks, and the ordering of events in a distributed system. Commun. ACM 21(7), 558-565 (1978)
18. Lamport, L.: The part-time parliament. ACM Trans. Comput. Syst. 16(2), 133-169 (1998)
19. Le Lann, G.: Distributed systems - towards a formal approach. In: IFIP Congress, pp. 155-160 (1977)
20. Lynch, N.: Distributed Algorithms. Morgan Kaufman Publishers, Inc., San Francisco (1996)
21. Malkhi, D., Reiter, M., Wright, R.: Probabilistic quorum systems. In: PODC 1997, pp. 267-273. ACM, New York (1997)
22. Mitzenmacher, M., Upfal, E.: Probability and Computing: Randomized Algorithms and Probabilistic Analysis. Cambridge University Press (2004)
23. Nygren, E., Sitaraman, R.K., Sun, J.: The akamai network: a platform for high-performance internet applications. SIGOPS Oper. Syst. Rev. 44(3), 2-19 (2010)
24. Peleg, D.: Time-optimal leader election in general networks. Journal of Parallel and Distributed Computing 8(1), 96-99 (1990)
25. Peleg, D.: Distributed Computing: A Locality-Sensitive Approach. SIAM (2000)
26. Ramanathan, M.K., Ferreira, R.A., Jagannathan, S., Grama, A., Szpankowski, W.: Randomized leader election. Distributed Computing, 403-418 (2007)
27. Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A scalable content-addressable network. In: SIGCOMM 2001, pp. 161-172. ACM, New York (2001)
28. Rowstron, A., Druschel, P.: Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems. In: Guerraoui, R. (ed.) Middleware 2001. LNCS, vol. 2218, pp. 329-350. Springer, Heidelberg (2001) (Pubitemid 33362020)
29. Santoro, N.: Design and Analysis of Distributed Algorithms. Wiley Series on Parallel and Distributed Computing. Wiley-Interscience (2006)
30. Singh, G.: Efficient distributed algorithms for leader election in complete networks. In: ICDCS, pp. 472-479 (1991)
31. Tel, G.: Introduction to distributed algorithms. Cambridge University Press, New York (1994)
32. Zhao, B.Y., Huang, L., Stribling, J., Rhea, S.C., Joseph, A.D., Kubiatowicz, J.D.: Tapestry: a resilient global-scale overlay for service deployment. IEEE Journal on Selected Areas in Communications 22(1), 41-53 (2004)
33. Kutten, S., Zinenko, D.: Low Communication Self-stabilization through Randomization. In: Lynch, N.A., Shvartsman, A.A. (eds.) DISC 2010. LNCS, vol. 6343, pp. 465-479. Springer, Heidelberg (2010)