A compounding algorithm for 1-fault tolerant broadcast networks

A compounding algorithm for 1-fault tolerant broadcast networks

0.00 Avg rating0 Votes
Article ID: iaor20083111
Country: Singapore
Volume: 24
Issue: 5
Start Page Number: 687
End Page Number: 713
Publication Date: Oct 2007
Journal: Asia-Pacific Journal of Operational Research
Authors: ,
Keywords: networks
Abstract:

This theoretical paper presents a new construction algorithm for sparse 1-fault tolerant minimal broadcast networks (1-FTMBNs). To construct a large 1-FTMBN with the algorithm, identical nodes in copies of a broadcast network that is not fault tolerant are connected according to the edge structures of two known 1-FTMBNs with a special property. In most cases, computational results with this algorithm produce the best-known bounds on the cardinalities of the edge sets of the sparsest 1-FTMBNs with an odd number of nodes.

Reviews

Required fields are marked *. Your email address will not be published.