Matches in SemOpenAlex for { <https://semopenalex.org/work/W89820973> ?p ?o ?g. }
Showing items 1 to 89 of
89
with 100 items per page.
- W89820973 abstract "Consider a data communication network of n nodes, each of which has a unique identifier (id); otherwise the nodes are identical. The nodes are asleep and have no global information about network topology, number and ids of other nodes, etc. A distributed election algorithm is a means by which the nodes of the network distinguish one among them as the leader.The problem of distributively electing a leader in a network is viewed as a problem of synchronization among potential candidates for leadership. Each candidate tries to capture all the nodes. To guarantee that only one succeeds, all but one candidate are killed. Following this view election algorithms in a general, two component framework are designed. Component one is a capturing and termination detection mechanism, assuming only one candidate. Component two is a synchronization mechanism, to eliminate all but one candidate.In arbitrary networks the synchronization is complicated by the uncertainties of nodes about the network topology and the relative location of candidates. Two network models are considered: first, a complete network in which a bidirectional communication link connects every node with every other, thus eliminating topological uncertainties; and second, the opposite extreme in which topological uncertainties are at maximum--a strongly connected unidirectional network with some or all links transmitting messages in one direction only.The study produces an O(n(.)log n) messages O(log n) time synchronous and O(n(.)log n) messages O(n) time asynchronous election algorithm in complete networks. For unidirectional networks we derive a distributed election algorithm whose communication complexity is O(n(.)(VBAR)E(VBAR) + n('2)log n) bits, where (VBAR)E(VBAR) is the total number of links.We also establish that (OMEGA)(n(.)log n) is a lower bound on the total number of messages transmitted for achieving election in synchronous complete networks. Moreover, it is shown that the time complexity of message-optimal synchronous algorithms is (OMEGA)(log n), hence the optimality of our synchronous complete network algorithm. It remains open whether a sublinear time, message-optimal, asynchronous complete network election algorithm exists." @default.
- W89820973 created "2016-06-24" @default.
- W89820973 creator A5081092410 @default.
- W89820973 date "1985-01-01" @default.
- W89820973 modified "2023-09-23" @default.
- W89820973 title "Distributed algorithms for election in unidirectional and complete networks (traversal, synchronous, leader, asynchronous, complexity)" @default.
- W89820973 hasPublicationYear "1985" @default.
- W89820973 type Work @default.
- W89820973 sameAs 89820973 @default.
- W89820973 citedByCount "2" @default.
- W89820973 crossrefType "journal-article" @default.
- W89820973 hasAuthorship W89820973A5081092410 @default.
- W89820973 hasConcept C11413529 @default.
- W89820973 hasConcept C114614502 @default.
- W89820973 hasConcept C118615104 @default.
- W89820973 hasConcept C120314980 @default.
- W89820973 hasConcept C127162648 @default.
- W89820973 hasConcept C127413603 @default.
- W89820973 hasConcept C130120984 @default.
- W89820973 hasConcept C140745168 @default.
- W89820973 hasConcept C151319957 @default.
- W89820973 hasConcept C154504017 @default.
- W89820973 hasConcept C154945302 @default.
- W89820973 hasConcept C184720557 @default.
- W89820973 hasConcept C193435613 @default.
- W89820973 hasConcept C199845137 @default.
- W89820973 hasConcept C2778562939 @default.
- W89820973 hasConcept C311688 @default.
- W89820973 hasConcept C31258907 @default.
- W89820973 hasConcept C33923547 @default.
- W89820973 hasConcept C38754835 @default.
- W89820973 hasConcept C41008148 @default.
- W89820973 hasConcept C53480672 @default.
- W89820973 hasConcept C62611344 @default.
- W89820973 hasConcept C63553672 @default.
- W89820973 hasConcept C66938386 @default.
- W89820973 hasConcept C80444323 @default.
- W89820973 hasConceptScore W89820973C11413529 @default.
- W89820973 hasConceptScore W89820973C114614502 @default.
- W89820973 hasConceptScore W89820973C118615104 @default.
- W89820973 hasConceptScore W89820973C120314980 @default.
- W89820973 hasConceptScore W89820973C127162648 @default.
- W89820973 hasConceptScore W89820973C127413603 @default.
- W89820973 hasConceptScore W89820973C130120984 @default.
- W89820973 hasConceptScore W89820973C140745168 @default.
- W89820973 hasConceptScore W89820973C151319957 @default.
- W89820973 hasConceptScore W89820973C154504017 @default.
- W89820973 hasConceptScore W89820973C154945302 @default.
- W89820973 hasConceptScore W89820973C184720557 @default.
- W89820973 hasConceptScore W89820973C193435613 @default.
- W89820973 hasConceptScore W89820973C199845137 @default.
- W89820973 hasConceptScore W89820973C2778562939 @default.
- W89820973 hasConceptScore W89820973C311688 @default.
- W89820973 hasConceptScore W89820973C31258907 @default.
- W89820973 hasConceptScore W89820973C33923547 @default.
- W89820973 hasConceptScore W89820973C38754835 @default.
- W89820973 hasConceptScore W89820973C41008148 @default.
- W89820973 hasConceptScore W89820973C53480672 @default.
- W89820973 hasConceptScore W89820973C62611344 @default.
- W89820973 hasConceptScore W89820973C63553672 @default.
- W89820973 hasConceptScore W89820973C66938386 @default.
- W89820973 hasConceptScore W89820973C80444323 @default.
- W89820973 hasLocation W898209731 @default.
- W89820973 hasOpenAccess W89820973 @default.
- W89820973 hasPrimaryLocation W898209731 @default.
- W89820973 hasRelatedWork W1598645236 @default.
- W89820973 hasRelatedWork W2001987202 @default.
- W89820973 hasRelatedWork W2059371135 @default.
- W89820973 hasRelatedWork W2070438068 @default.
- W89820973 hasRelatedWork W2120741723 @default.
- W89820973 hasRelatedWork W2175970924 @default.
- W89820973 hasRelatedWork W2340770048 @default.
- W89820973 hasRelatedWork W2396525075 @default.
- W89820973 hasRelatedWork W2534030543 @default.
- W89820973 hasRelatedWork W2594917573 @default.
- W89820973 hasRelatedWork W2730555760 @default.
- W89820973 hasRelatedWork W2952617708 @default.
- W89820973 hasRelatedWork W2953147964 @default.
- W89820973 hasRelatedWork W2974142667 @default.
- W89820973 hasRelatedWork W3006221030 @default.
- W89820973 hasRelatedWork W30207158 @default.
- W89820973 hasRelatedWork W3041403321 @default.
- W89820973 hasRelatedWork W3047787924 @default.
- W89820973 hasRelatedWork W3095576844 @default.
- W89820973 hasRelatedWork W3128350055 @default.
- W89820973 isParatext "false" @default.
- W89820973 isRetracted "false" @default.
- W89820973 magId "89820973" @default.
- W89820973 workType "article" @default.