This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
New Model and Algorithms for Leader Election in Synchronous Fiber-Optic Networks
August 1994 (vol. 5 no. 8)
pp. 891-896

We improve on I. Cidon, I. Gopal and S. Kutten's leader election algorithm (Proc. 7th ACM Symp. Principles Distrib. Computing, Toronto, Ont., Canada. Aug. 1988) by presenting an algorithm that uses only O(/spl radic/n log D + f) time units to run on synchronous networks of degree f and diameter D, where f/spl ges/3. When f is 2, the algorithm uses only O(log D) time units.

[1] H. Abu-Amara, "A fast topology maintenance algorithm for high-bandwidth networks,"Proc. 27th Ann. Allerton Conf. Commun., Control, Computing, 1989, pp. 596-602.
[2] H. Abu-Amara, "Fault-tolerant distributed algorithm for election in complete networks,"IEEE Trans. Comput., vol. 37, pp. 449-453, Apr. 1988.
[3] H. Abu-Amara and A. Kanevsky, "Simple optimal algorithm for leader election," Tech. Rep. TAMU 91-026, Comput. Sci. Dept., Texas A&M Univ., College Station, TX.
[4] P. A. Alsberg and J. D. Day, "A principle for resilient sharing of distributed resources," inProc. 2nd Int. Conf. Software Eng., San Franscisco, CA, Oct. 1976, pp. 562-570.
[5] I. Cidon and I. Gopal, "PARIS: An approach to private integrated networks,"J. Analog Digital Cabled Syst., to appear.
[6] I. Cidon, I. Gopal, and S. Kutten, "New models and algorithms for future networks,"Proc. 7th ACM Symp. Principles Distrib. Computing, Toronto, ON, Canada, Aug. 1988.
[7] D. Dolev, M. Klawe, and M. Rodeh, "AnO(nlogn) unidirectional distributed algorithm for extrema finding in a circle,"J. Algorithms, vol. 3, pp. 245-260, Sept. 1982.
[8] J. Hui and E. Arthurs, "A Broadband Packet Switch for Integrated Transport,"IEEE J. Selected Areas Comm., Vol. SAC- 5, No. 8, Oct. 1987, pp. 1,264-1,273.
[9] F. Mattern, "Message complexity of simple ring-based election algorithms--An empirical analysis," inProc. IEEE 9th Int. Conf. Distrib. Computing Syst., 1989, pp. 94-100.
[10] D. A. Menasce, G. J. Popek, and R. R. Muntz, "A locking protocol for resource coordination in distributed databases,"ACM Trans. Database Syst., vol. 5, pp. 103-138, June 1980.
[11] J. S. Turner and L. F. Wyatt, "A packet network for integrated services,"Proc. Globecom '83, IEEE Global Telecommun. Conf., 1983, pp. 45-50.

Index Terms:
Index Termsdistributed algorithms; computational complexity; optical links; computer networks;switching theory; leader election algorithm; synchronous fiber-optic networks; timecomplexity; distributed algorithms; message complexity
Citation:
H. Abu-Amara, V. Gummadi, "New Model and Algorithms for Leader Election in Synchronous Fiber-Optic Networks," IEEE Transactions on Parallel and Distributed Systems, vol. 5, no. 8, pp. 891-896, Aug. 1994, doi:10.1109/71.298218
Usage of this product signifies your acceptance of the Terms of Use.