Optimal multiple message broadcasting in telephone-like communication systems
From MaRDI portal
DOI10.1016/S0166-218X(99)00155-9zbMATH Open0986.90008MaRDI QIDQ1962017FDOQ1962017
Baruch Schieber, Shlomo Kipnis, Amotz Bar-Noy
Publication date: 30 January 2000
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Recommendations
- An optimal algorithm for broadcasting multiple messages in trees
- Multiple message broadcasting in the postal model
- Multi-messages broadcasting in simultaneously send/receive communication networks
- Broadcasting multiple messages in simultaneous send/receive systems
- scientific article; zbMATH DE number 1156592
broadcastingcommunication networkstelephone systemsdistributed parallel computersmultiple messagessimultaneous send/receive
Communication networks in operations research (90B18) Network design and communication in computer systems (68M10)
Cites Work
- A survey of gossiping and broadcasting in communication networks
- Broadcast Time in Communication Networks
- Broadcasting multiple messages in simultaneous send/receive systems
- Designing broadcasting algorithms in the postal model for message-passing systems
- Multiple message broadcasting in communication networks
- Title not available (Why is that?)
- Multiple message broadcasting in the postal model
- Efficient parallel communication with the nCUBE 2S processor
Cited In (18)
- Joint transmission of vocal messages and data via digital channels of wideband communication networks: efficiency estimation algorithms
- On linear-time data dissemination in dynamic rooted trees
- All-to-all broadcast problem of some classes of graphs under the half duplex all-port model
- Designing broadcasting algorithms in the postal model for message-passing systems
- Optimal scheduling of peer-to-peer file dissemination
- Optimal broadcast for fully connected processor-node networks
- Optimal point-to-point broadcast algorithms via lopsided trees
- Modelling simultaneous broadcasting by level-disjoint partitions
- Three messages are not optimal in worst case interactive communication
- Broadcasting multiple messages in simultaneous send/receive systems
- Efficient Information Exchange in the Random Phone-Call Model
- All-to-all broadcast problems on Cartesian product graphs
- Time-Optimal Broadcasting of Multiple Messages in 1-in Port Model
- Broadcasting a file in a communication network
- Title not available (Why is that?)
- New upper bound on \(m\)-time-relaxed \(k\)-broadcast graphs
- Broadcasting multiple messages in the 1-in port model in optimal time
- Multi-messages broadcasting in simultaneously send/receive communication networks
This page was built for publication: Optimal multiple message broadcasting in telephone-like communication systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1962017)
