Optimal multiple message broadcasting in telephone-like communication systems

DOI10.1016/S0166-218X(99)00155-9zbMath0986.90008MaRDI QIDQ1962017

Baruch Schieber, Shlomo Kipnis, Amotz Bar-Noy

Publication date: 30 January 2000

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

communication networksdistributed parallel computersbroadcastingtelephone systemsmultiple messagessimultaneous send/receive

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Network design and communication in computer systems (68M10)

Related Items (11)

Optimal scheduling of peer-to-peer file dissemination ⋮ Broadcasting multiple messages in the 1-in port model in optimal time ⋮ Broadcasting a file in a communication network ⋮ All-to-all broadcast problem of some classes of graphs under the half duplex all-port model ⋮ Time-Optimal Broadcasting of Multiple Messages in 1-in Port Model ⋮ All-to-all broadcast problems on Cartesian product graphs ⋮ Optimal broadcast for fully connected processor-node networks ⋮ On linear-time data dissemination in dynamic rooted trees ⋮ New upper bound on \(m\)-time-relaxed \(k\)-broadcast graphs ⋮ Modelling simultaneous broadcasting by level-disjoint partitions ⋮ Optimal point-to-point broadcast algorithms via lopsided trees

Cites Work

• Unnamed Item
• Efficient parallel communication with the nCUBE 2S processor
• Broadcasting multiple messages in simultaneous send/receive systems
• A survey of gossiping and broadcasting in communication networks
• Broadcast Time in Communication Networks
• Designing broadcasting algorithms in the postal model for message-passing systems
• Multiple message broadcasting in the postal model
• Multiple message broadcasting in communication networks

This page was built for publication: Optimal multiple message broadcasting in telephone-like communication systems