Matches in SemOpenAlex for { <https://semopenalex.org/work/W2736304968> ?p ?o ?g. }
Showing items 1 to 69 of
69
with 100 items per page.
- W2736304968 abstract "Consider a point-to-point network consisting of units and links which connect pairs of units. Suppose each of the knits possesses a unique message which has to be received by every other unit. This is called A related problem is that of census taking in which a particular unit has to receive the messages of every other unit. The units communicate by transmitting packets of a fixed size, so that only a bounded number of messages can be sent in a single transmission. We present heuristic algorithms for gossiping and census taking in general graphs. We describe algorithms for gossiping, using a minimum number of packets, in several prominent families of networks, e.g. trees, rings, etc. We also describe nearly optimal parallel algorithms for gossiping in such networks, when the packet sizes are bounded or unbounded.Next, we consider networks in which the units are only aware of their identities and the identities of their immediate neighbors. We present distributed algorithms for gossiping in such networks which are optimal in terms of the number of transmissions and the overall network utilization. We also describe a distributed algorithm for gossiping in the presence of faulty units which is asymptotically optimal. This algorithm is directly applicable to several other areas like leader election and distributed fault diagnosis.Finally, we study gossiping in broadcast (radio) networks. We discuss the complexity of the problem and present an efficient distributed algorithm for the same. In such networks we also study local gossiping. In this problem, each unit has to receive the messages of its immediate neighbors. Using extensions of well known results in graph theory, we design distributed algorithms for this problem." @default.
- W2736304968 created "2017-07-21" @default.
- W2736304968 creator A5049947890 @default.
- W2736304968 date "1990-01-01" @default.
- W2736304968 modified "2023-09-24" @default.
- W2736304968 title "Information dissemination functions in communication networks" @default.
- W2736304968 hasPublicationYear "1990" @default.
- W2736304968 type Work @default.
- W2736304968 sameAs 2736304968 @default.
- W2736304968 citedByCount "0" @default.
- W2736304968 crossrefType "journal-article" @default.
- W2736304968 hasAuthorship W2736304968A5049947890 @default.
- W2736304968 hasConcept C11413529 @default.
- W2736304968 hasConcept C120314980 @default.
- W2736304968 hasConcept C130120984 @default.
- W2736304968 hasConcept C134306372 @default.
- W2736304968 hasConcept C154945302 @default.
- W2736304968 hasConcept C15744967 @default.
- W2736304968 hasConcept C158379750 @default.
- W2736304968 hasConcept C173801870 @default.
- W2736304968 hasConcept C31258907 @default.
- W2736304968 hasConcept C33923547 @default.
- W2736304968 hasConcept C34388435 @default.
- W2736304968 hasConcept C41008148 @default.
- W2736304968 hasConcept C62989814 @default.
- W2736304968 hasConcept C77805123 @default.
- W2736304968 hasConcept C80444323 @default.
- W2736304968 hasConceptScore W2736304968C11413529 @default.
- W2736304968 hasConceptScore W2736304968C120314980 @default.
- W2736304968 hasConceptScore W2736304968C130120984 @default.
- W2736304968 hasConceptScore W2736304968C134306372 @default.
- W2736304968 hasConceptScore W2736304968C154945302 @default.
- W2736304968 hasConceptScore W2736304968C15744967 @default.
- W2736304968 hasConceptScore W2736304968C158379750 @default.
- W2736304968 hasConceptScore W2736304968C173801870 @default.
- W2736304968 hasConceptScore W2736304968C31258907 @default.
- W2736304968 hasConceptScore W2736304968C33923547 @default.
- W2736304968 hasConceptScore W2736304968C34388435 @default.
- W2736304968 hasConceptScore W2736304968C41008148 @default.
- W2736304968 hasConceptScore W2736304968C62989814 @default.
- W2736304968 hasConceptScore W2736304968C77805123 @default.
- W2736304968 hasConceptScore W2736304968C80444323 @default.
- W2736304968 hasLocation W27363049681 @default.
- W2736304968 hasOpenAccess W2736304968 @default.
- W2736304968 hasPrimaryLocation W27363049681 @default.
- W2736304968 hasRelatedWork W1498585861 @default.
- W2736304968 hasRelatedWork W1538663268 @default.
- W2736304968 hasRelatedWork W1721928313 @default.
- W2736304968 hasRelatedWork W1969699916 @default.
- W2736304968 hasRelatedWork W2013213272 @default.
- W2736304968 hasRelatedWork W2020756617 @default.
- W2736304968 hasRelatedWork W2051242703 @default.
- W2736304968 hasRelatedWork W2059170436 @default.
- W2736304968 hasRelatedWork W2120741723 @default.
- W2736304968 hasRelatedWork W2138021770 @default.
- W2736304968 hasRelatedWork W2140749668 @default.
- W2736304968 hasRelatedWork W2151697898 @default.
- W2736304968 hasRelatedWork W2171435520 @default.
- W2736304968 hasRelatedWork W2475290943 @default.
- W2736304968 hasRelatedWork W2739199819 @default.
- W2736304968 hasRelatedWork W2795589868 @default.
- W2736304968 hasRelatedWork W2805164547 @default.
- W2736304968 hasRelatedWork W2914186449 @default.
- W2736304968 hasRelatedWork W3005582769 @default.
- W2736304968 hasRelatedWork W309196457 @default.
- W2736304968 isParatext "false" @default.
- W2736304968 isRetracted "false" @default.
- W2736304968 magId "2736304968" @default.
- W2736304968 workType "article" @default.