{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T07:55:22Z","timestamp":1649145322721},"reference-count":12,"publisher":"World Scientific Pub Co Pte Lt","issue":"01","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Parallel Process. Lett."],"published-print":{"date-parts":[[2000,3]]},"abstract":"<jats:p> We consider the problem of broadcasting in a network G under the hypothesis that each vertex can inform in one unit of time all of its neighbours and that any number of message transmissions, less than the edge-connectivity of G, may fail during each time unit. In particular, we study broadcasting in the n-dimensional k-ary torus, a popular topology for link connections in communication networks. We prove that under the above strong fault-assumption, if k is even and polynomially limited in n, and n is sufficient large, broadcasting in the n-dimensional k-ary torus can be accomplished in time [Formula: see text], where [Formula: see text] is the diameter of the n-dimensional k-ary torus. <\/jats:p>","DOI":"10.1142\/s0129626400000068","type":"journal-article","created":{"date-parts":[[2003,4,22]],"date-time":"2003-04-22T07:43:44Z","timestamp":1050997424000},"page":"39-49","source":"Crossref","is-referenced-by-count":3,"title":["TIGHTER TIME BOUNDS ON BROADCASTING IN TORUS NETWORKS IN PRESENCE OF DYNAMIC FAULTS"],"prefix":"10.1142","volume":"10","author":[{"given":"GIANLUCA","family":"DE MARCO","sequence":"first","affiliation":[{"name":"Dipartimento di Informatica ed Applicazioni, Universit\u00e0 di Salerno, 84081 Baronissi (SA), Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"ADELE A.","family":"RESCIGNO","sequence":"additional","affiliation":[{"name":"Dipartimento di Informatica ed Applicazioni, Universit\u00e0 di Salerno, 84081 Baronissi (SA), Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2012,4,30]]},"reference":[{"key":"p_2","doi-asserted-by":"publisher","DOI":"10.1137\/0403004"},{"key":"p_4","doi-asserted-by":"publisher","DOI":"10.1109\/12.403718"},{"key":"p_5","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1097-0037(199607)27:4<309::AID-NET5>3.0.CO;2-K"},{"key":"p_8","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(98)00074-X"},{"key":"p_9","author":"Dobrev S.","journal-title":"Information Processing Letters, to appear."},{"key":"p_10","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(94)90180-5"},{"key":"p_11","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(91)90105-Q"},{"key":"p_12","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(94)90181-3"},{"key":"p_13","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230180406"},{"key":"p_15","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1097-0037(199607)27:4<257::AID-NET1>3.0.CO;2-F"},{"key":"p_17","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1097-0037(199610)28:3<143::AID-NET3>3.0.CO;2-N"},{"key":"p_18","doi-asserted-by":"publisher","DOI":"10.1137\/S0895480194278234"}],"container-title":["Parallel Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129626400000068","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T14:42:57Z","timestamp":1565102577000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129626400000068"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,3]]},"references-count":12,"journal-issue":{"issue":"01","published-online":{"date-parts":[[2012,4,30]]},"published-print":{"date-parts":[[2000,3]]}},"alternative-id":["10.1142\/S0129626400000068"],"URL":"https:\/\/doi.org\/10.1142\/s0129626400000068","relation":{},"ISSN":["0129-6264","1793-642X"],"issn-type":[{"value":"0129-6264","type":"print"},{"value":"1793-642X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2000,3]]}}}