Time-relaxed 1-fault tolerant broadcast networks

Brian Q. Rieksts, Jose Antonio Ventura

Research output: Contribution to journalArticle

Abstract

In a 1-fault tolerant minimal broadcast network, a node of a network, called the originator, has a message which is to be transmitted to all other nodes of the network in minimum time regardless of the failure of a single communication line. In some instances, it is advantageous to use time-relaxed broadcast networks that require slightly more than the minimum transmission time, but have sparser edge sets. This paper presents a general compounding algorithm to construct sparse, time-relaxed, 1-fault tolerant broadcast networks. In the algorithm, copies of a broadcast network without faults are interconnected with additional edges according to the structure of a 1-fault tolerant broadcast network with two special properties. Both the 1-fault tolerant broadcast network and the broadcast network without faults may be time-relaxed. Computational results show that the algorithm yields sparser networks by allowing additional time units.

Original languageEnglish (US)
Pages (from-to)335-353
Number of pages19
JournalParallel Processing Letters
Volume19
Issue number2
DOIs
StatePublished - Jun 1 2009

Fingerprint

Fault-tolerant
Broadcast
Communication
Fault
Vertex of a graph
Computational Results
Unit
Line

All Science Journal Classification (ASJC) codes

  • Software
  • Theoretical Computer Science
  • Hardware and Architecture

Cite this

@article{d2f210c27e7c41858741883adb4ae2f5,
title = "Time-relaxed 1-fault tolerant broadcast networks",
abstract = "In a 1-fault tolerant minimal broadcast network, a node of a network, called the originator, has a message which is to be transmitted to all other nodes of the network in minimum time regardless of the failure of a single communication line. In some instances, it is advantageous to use time-relaxed broadcast networks that require slightly more than the minimum transmission time, but have sparser edge sets. This paper presents a general compounding algorithm to construct sparse, time-relaxed, 1-fault tolerant broadcast networks. In the algorithm, copies of a broadcast network without faults are interconnected with additional edges according to the structure of a 1-fault tolerant broadcast network with two special properties. Both the 1-fault tolerant broadcast network and the broadcast network without faults may be time-relaxed. Computational results show that the algorithm yields sparser networks by allowing additional time units.",
author = "Rieksts, {Brian Q.} and Ventura, {Jose Antonio}",
year = "2009",
month = "6",
day = "1",
doi = "10.1142/S0129626409000250",
language = "English (US)",
volume = "19",
pages = "335--353",
journal = "Parallel Processing Letters",
issn = "0129-6264",
publisher = "World Scientific Publishing Co. Pte Ltd",
number = "2",

}

Time-relaxed 1-fault tolerant broadcast networks. / Rieksts, Brian Q.; Ventura, Jose Antonio.

In: Parallel Processing Letters, Vol. 19, No. 2, 01.06.2009, p. 335-353.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Time-relaxed 1-fault tolerant broadcast networks

AU - Rieksts, Brian Q.

AU - Ventura, Jose Antonio

PY - 2009/6/1

Y1 - 2009/6/1

N2 - In a 1-fault tolerant minimal broadcast network, a node of a network, called the originator, has a message which is to be transmitted to all other nodes of the network in minimum time regardless of the failure of a single communication line. In some instances, it is advantageous to use time-relaxed broadcast networks that require slightly more than the minimum transmission time, but have sparser edge sets. This paper presents a general compounding algorithm to construct sparse, time-relaxed, 1-fault tolerant broadcast networks. In the algorithm, copies of a broadcast network without faults are interconnected with additional edges according to the structure of a 1-fault tolerant broadcast network with two special properties. Both the 1-fault tolerant broadcast network and the broadcast network without faults may be time-relaxed. Computational results show that the algorithm yields sparser networks by allowing additional time units.

AB - In a 1-fault tolerant minimal broadcast network, a node of a network, called the originator, has a message which is to be transmitted to all other nodes of the network in minimum time regardless of the failure of a single communication line. In some instances, it is advantageous to use time-relaxed broadcast networks that require slightly more than the minimum transmission time, but have sparser edge sets. This paper presents a general compounding algorithm to construct sparse, time-relaxed, 1-fault tolerant broadcast networks. In the algorithm, copies of a broadcast network without faults are interconnected with additional edges according to the structure of a 1-fault tolerant broadcast network with two special properties. Both the 1-fault tolerant broadcast network and the broadcast network without faults may be time-relaxed. Computational results show that the algorithm yields sparser networks by allowing additional time units.

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

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

U2 - 10.1142/S0129626409000250

DO - 10.1142/S0129626409000250

M3 - Article

AN - SCOPUS:67650705499

VL - 19

SP - 335

EP - 353

JO - Parallel Processing Letters

JF - Parallel Processing Letters

SN - 0129-6264

IS - 2

ER -