A survey of gossiping and broadcasting in communication networks
From MaRDI portal
Publication:3795460
DOI10.1002/NET.3230180406zbMath0649.90047OpenAlexW2058322021MaRDI QIDQ3795460
Stephen T. Hedetniemi, Sandra M. Hedetniemi, Arthur L. Liestman
Publication date: 1988
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.3230180406
Related Items (only showing first 100 items - show all)
Orientations of digraphs almost preserving diameter ⋮ Binary linear programming models for robust broadcasting in communication networks ⋮ Broadcasting multiple messages in simultaneous send/receive systems ⋮ Hierarchical broadcast networks ⋮ On optimal broadcasting in faulty hypercubes ⋮ Fast gossiping with short unreliable messages ⋮ Broadcasting in \(m\)-dimensional grid graphs with a given neighborhood template ⋮ Optimal algorithms for dissemination of information in generalized communication modes ⋮ Methods and problems of communication in usual networks ⋮ Reliable broadcasting ⋮ Broadcasting on recursively decomposable Cayley graphs ⋮ Broadcasting in butterfly and deBruijn networks ⋮ Minimum \(k\)-broadcast graphs ⋮ Traffic-light scheduling on the grid ⋮ A minimum broadcast graph on 63 vertices ⋮ Broadcasting on \([0,L\)] ⋮ Broadcasting multiple messages in a grid ⋮ Optimal scheduling of peer-to-peer file dissemination ⋮ Note on optimal gossiping in some weak-connected graphs ⋮ Broadcasting multiple messages in the 1-in port model in optimal time ⋮ On the number of broadcast schemes in networks ⋮ On the communication complexity of polling ⋮ The exact gossiping problem ⋮ The structure of information networks ⋮ Robust gossiping with an application to consensus ⋮ An online distributed gossiping protocol for mobile networks ⋮ Periodic gossiping in back-to-back trees ⋮ Better bounds for perpetual gossiping ⋮ A tight upper bound on acquaintance time of graphs ⋮ \(k\)-path partitions in trees ⋮ Optimal odd gossiping ⋮ Broadcast and gossip in line-communication mode ⋮ A generalized broadcasting schema for the mesh structures ⋮ A note on the acquaintance time of random graphs ⋮ Reliable broadcasting in product networks ⋮ Spanning subgraphs with applications to communication of a subclass of the Cayley-graph-based networks ⋮ Minimum time broadcast in faulty star networks ⋮ Broadcasting with linearly bounded transmission faults ⋮ The complexity of broadcasting in planar and decomposable graphs ⋮ Broadcasting and gossiping on de Bruijn, shuffle-exchange and similar networks ⋮ All-to-all broadcast problem of some classes of graphs under the half duplex all-port model ⋮ A PTAS for geometric 2-FTP ⋮ On the complexity of the shortest-path broadcast problem ⋮ All-to-all broadcast problems on Cartesian product graphs ⋮ Deterministic broadcasting time with partial knowledge of the network. ⋮ Messy broadcasting - decentralized broadcast schemes with limited knowledge ⋮ Knowledge-based multi-criteria optimization to support indoor positioning ⋮ Gossiping and routing in second-kind Frobenius graphs ⋮ Spreading of messages in random graphs ⋮ Optimal broadcast for fully connected processor-node networks ⋮ Parallel algorithms for gossiping by mail ⋮ The epistemic gossip problem ⋮ Algorithms for graphs with small octopus ⋮ Upper bounds on the broadcast function using minimum dominating sets ⋮ Gossiping and broadcasting versus computing functions in networks. ⋮ Dynamic faults have small effect on broadcasting in hypercubes. ⋮ A survey on Knödel graphs. ⋮ On linear-time data dissemination in dynamic rooted trees ⋮ The worst case behavior of randomized gossip protocols ⋮ A polynomial algorithm to compute the minimum degree spanning trees of directed acyclic graphs with applications to the broadcast problem ⋮ Parsimonious flooding in dynamic graphs ⋮ Broadcasting in complete networks with faulty nodes using unreliable calls ⋮ Rooted level-disjoint partitions of Cartesian products ⋮ The minimum broadcast time problem for several processor networks ⋮ Epistemic protocols for dynamic gossip ⋮ Sparse broadcast graphs ⋮ Odd gossiping ⋮ Efficient broadcast trees for weighted vertices ⋮ Minimum multiple originator broadcast graphs ⋮ Optimal total exchange for a 3-D torus of processors ⋮ Minimum broadcast time is NP-complete for 3-regular planar graphs and deadline 2 ⋮ Broadcasting in DMA-bound bounded degree graphs ⋮ Minimum broadcast digraphs ⋮ Set to set broadcasting in communication networks ⋮ Broadcasting from multiple originators ⋮ Fast information sharing in a complete network ⋮ Broadcasting on networks of workstations ⋮ On maximal instances for the original syntenic distance ⋮ Cooperative TSP ⋮ Rapid almost-complete broadcasting in faulty networks ⋮ Optimal algorithms for dissemination of information in some interconnection networks ⋮ Perfect broadcasting in unlabeled networks ⋮ Optimal sequential gossiping by short messages ⋮ An approximation algorithm and dynamic programming for reduction in heterogeneous environments ⋮ Spreading messages ⋮ On broadcasting in unicyclic graphs ⋮ Minimizing broadcast costs under edge reductions in tree networks ⋮ On the structure of minimum broadcast digraphs ⋮ Efficient collective communciation in optical networks ⋮ The generalized hierarchical product of graphs ⋮ Cayley graphs as classifiers for data mining: the influence of asymmetries ⋮ Symmetric flows and broadcasting in hypercubes ⋮ Compound constructions of broadcast networks ⋮ Optimal point-to-point broadcast algorithms via lopsided trees ⋮ Fast gossiping on square mesh computers ⋮ Verifiable broadcasting and gossiping in communication networks ⋮ On the construction of regular minimal broadcast digraphs ⋮ Quick gossiping by telegraphs ⋮ Graph theoretical issues in computer networks ⋮ Hierarchical broadcast and gossip networks
Cites Work
This page was built for publication: A survey of gossiping and broadcasting in communication networks
