Optimal elections in faulty loop networks and applications

IEEE Transactions on Computers

Volumn 47, Issue 3, 1998, Pages 286-297

  Mans, Bernard ^a   Santoro, Nicola ^b  

^a MACQUARIE UNIVERSITY   (Australia)

^b CARLETON UNIVERSITY   (Canada)

Author keywords

Distributed algorithms; Fault tolerance; Interconnection networks; Leader Election; Loop networks; Sense of direction

Indexed keywords

ALGORITHMS; ELECTRIC NETWORK ANALYSIS; ELECTRIC NETWORK TOPOLOGY; INTERCONNECTION NETWORKS; LOGIC CIRCUITS; NETWORK PROTOCOLS;

LEADER ELECTION PROTOCOL; LOOP NETWORKS;

FAULT TOLERANT COMPUTER SYSTEMS;

EID: 0032023641     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/12.660164     Document Type: Article

References (42)

1. H.H. Abu-Amara, "Fault-Tolerant Distributed Algorithm for Election in Complete Networks," IEEE Trans. Computers, vol. 37, no. 4, pp. 449-453, Apr. 1988.
2. H.H. Abu-Amara and J. Lokre, "Election in Asynchronous Complete Networks with Intermittent Link Failures," IEEE Trans. Computers, vol. 43, no. 7, pp. 778-788, July 1994.
3. B. Arden and H. Lee, "Analysis of Chordal Ring," IEEE Trans. Computers, vol. 30, no. 4, pp. 291-295, Apr. 1981.
4. H. Attiya, J. van Leeuwen, N. Santoro, and S. Zaks, "Efficient Elections in Chordal Ring Networks," Algorithmica, vol. 4, pp. 437-446, 1989.
5. J.-C. Bermond, F. Comellas, and D.F. Hsu, "Distributed Loop Computer Networks: A Survey," J. Parallel and Distributed Computing, vol. 24, pp. 2-10, 1995.
6. H.L. Bodlaender, "New Lower Bound Techniques for Distributed Leader Finding and Other Problems on Rings of Processors," Theoretical Computer Science, vol. 81, pp. 237-256, 1991.
7. J. Bruck, R. Cypher, and C.-T. Ho, "Fault-Tolerant Meshes and Hypercubes with Minimal Numbers of Spares," IEEE Trans. Computers, vol. 42, no. 9, pp. 1,089-1,104, Sept. 1993.
8. D.Z. Du, D.F. Hsu, and F.K. Hwang, "Doubly Link Ring Networks," IEEE Trans. Computers, vol. 34, no. 9, pp. 853-855, Sept. 1985.
9. S. Dutt and J.P. Hayes, "Designing Fault-Tolerant Systems Using Automorphisms," J. Parallel and Distributed Computing, vol. 12, pp. 249-268, 1991.
10. M.J. Fisher, N.A. Lynch, and M.S. Paterson, "Impossibility of Distributed Consensus with One Faulty Process," J. ACM, vol. 32, no. 2, pp. 374-382, Apr. 1985.
11. P. Flocchini and B. Mans, "Optimal Elections in Labeled Hypercubes," J. Parallel and Distributed Computing, vol. 33, no. 1, pp. 76-83, 1996.
12. P. Flocchini, B. Mans, and N. Santoro, "Sense of Direction: Formal Definition and Properties," Proc. First Colloquium Structural and Comm. Complexity, Sirocco '94, pp. 9-34, Ottawa, Canada, 1994.
13. R.G. Gallager, P.A. Humblet, and P.M. Spira, "A Distributed Algorithm for Minimum Spanning Tree," ACM Trans. Programming Languages and Systems, vol. 5, no. 1, pp. 66-77, 1983.
14. O. Goldreich and L. Shira, "Electing a Leader in a Ring with Link Failures," Acta Informatica, vol. 24, pp. 79-91, 1987.
15. J.Y. Halpern and Y. Moses, "Knowledge and Common Knowledge in a Distributed Environment," J. ACM, vol. 37, no. 3, pp. 549-587, July 1990.
16. A. Itai, S. Kutten, Y. Wolfstahl, and S. Zaks, "Optimal Distributed t-Resilient Election in Complete Networks," IEEE Trans. Software Eng., vol. 16, no. 4, pp. 415-420, Apr. 1990.
17. K.E. Johansen, U.L. Horgensen, S.H. Nielsen, S.E. Nielsen, and S. Skyum, "A Distributed Spanning Tree Algorithm," Proc. Second Int'l Workshop Distributed Algorithms (WDAG '87), Lecture Notes in Computer Science, vol. 312, pp. 1-12. Amsterdam: Springer-Verlag, 1987.
18. T.Z. Kalamboukis and S.L. Mantzaris, "Towards Optimal Distributed Election on Chordal Rings," Information Processing Letters, vol. 38, pp. 265-270, 1991.
19. J.L. Kim and G.G. Belford, "A Distributed Election Protocol for Unreliable Networks," J. Parallel and Distributed Computing, vol. 35, pp. 35-42, 1996.
20. E. Korach, S. Kutten, and S. Moran, "A Modular Techniques for the Design of Efficient Leader Finding Algorithms," ACM Trans. Programming Languages and Systems, vol. 12, no. 1, pp. 84-101, Jan. 1990.
21. E. Korach, S. Moran, and S. Zacks, "Tight Lower and Upper Bounds for a Class of Distributed Algorithms for a Complete Network of Processors," Proc. Third ACM Symp. Principles of Distributed Computing (PODC '84), pp. 199-207, Vancouver, Canada, Aug. 1984.
22. I. Lavallée and G. Roucairol, "A Fully Distributed (Minimal) Spanning Tree Algorithm," Information Processing Letters, vol. 23, pp. 55-62, Aug. 1986.
23. M.C. Loui, T.A. Matsushita, and D.B. West, "Election in Complete Networks with a Sense of Direction," Information Processing Letters, vol. 28, p. 327, 1988.
24. B. Mans, "Optimal Distributed Algorithms in Unlabeled Tori and Chordal Rings," Proc. Third Int'l Colloquium Structural Information and Comm. Complexity, Sirocco '96, pp. 17-31, Siena, Italy, June 1996.
25. B. Mans and N. Santoro, "On the Impact of Sense of Direction in Arbitrary Networks," Proc. 14th Int'l Conf. Distributed Computing Systems (ICDCS '94), pp. 258-265, Poznan, Poland, 21-24 June 1994.
26. B. Mans and N. Santoro, "Optimal Fault-Tolerant Leader Election in Chordal Rings," Proc. 24th Ann. Int'l Symp. Fault-Tolerant Computing (FTCS '94), pp. 392-401, Austin, Tex., 15-17 June 1994.
27. H. Masuyama and T. Ichimori, "Tolerance of Double-Loop Computer Networks to Multinode Failures," IEEE Trans. Computers, vol. 38, no. 5, pp. 738-741, May 1989.
28. T. Masuzawa, N. Nishikawa, K. Hagihara, and N. Tokura, "Optimal Fault-Tolerant Distributed Algorithms for Election in Complete Networks with a Global Sense of Direction," Proc. Third Int'l Workshop Distributed Algorithms (WDAG '89), pp. 171-182, Nice, France, 1989.
29. S. Mullender, Distributed Systems. ACM Press, Addison-Wesley, 1993.
30. A. Nayak and N. Santoro, "On Reliability Analysis of Chordal Rings," J. Circuits, Systems, and Computers, vol. 5, no. 2, pp. 199-213, 1995.
31. N. Nishkawa, T. Masuzawa, and N. Tokura, "Fault-Tolerant Distributed Algorithm in Complete Networks with Link and Processor Failures," IEICE Trans. Information and Systems, vol. J74D-I, no. 1, pp. 12-22, Jan. 1991.
32. Y. Pan, "A Near-Optimal Multi-Stage Distributed Algorithm for Finding Leaders in Clustered Chordal Rings," Information Sciences, vol. 76, nos. 1-2, pp. 131-140, 1994.
33. J.M. Peha and P.A. Tobagi, "Comments on Tolerance of Double-Loop Computer Networks to Multinode Failures," IEEE Trans. Computers, vol. 41, no. 11, pp. 1,488-1490, Nov. 1992.
34. C.S. Raghavendra, M. Gerla, and A. Avizienis, "Reliable Loop Topologies for Large Local Computer Networks," IEEE Trans. Computers, vol. 34, no. 1, pp. 46-55, Jan. 1985.
35. N. Santoro, "On the Message Complexity of Distributed Problems," J. Computing Information Science, vol. 13, pp. 131-147, 1984.
36. N. Santoro, "Sense of Direction, Topological Awareness and Communication Complexity," SIGACT NEWS, vol. 2, no. 16, pp. 50-56, Summer 1984.
37. H.M. Sayeed, M. Abu-Amara, and H. Abu-Amara, "Optimal Asynchronous Agreement and Leader Election Algorithm for Complete Networks with Byzantine Faulty Links," Distributed Computing, vol. 9, pp. 147-156, 1995.
38. G. Singh, "Leader Election in the Presence of Link Failures," Proc. 13th ACM Symp. Principles of Distributed Computing (PODC '94), p. 375, Los Angeles, 14-17 Aug. 1994.
39. J. Tyszer, "A Multiple Fault-Tolerant Processor Network Architecture for Pipeline Computing," IEEE Trans. Computers, vol. 37, no. 11, pp. 1,414-1,418, Nov. 1988.
40. J. Wolf, M.T. Liu, B. Weide, and D. Tsay, "Design of a Distributed Fault-Tolerant Loop Network," Proc. Ninth Ann. Int'l Symp. Fault-Tolerant Computing (FTCS 79), pp. 17-24, Madison, June 1979.
41. B. Yi, "Faults and Fault-Tolerance in Distributed Systems: The Election Problem," PhD thesis, Georgia Inst. of Technology, 1994.
42. B. Yi and G. Peterson, "Election on Fault Rings with Incomplete Size Information," Proc. Sixth IEEE Symp. Parallel and Distributed Processing (SPDP '94), Dallas, Tex., 26-29 Oct. 1994