DocumentCode
1122946
Title
New model and algorithms for leader election in synchronous fiber-optic networks
Author
Abu-Amara, Hosame ; Gummadi, Vidya
Author_Institution
Dept. of Electr. Eng., Texas A&M Univ., College Station, TX, USA
Volume
5
Issue
8
fYear
1994
fDate
8/1/1994 12:00:00 AM
Firstpage
891
Lastpage
896
Abstract
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
Keywords
computational complexity; computer networks; distributed algorithms; optical links; switching theory; distributed algorithms; leader election algorithm; message complexity; synchronous fiber-optic networks; time complexity; Clocks; Concurrent computing; Conferences; Distributed algorithms; Distributed databases; Intelligent networks; Nominations and elections; Optical fiber networks; Permission; Petri nets;
fLanguage
English
Journal_Title
Parallel and Distributed Systems, IEEE Transactions on
Publisher
ieee
ISSN
1045-9219
Type
jour
DOI
10.1109/71.298218
Filename
298218
Link To Document