This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Optimal Elections in Faulty Loop Networks and Applications
March 1998 (vol. 47 no. 3)
pp. 286-297

Abstract—Loop networks (or Hamiltonian circulant graphs) are a popular class of fault-tolerant network topologies which include rings and complete graphs. For this class, the fundamental problem of Leader Election has been extensively studied, assuming either a fault-free system or an upper-bound on the number of link failures. We consider loop networks where an arbitrary number of links have failed and a processor can only detect the status of its incident links. We show that a Leader Election protocol in a faulty loop network requires only O(n log n) messages in the worst-case, where n is the number of processors. Moreover, we show that this is optimal. The proposed algorithm also detects network partitions. We also show that it provides an optimal solution for arbitrary nonfaulty networks with sense of direction.

[1] H. Abu-Amara, "Fault-tolerant Distributed Algorithms for Election in Complete Networks," IEEE Trans. Computers, vol. 37, no. 4, pp. 449-553, 1988.
[2] 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 Computers: 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 Linked Ring Networks,” IEEE Trans. Computers, vol. 34, pp. 853-855, 1985.
[9] S. Dutt and J.P. Hayes, “Designing Fault-Tolerant Systems Using Auto-morphisms,” J. Parallel and Distributed Computing, vol. 12, no. 3, pp. 249–268, 1991.
[10] M.J. Fischer, N.A. Lynch, and M.S. Paterson, “Impossibility of Distributed Consensus with One Faulty Process,” J. ACM, vol. 32, no. 2, pp. 374i–382, 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. Gallager, P. Humblet, and P. Spira, “A Distributed Algorithm for Minimum-Weight Spanning Trees,” ACM TOPLAS, 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. 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 technique for the design of efficient distributed leader finding algorithms,” ACM Trans. Programming Languages and Systems, vol. 12, no. 1, pp. 84-10, 1990.
[21] E. Korach,S. Moran,, and S. Zaks,“Tight lower and upper bounds for some distributed algorithms for completenetwork of processors,” Proc. Third Ann. ACM Symp. Principles of Distributed Computing, pp. 199-207, 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, June21-24 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., June15-17 1994.
[27] H. Masuyama and T. Ichimori,“Tolerance of double-loop computer network to multinode failures,” IEEE Trans. Computers, vol. 38, pp. 738-741, 1989.
[28] T. Masuzawa and N. Nishikawa, and 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 on Distributed Algorithms, 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 F.A. Tobagi,“Comments on tolerance of double-loop computer networks to multinodefailures,” IEEE Trans. Computers, vol. 41, pp. 1,488-1,450, 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, Aug.14-17 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 Tech nology, 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., Oct.26-29 1994

Index Terms:
Loop networks, Leader Election, fault tolerance, interconnection networks, distributed algorithms, sense of direction.
Citation:
Bernard Mans, Nicola Santoro, "Optimal Elections in Faulty Loop Networks and Applications," IEEE Transactions on Computers, vol. 47, no. 3, pp. 286-297, March 1998, doi:10.1109/12.660164
Usage of this product signifies your acceptance of the Terms of Use.