By Topic

New model and algorithms for leader election in synchronous fiber-optic networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
H. Abu-Amara ; Dept. of Electr. Eng., Texas A&M Univ., College Station, TX, USA ; V. Gummadi

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(√n log D + f) time units to run on synchronous networks of degree f and diameter D, where f⩾3. When f is 2, the algorithm uses only O(log D) time units

Published in:

IEEE Transactions on Parallel and Distributed Systems  (Volume:5 ,  Issue: 8 )