OPTIMAL BROADCASTING IN TORI WITH DYNAMIC FAULTS
2002 ◽
Vol 12
(01)
◽
pp. 17-22
◽
We consider a broadcasting problem in the n-dimensional k-ary even torus in the shouting communication mode, i.e. any node of a network can inform all its neighbours in one time step. In addition, during any time step a number of links of the network can be faulty. Moreover the faults are dynamic. The problem is to determine the minimum broadcasting time if at most 2n - 1 faults are allowed in any step. In [4], it was shown that the broadcasting time is at most diameter+O(1), provided that k is limited by a polynomial of n. In our paper we drop this additional assumption and prove that the broadcasting can be always done in time diameter +2. The bound is the best possible.
1994 ◽
Vol 52
◽
pp. 922-923
Keyword(s):
1989 ◽
Vol 54
(3)
◽
pp. 403-421
◽
Keyword(s):
2019 ◽
Vol 13
(2)
◽
pp. 36-51
◽
2010 ◽
Vol 12
(2)
◽
pp. 97-109
Keyword(s):