Multiple message broadcasting in communication networks
From MaRDI portal
Recommendations
Cited in
(29)- Broadcasting in the butterfly network
- Set to set broadcasting in communication networks
- Broadcasting multiple messages in simultaneous send/receive systems
- Broadcasting multiple messages in a grid
- Broadcasting multiple messages in the 1-in port model in optimal time
- Sparse hypercube -- a minimal \(k\)-line broadcast graph.
- Optimal multiple message broadcasting in telephone-like communication systems
- An optimal algorithm for broadcasting multiple messages in trees
- Broadcasting a file in a communication network
- An efficient network-wide broadcasting based on hop-limited shortest-path trees
- Effect of Message Transmission Path Diversity on Status Age
- k-port line broadcasting in trees
- Multi-messages broadcasting in simultaneously send/receive communication networks
- scientific article; zbMATH DE number 1735665 (Why is no real title available?)
- Multiple message broadcasting in the postal model
- Optimal broadcast for fully connected processor-node networks
- Message Multicasting in Heterogeneous Networks
- Broadcast transmission to prioritizing receivers
- Broadcasting in conflict-aware multi-channel networks
- scientific article; zbMATH DE number 1390069 (Why is no real title available?)
- Handling message semantics with Generic Broadcast protocols
- ON SOLVING MULTIMESSAGE MULTICASTING PROBLEMS
- scientific article; zbMATH DE number 975322 (Why is no real title available?)
- Minimal-Time k-Line Broadcasting
- Minimum multiple message broadcast graphs
- Variants of spreading messages
- New upper bound on m-time-relaxed k-broadcast graphs
- Broadcasting two messages in wheel graphs
- Optimal scheduling of peer-to-peer file dissemination
This page was built for publication: Multiple message broadcasting in communication networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4894862)
