Binary linear programming models for robust broadcasting in communication networks

DOI10.1016/J.DAM.2015.11.008MaRDI QIDQ266832zbMATH OpenOpenAlexFDO

Authors Ronald G. McGarvey, Brian Q. Rieksts, Jose A. Ventura, Namsu Ahn

Publication date 7 April 2016

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

Full work available at URL https://doi.org/10.1016/j.dam.2015.11.008

zbMATH Keywords

integer programmingbroadcastingcommunication networksfault-tolerant networks

Mathematics Subject Classification ID

Applications of graph theory (05C90) Extremal problems in graph theory (05C35) Small world graphs, complex networks (graph-theoretic aspects) (05C82)

Recommendations

• Weighted broadcast in linear radio networks
• Weighted Broadcast in Linear Radio Networks
• Broadcasting with linearly bounded transmission faults
• A linearly convergent method for broadcast data allocation
• Linearity and Solvability in Multicast Networks
• Network coding for line networks with broadcast channels
• A note on broadcasting with linearly bounded transmission faults in constant degree networks
• Optimal Linear Broadcast
• scientific article; zbMATH DE number 4045458
• Optimal deterministic broadcasting in known topology radio networks

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1885942 (Why is no real title available?)
• scientific article; zbMATH DE number 961881 (Why is no real title available?)
• A 1-relaxed minimum broadcast graph on 15 vertices.
• A survey of gossiping and broadcasting in communication networks
• An Efficient Vertex Addition Method for Broadcast Networks
• An algorithm for constructing minimal \(c\)-broadcast networks
• Antepenultimate broadcasting
• Bounded-call broadcasting
• Broadcast Networks of Bounded Degree
• Broadcasting in DMA-bound bounded degree graphs
• Compound constructions of broadcast networks
• Dissemination of information in communication networks. Broadcasting, gossiping, leader election, and fault-tolerance.
• Efficient construction of broadcast graphs
• Fault-tolerant broadcast graphs
• Fault-tolerant broadcasting and gossiping in communication networks
• Generalizations of broadcasting and gossiping
• Improved upper and lower bounds for \(k\)-broadcasting
• Information Dissemination in Trees
• Minimal broadcast networks
• Minimum Time Broadcast Networks Tolerating a Logarithmic Number of Faults
• Minimum \(k\)-broadcast graphs
• Minimum broadcast graphs
• More broadcast graphs
• New lower bounds on broadcast function
• On the construction of minimal broadcast networks
• On the monotonicity of the broadcast function
• On time-relaxed broadcasting networks
• Sparse broadcast graphs
• Tight Bounds on Mimimum Broadcast Networks
• Tight lower bounds on broadcast function for n = 24 and 25
• Tighter time bounds on fault-tolerant broadcasting and gossiping
• Time bounds on fault‐tolerant broadcasting
• Time-relaxed broadcasting in communication networks
• Upper bounds on the broadcast function using minimum dominating sets
• \(k\)-broadcasting in trees

Cited in

(2)

• Broadcast graphs using new dimensional broadcast schemes for Knödel graphs
• Strong bounds and exact solutions to the minimum broadcast time problem

This page was built for publication: Binary linear programming models for robust broadcasting in communication networks

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