A Scheme on Fault-Tolerant Broadcasting for Directed Communication Network with Time Bounds

Article Preview

Abstract:

How to transmit quickly and accurately the messages to all nodes, this is the basic problem which urgently needs be resolved in the network. In this paper, the problem on fault-tolerant broadcasting for the directed communication network is studied. First the directed communication network is mapped to the digraph based on graph theory. Then a scheme on fault-tolerant broadcasting is obtained for directed communication network, and its time bounds are given.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

398-402

Citation:

Online since:

December 2012

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2013 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] A. L. Liestman, Fault-tolerant broadcast graphs[J], Networks, 1985, 15(2): 159-171.

DOI: 10.1002/net.3230150203

Google Scholar

[2] L. Gargano, Tighter time bounds on fault-tolerant broadcasting and gossiping[J], Networks, 1992, 22(5): 469-486.

DOI: 10.1002/net.3230220505

Google Scholar

[3] D. Peleg & A. A. Schaffer, Time bounds on fault-tolerant broadcasting networks[J], Networks, 1989, 19(4): 803-822.

DOI: 10.1002/net.3230190706

Google Scholar

[4] J.A. Bondy and U.S. R Murty, Graph Theory with Applications[M], The Macmllian press Itd, London (1976).

Google Scholar

[5] Zhu xiao feng, Study of broadcasting-time on publication and communication in networks[J], Journal of Beijing Institute of Graphic Communication, 2004, 12: (1)3-6. 3-6.

Google Scholar