Efficient leader election using sense of direction

Distributed Computing

Volumn 10, Issue 3, 1997, Pages 159-165

  Singh, Gurdip ^a  

^a Sunflower Networking Group   (United States)

Author keywords

Complete networks; Distributed algorithm; Leader election; Message complexity

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER NETWORKS; DISTRIBUTED COMPUTER SYSTEMS;

LEADER ELECTION; MESSAGE COMPLEXITY;

NETWORK PROTOCOLS;

EID: 0031117721     PISSN: 01782770     EISSN: None     Source Type: Journal    
DOI: 10.1007/s004460050033     Document Type: Article

References (8)

1. Afek Y, Gafni E (1991) Time and message bounds for election in synchronous and asynchronous complete networks. SIAM J Comput 20(2): 376-394.
2. Attiya H, Leeuwen J, Santoro N, Zaks S (1989) Efficient elections in chordal ring networks. Algorithmica 4: 437-446
3. Kalamboukis TZ, Mantzaris S (1991) Towards optimal distributed election on chordal rings. Inf Process Lett 38: 265-270
4. Korach E, Moran S, Zaks S (1989) Optimal lower bounds for some distributed algorithms for a complete network of processors. Theor Comput Sci 64: 125-132
5. Loui M, Matsushita T, West D (1986) Election in complete networks with a sense of direction. Inf Process Lett 22: 185-187
6. Masuzawa T, Nishikawa N, Hagihara K, Tokura N (1989) Optimal fault-tolerant distributed algorithms for election in complete networks with a global sense of direction. In: Proceedings of the 3rd Int'l Workshop on Distributed Algorithms 171-182.
7. Pan Y (1994) A near-optimal multistage distributed algorithm for finding leaders in clustered chordal rings. Inf Sci 76: 131-140
8. Santoro N (1984) Sense of direction, topological awareness, and communication complexity. SIGACT News 2(16): 50-56