A fault-tolerant protocol for election in chordal-ring networks with fail-stop processor failures

IEEE Transactions on Reliability

Volumn 46, Issue 1, 1997, Pages 11-17

  Pan, Yi ^a   Singh, Gurdip ^a,b  

^a UNIVERSITY OF DAYTON   (United States)

^b Kansas State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ASYNCHRONOUS TRANSFER MODE; COMPUTER NETWORKS; COMPUTER SYSTEM RECOVERY; FAULT TOLERANT COMPUTER SYSTEMS; MULTIPROCESSING SYSTEMS;

CHORDAL RING NETWORKS; ELECTION PROTOCOLS;

NETWORK PROTOCOLS;

EID: 0031100702     PISSN: 00189529     EISSN: None     Source Type: Journal    
DOI: 10.1109/24.589920     Document Type: Article

References (15)

1. H. Abu-Amara, "Fault-tolerant distributed algorithms for election in complete networks", IEEE Trans. Computers, vol 37, 1988, pp 449-453.
2. H. Attiya, J. van Leeuwen, N. Santoro, S. Zaks, "Efficient elections in chordal ring networks", Algoriihmica, vol 4, 1989, pp 437-446.
3. M.J. Fisher, N.A. Lynch, M.S. Paterson, "Impossibility of distributed consensus with one faulty process", J. ACM, vol 32, 1985, pp 374-382.
4. T.Z. Kalamboukis, S.L. Mantzaris, "Towards optimal distributed election on chordal rings", Information Processing Letters, vol 38, 1991, pp 265-270.
5. E. Korach, S. Moran, S. Zaks, "Tight lower and upper bounds for some distributed algorithms for a complete network of processors", Proc. Third ACM Symp. Principles of Distributed Computing, 1984, pp 199-207.
6. S. Kutten, Y. Wolfstahl, S. Zaks, "Optimal distributed t-resilient election in complete networks", Technical Report -430, 1986 Äug; Computer Science Dep't, Technion, Israël.
7. M. Loui, T. Matsushita, D. West, "Election in a complete network with a sense of direction", Information Processing Letters, vol 22, 1986, pp 185-187.
8. th Ann. Int'l Symp. Fault-Tolerant Computing, 1994 Jun, pp 258-265.
9. T. Masuzawa, N. Nishikawa, K. Hagihara, N. Tokura, "Optimal faulttolerant distributed algorithms for election in complete networks with a global sense of direction", Proc. 3rd Int'l Workshop on Distributed Algorithms, 1989, pp 171-182; Nice, France.
10. Y. Pan, "Distributed election in partially connected networks with a sense of direction", First Ann. IEEE Symp. Parallel & Distributed Processing, 1989, pp 265-272.
11. Y. Pan, "An improved election algorithm in chordal ring networks", Int'lJ. Computer Mathematics, vol 40, 1991, pp 191-200.
12. Y. Pan, "A near-optimal multistage distributed algorithm for finding leaders in clustered chordal rings", Information Sciences, vol 76, 1994, pp 131-140.
13. G. Peterson, "An O(n-log(n)) unidirectional algorithm for the circular extrema problem", ACM Trans. Programming Languages and Systems, vol 4, 1982, pp 758-762.
14. G. Singh, "Leader election in complete networks", Proc. ACM Symp. Principle of Distributed Computing, 1992 Aug, pp 179-190.
15. G. Singh, "Leader election in the presence of link failures", IEEE Trans. Parallel and Distributed Systems, vol 7, 1996 Mar, pp 231-236.