Binary linear programming models for robust broadcasting in communication networks

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

Research output: Contribution to journalArticle

Abstract

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 c-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 c-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.

Original languageEnglish (US)
Pages (from-to)173-184
Number of pages12
JournalDiscrete Applied Mathematics
Volume204
DOIs
StatePublished - May 11 2016

Fingerprint

Broadcasting
Communication Networks
Linear programming
Broadcast
Telecommunication networks
Programming Model
Linear Model
Binary
Fault-tolerant
Information dissemination
Communication
Graph in graph theory
Mathematical models
Vertex of a graph
Upper bound
Information Dissemination
Line
Mathematical Model
Unknown
Unit

All Science Journal Classification (ASJC) codes

  • Discrete Mathematics and Combinatorics
  • Applied Mathematics

Cite this

McGarvey, Ronald G. ; Rieksts, Brian Q. ; Ventura, Jose Antonio ; Ahn, Namsu. / Binary linear programming models for robust broadcasting in communication networks. In: Discrete Applied Mathematics. 2016 ; Vol. 204. pp. 173-184.
@article{49a7caac77054307924739af289c2aee,
title = "Binary linear programming models for robust broadcasting in communication networks",
abstract = "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 c-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 c-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.",
author = "McGarvey, {Ronald G.} and Rieksts, {Brian Q.} and Ventura, {Jose Antonio} and Namsu Ahn",
year = "2016",
month = "5",
day = "11",
doi = "10.1016/j.dam.2015.11.008",
language = "English (US)",
volume = "204",
pages = "173--184",
journal = "Discrete Applied Mathematics",
issn = "0166-218X",
publisher = "Elsevier",

}

Binary linear programming models for robust broadcasting in communication networks. / McGarvey, Ronald G.; Rieksts, Brian Q.; Ventura, Jose Antonio; Ahn, Namsu.

In: Discrete Applied Mathematics, Vol. 204, 11.05.2016, p. 173-184.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Binary linear programming models for robust broadcasting in communication networks

AU - McGarvey, Ronald G.

AU - Rieksts, Brian Q.

AU - Ventura, Jose Antonio

AU - Ahn, Namsu

PY - 2016/5/11

Y1 - 2016/5/11

N2 - 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 c-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 c-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.

AB - 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 c-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 c-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.

UR - http://www.scopus.com/inward/record.url?scp=84949640401&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84949640401&partnerID=8YFLogxK

U2 - 10.1016/j.dam.2015.11.008

DO - 10.1016/j.dam.2015.11.008

M3 - Article

VL - 204

SP - 173

EP - 184

JO - Discrete Applied Mathematics

JF - Discrete Applied Mathematics

SN - 0166-218X

ER -