Matches in SemOpenAlex for { <https://semopenalex.org/work/W1507197077> ?p ?o ?g. }
Showing items 1 to 77 of
77
with 100 items per page.
- W1507197077 endingPage "324" @default.
- W1507197077 startingPage "315" @default.
- W1507197077 abstract "Distributed algorithms in dynamic networks often employ communication patterns whose purpose is to disseminate information among the participants. Gossiping is one form of such communication pattern. In dynamic settings, the set of participants can change substantially as new participants join, and as failures and voluntary departures remove those who have joined previously. A natural question for such settings is: how soon can newly joined nodes discover each other by means of gossiping? This paper abstracts and studies the join problem for dynamic systems that use all-to-all gossip. The problem is studied in terms of join-connectivity graphs where vertices represent the participants and where each edge represents one participant's knowledge about another. Ideally, such a graph has diameter one, i.e., all participants know each other. The diameter can grow as new participants join, and as failures remove edges from the graph. Gossip helps participants discover one another, decreasing the diameter. The results describe the lower and upper bounds on the number of communication rounds such that the participants who have previously joined discover one another, under a variety of assumptions about the joining and failures. For example, in the case when new participants join at multiple participants and participants may crash, the number of rounds cannot be bounded. In the more benign cases when the failures can be controlled or when new participants join at only one participant, the bound on rounds is shown to be logarithmic in the diameter of the initial configuration." @default.
- W1507197077 created "2016-06-24" @default.
- W1507197077 creator A5035678865 @default.
- W1507197077 creator A5071743394 @default.
- W1507197077 creator A5080318892 @default.
- W1507197077 date "2004-01-01" @default.
- W1507197077 modified "2023-09-23" @default.
- W1507197077 title "The Join problem in dynamic network algorithms" @default.
- W1507197077 hasPublicationYear "2004" @default.
- W1507197077 type Work @default.
- W1507197077 sameAs 1507197077 @default.
- W1507197077 citedByCount "0" @default.
- W1507197077 crossrefType "journal-article" @default.
- W1507197077 hasAuthorship W1507197077A5035678865 @default.
- W1507197077 hasAuthorship W1507197077A5071743394 @default.
- W1507197077 hasAuthorship W1507197077A5080318892 @default.
- W1507197077 hasConcept C11413529 @default.
- W1507197077 hasConcept C114614502 @default.
- W1507197077 hasConcept C132525143 @default.
- W1507197077 hasConcept C134306372 @default.
- W1507197077 hasConcept C154945302 @default.
- W1507197077 hasConcept C15744967 @default.
- W1507197077 hasConcept C162307627 @default.
- W1507197077 hasConcept C177264268 @default.
- W1507197077 hasConcept C199360897 @default.
- W1507197077 hasConcept C2776124973 @default.
- W1507197077 hasConcept C33923547 @default.
- W1507197077 hasConcept C34388435 @default.
- W1507197077 hasConcept C41008148 @default.
- W1507197077 hasConcept C62989814 @default.
- W1507197077 hasConcept C77553402 @default.
- W1507197077 hasConcept C77805123 @default.
- W1507197077 hasConcept C80444323 @default.
- W1507197077 hasConceptScore W1507197077C11413529 @default.
- W1507197077 hasConceptScore W1507197077C114614502 @default.
- W1507197077 hasConceptScore W1507197077C132525143 @default.
- W1507197077 hasConceptScore W1507197077C134306372 @default.
- W1507197077 hasConceptScore W1507197077C154945302 @default.
- W1507197077 hasConceptScore W1507197077C15744967 @default.
- W1507197077 hasConceptScore W1507197077C162307627 @default.
- W1507197077 hasConceptScore W1507197077C177264268 @default.
- W1507197077 hasConceptScore W1507197077C199360897 @default.
- W1507197077 hasConceptScore W1507197077C2776124973 @default.
- W1507197077 hasConceptScore W1507197077C33923547 @default.
- W1507197077 hasConceptScore W1507197077C34388435 @default.
- W1507197077 hasConceptScore W1507197077C41008148 @default.
- W1507197077 hasConceptScore W1507197077C62989814 @default.
- W1507197077 hasConceptScore W1507197077C77553402 @default.
- W1507197077 hasConceptScore W1507197077C77805123 @default.
- W1507197077 hasConceptScore W1507197077C80444323 @default.
- W1507197077 hasOpenAccess W1507197077 @default.
- W1507197077 hasRelatedWork W1494169227 @default.
- W1507197077 hasRelatedWork W1543479703 @default.
- W1507197077 hasRelatedWork W1570957576 @default.
- W1507197077 hasRelatedWork W1584706172 @default.
- W1507197077 hasRelatedWork W2031130096 @default.
- W1507197077 hasRelatedWork W2068322213 @default.
- W1507197077 hasRelatedWork W2089845008 @default.
- W1507197077 hasRelatedWork W2151697898 @default.
- W1507197077 hasRelatedWork W2474402244 @default.
- W1507197077 hasRelatedWork W2583780251 @default.
- W1507197077 hasRelatedWork W2736304968 @default.
- W1507197077 hasRelatedWork W2795812506 @default.
- W1507197077 hasRelatedWork W2949946167 @default.
- W1507197077 hasRelatedWork W2951879729 @default.
- W1507197077 hasRelatedWork W2952721294 @default.
- W1507197077 hasRelatedWork W2964017981 @default.
- W1507197077 hasRelatedWork W2971982307 @default.
- W1507197077 hasRelatedWork W3046743058 @default.
- W1507197077 hasRelatedWork W3101365813 @default.
- W1507197077 hasRelatedWork W2328251671 @default.
- W1507197077 isParatext "false" @default.
- W1507197077 isRetracted "false" @default.
- W1507197077 magId "1507197077" @default.
- W1507197077 workType "article" @default.