Broadcast Time in Communication Networks

DOI10.1137/0139032MaRDI QIDQ3888991zbMATH OpenOpenAlexFDO

Authors Arthur M. Farley

Publication date 1980

Published in SIAM Journal on Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0139032

zbMATH Keywords

broadcastingcommunication networksegmentation of messages

Mathematics Subject Classification ID

Communication, information (94A99) Applications of graph theory to circuits and networks (94C15)

Cited in

(16)

• Extremal broadcasting problems
• Minimizing broadcast costs under edge reductions in tree 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
• The broadcast median problem in heterogeneous postal model
• Optimal multiple message broadcasting in telephone-like communication systems
• Time-optimal broadcasting of multiple messages in 1-in port model
• Broadcasting in Trees with Multiple Originators
• All-to-all broadcast problem of some classes of graphs under the half duplex all-port model
• Performance tradeoffs in structured peer to peer streaming
• Multicommodity Multicast, Wireless and Fast
• Tighter bounds on the minimum broadcast time
• Broadcasting two messages in wheel graphs
• Optimal scheduling of peer-to-peer file dissemination
• All-to-all broadcast problems on Cartesian product graphs

This page was built for publication: Broadcast Time in Communication Networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3888991)