Affiliation:
1. Beijing Institute of Graphic Communication
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.
Publisher
Trans Tech Publications, Ltd.
Reference5 articles.
1. A. L. Liestman, Fault-tolerant broadcast graphs[J], Networks, 1985, 15(2): 159-171.
2. L. Gargano, Tighter time bounds on fault-tolerant broadcasting and gossiping[J], Networks, 1992, 22(5): 469-486.
3. D. Peleg & A. A. Schaffer, Time bounds on fault-tolerant broadcasting networks[J], Networks, 1989, 19(4): 803-822.
4. J.A. Bondy and U.S. R Murty, Graph Theory with Applications[M], The Macmllian press Itd, London (1976).
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.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献