Abstract
The paper addresses the problem of solving classic distributed algorithmic problems under the practical model of Broadcast Communication Networks. Our main result is a new Leader Election algorithm, with O(n) time complexity and O(n · lg(n)) message transmission complexity. Our distributed solution uses a special form of the propagation of information with feedback (PIF) building block tuned to the broadcast media, and a special counting and joining approach for the election procedure phase. The latter is required for achieving the linear time. It is demonstrated that the broadcast model requires solutions which are different from the classic point to point model.
Original language | English |
---|---|
Title of host publication | Distributed Computing - 12th International Symposium, DISC 1998, Proceedings |
Editors | Shay Kutten, Shay Kutten |
Publisher | Springer Verlag |
Pages | 104-118 |
Number of pages | 15 |
ISBN (Print) | 3540650660, 9783540650669 |
DOIs | |
State | Published - 1998 |
Externally published | Yes |
Event | 12th International Symposium on Distributed Computing, DISC 1998 - Andros, Greece Duration: 24 Sep 1998 → 26 Sep 1998 |
Publication series
Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|
Volume | 1499 |
ISSN (Print) | 0302-9743 |
ISSN (Electronic) | 1611-3349 |
Conference
Conference | 12th International Symposium on Distributed Computing, DISC 1998 |
---|---|
Country/Territory | Greece |
City | Andros |
Period | 24/09/98 → 26/09/98 |
Bibliographical note
Publisher Copyright:© Springer-Verlag Berlin Heidelberg 1998.
Keywords
- Broadcast networks
- Distributed
- Leader election
ASJC Scopus subject areas
- Theoretical Computer Science
- General Computer Science