{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T07:01:26Z","timestamp":1648537286468},"reference-count":16,"publisher":"World Scientific Pub Co Pte Lt","issue":"02","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Parallel Process. Lett."],"published-print":{"date-parts":[[2009,6]]},"abstract":"<jats:p> 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. <\/jats:p>","DOI":"10.1142\/s0129626409000250","type":"journal-article","created":{"date-parts":[[2009,6,15]],"date-time":"2009-06-15T04:10:35Z","timestamp":1245039035000},"page":"335-353","source":"Crossref","is-referenced-by-count":0,"title":["TIME-RELAXED 1-FAULT TOLERANT BROADCAST NETWORKS"],"prefix":"10.1142","volume":"19","author":[{"given":"BRIAN Q.","family":"RIEKSTS","sequence":"first","affiliation":[{"name":"Institute for Defense Analyses, 4850 Mark Center Drive, Alexandria, VA 22311, USA"}]},{"given":"JOSE A.","family":"VENTURA","sequence":"additional","affiliation":[{"name":"The Harold and Inge Marcus Department of Industrial &amp; Manufacturing Engineering, The Pennsylvania State University, University Park, PA 16802, USA"}]}],"member":"219","published-online":{"date-parts":[[2011,11,21]]},"reference":[{"key":"rf1","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1097-0037(199607)27:4<293::AID-NET4>3.0.CO;2-B"},{"key":"rf2","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230260302"},{"key":"rf3","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(92)90226-Z"},{"key":"rf4","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(99)00043-8"},{"key":"rf5","doi-asserted-by":"publisher","DOI":"10.1142\/S0129626499000086"},{"key":"rf6","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230090404"},{"key":"rf7","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(79)90022-0"},{"key":"rf8","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230220505"},{"key":"rf9","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(94)90181-3"},{"key":"rf10","first-page":"637","volume":"19","author":"Gargano L.","journal-title":"Networks"},{"key":"rf12","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230150203"},{"key":"rf13","doi-asserted-by":"publisher","DOI":"10.1142\/S0217595907001450"},{"key":"rf14","volume-title":"User's Manual for LINGO","author":"Schrage L.","year":"1991"},{"key":"rf15","first-page":"263","volume":"25","author":"Shastri A.","journal-title":"Discrete Applied Mathematics"},{"key":"rf16","doi-asserted-by":"publisher","DOI":"10.1137\/0210052"},{"key":"rf18","doi-asserted-by":"publisher","DOI":"10.1007\/BF02110308"}],"container-title":["Parallel Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129626409000250","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T16:16:31Z","timestamp":1565108191000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129626409000250"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,6]]},"references-count":16,"journal-issue":{"issue":"02","published-online":{"date-parts":[[2011,11,21]]},"published-print":{"date-parts":[[2009,6]]}},"alternative-id":["10.1142\/S0129626409000250"],"URL":"https:\/\/doi.org\/10.1142\/s0129626409000250","relation":{},"ISSN":["0129-6264","1793-642X"],"issn-type":[{"value":"0129-6264","type":"print"},{"value":"1793-642X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,6]]}}}