dc.contributor.author | McGarvey, Ronald G | eng |
dc.contributor.author | Rieksts, Brian Q. | eng |
dc.contributor.author | Ventura, José A. | eng |
dc.contributor.author | Ahn, Namsu | eng |
dc.date.issued | 2015 | eng |
dc.description.abstract | Output files showing optimal network configurations. Abstract from related article: Broadcasting is an information dissemination process in communication networks whereby a message, originated at any node of a network, is transmitted to all other nodes of the network. In c-broadcasting, each node having the message completes up to c transmissions to its neighbors over the communication lines in one time unit. In a k-fault tolerant broadcast network, the broadcasting process can be accomplished even if k communication lines fail. This paper presents innovative binary linear programming formulations to construct c-broadcast graphs, k-fault-tolerant broadcast graphs, and their time-relaxed versions. The proposed mathematical models are used to generate eight previously unknown minimum c-broadcast graphs, new upper bounds for eleven other instances of the c-broadcast problem, and over 30 minimum k-fault-tolerant c-broadcast graphs. The paper also provides a construction method to produce an upper bound for an infinite family of k-fault-tolerant c-broadcast graphs. | eng |
dc.identifier.uri | https://hdl.handle.net/10355/46234 | eng |
dc.identifier.uri | https://doi.org/10.32469/10355/46234 | eng |
dc.language | English | eng |
dc.relation | Related article published in: Discrete Applied Mathematics, Volume 204, 11 May 2016, Pages 173-184. | eng |
dc.relation.uri | https://doi.org/10.1016/j.dam.2015.11.008 | eng |
dc.subject | Integer programming ; Communication networks ; Broadcasting ; Fault-tolerant networks | eng |
dc.title | Binary linear programming models for robust broadcasting in communication networks : [data] | eng |
dc.type | Dataset | eng |