Reliable broadcasting and secure distributing in channel networks

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

Volumn E81-A, Issue 5, 1998, Pages 796-806

  Bao, Feng ^a   Funyu, Yutaka ^b   Hamada, Yukihiro ^a,d   Igarashl, Yoshihide ^c  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

^b YOKOGAWA ELECTRIC CORPORATION   (Japan)

^c NATIONAL INSTITUTE OF TECHNOLOGY   (Japan)

^d GUNMA UNIVERSITY   (Japan)

Author keywords

Broadcasting; Distributing; Fault tolerance, independent; Networks; Secret sharing; Spanning trees

Indexed keywords

BROADCASTING; COMMUNICATION CHANNELS (INFORMATION THEORY); COMPUTATIONAL COMPLEXITY; DATA COMMUNICATION SYSTEMS; DISTRIBUTED COMPUTER SYSTEMS; EFFICIENCY; FAULT TOLERANT COMPUTER SYSTEMS; RELIABILITY; SECURITY OF DATA; TELECOMMUNICATION NETWORKS;

CHANNEL GRAPH; INDEPENDENT SPANNING TREES; SECURE MESSAGE DISTRIBUTION;

TREES (MATHEMATICS);

EID: 0032068719     PISSN: 09168508     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (33)

1. S.B. Akers, D. Harel, and B. Krishnamurthy, The star graph: An attractive alternative to the n-cube, Proc. International Conference on Parallel Processing (ICPP'87), pp.393-400i 1987.
2. N. Bagherzadeh, N. Nassif, and S. Latin", A routing and broadcasting scheme on faulty star graphs, IEEE Trans. Comput., vol.42, pp.1398-1403, 1993.
3. F. Bao, Y. Igarashi, and K. Katano, Broadcasting in hypercubes with randomly distributed Byzantine faults, Proc. 9th International Workshop on Distributed Algorithms (WDAG'95), Lecture Notes in Computer Science, vol.972, pp.215-229, 1995.
4. F. Bao, Y. Igarashi, and S. Ohring, Reliability of hypercubes for broadcasting with random faults, IEICE Trans. Inf. & Syst., vol.E79-D, pp.22-28, 1996.
5. F. Bao and Y. Igarashi, Reliable broadcasting in product networks with Byzantine faults, Proc. 26th Annual International Symposium on Fault-Tolerant Computing (FTCS'96), pp.262-271, 1996_.
6. F. Bao, Y. Igarashi, and S. Ohring, Reliable broadcasting in product networks with random faults, to appear in Discrete Applied Mathematics, 1998.
7. M. Ben-Or, S. Goldwasser, and A. Wigderson, Com-pleteness theorems for non-cryptographic fault-tolerant distributed computation, Proc. 20th Annual ACM Symposium on Theory of Computing (STOC'88), pp. 1-10, 1988.
8. M. Ben-Or, R.,Canetti, and O. Goldreich, Asynchronous secure computation, Proc. 25th Annual ACM Symposium on Theory of Computing (STOC'93), pp.52-61, 1993.
9. D.D. Blough and A. Pelc, Optimal communication in networks with randomly distributed Byzantine faults, Networks, vol.23, pp.691-701, 1993.
10. R.E. Blahut, Theory and Practice of Error Control Codes, Addison-Wesley, Reading Mass., 1983.
11. J. Cheriyan and S.N. Maheshwari, Finding nonseparating induced cycles and independent spanning trees in 3connected graphs, J. Algorithms, vol.9, pp.507-537, 1988.
12. D. Dolev, C. Dwork, O. Waarts, and M. Yung, Perfect secure message transmission, Proc. 31st Annual Symposium on Foundations of Computer Science (FOCS'90), pp.3645, 1990.
13. P. Fragopoulou and S.O. Akl, Optimal communication algorithms on star graphs using spanning tree constructions, Journal of Parallel and Distributed Computing, vol.24, pp.55-71, 1995.
14. M. Franklin, Z. Galil, and M. Yung, Eavesdropping Games: A graph-theoretic approach to privacy in distributed systems, Proc. 34th Annual Symposium on Foundations of Computer Science (FOCS'93), pp.670-679, 1993.
15. L. Gargano, A.A. Rescigno, and U. Vaccaro, Optimal communication in faulty star networks, Manuscript, 1995.
16. A. Huck, Independent trees in graphs, Manuscript, Institute für Mathematik, Universität Hannover, 1996.
17. Y. Hamada, F. Bao, A. Mei, and Y. Igarashi, Faulttolerant file transmission by Information Dispersal Algorithm in rotator graphs, Proc. 16th International Conference on Distributed Computing Systems (ICDCS'96), pp. 19-25, 1996.
18. S.M. Hedetniemi, S.T. Hedetniemi, and A.L. Liestman, A survey of gossiping and broadcasting in communication networks, Networks, vol.18, pp. 1240-1268, 1988.
19. Y. Iwasaki, Y. Kajiwara, K. Obokata, and Y. Igarashi, Independent spanning trees of chordal rings, The 3rd Annual International Computing and Combinatorics Conference (COCOON'97), Lecture Notes in Computer Science, vol.1276, pp.431-440, 1997.
20. A. Itai and M. Rodeh, The multi-tree approach to reliability in distributed networks, Information and Computation, vol.79, pp.43-59, 1988.
21. S. Khuller and B. Schieber, On independent spanning trees, Information Processing Letters, vol.42, pp.321-323, 1992.
22. H. Krawczyk, Distributed fingerprints and secure information dispersal, Proc. 12th Annual ACM Symposium on Principles of Distributed Computing (PODC'93), pp.207218, 1993.
23. A. Mei, F. Bao, Y. Hamada, and Y. Igarashi, Optimal time broadcasting in faulty star networks, Proc. 10th International Workshop on Distributed Algorithms (WDAG'96), Lecture Notes in Computer Science, vol. 1151, pp. 175-190, 1996.
24. V.E. Mendia and D. Sarkar, Optimal broadcasting on the star graph, IEEE Trans. Parallel and Distributed Systems, vol.3, pp.389-396, 1992.
25. K. Obokata, Y. Iwasaki, F. Bao, and Y. Igarashi, Independent spanning trees of product graphs and their construction, Proc. 22nd International Workshop on GraphTheoretic Concepts in Computer Science (WG'96), Lecture Notes in Computer Science, vol.1197, pp.338-351, 1996.
26. A. Pelc, Reliable communication in networks with Byzantine link failures, Networks, vol.22, pp.441-459, 1992.
27. A. Pelc, Fault-tolerant broadcasting and gossiping in communication networks, Technical Report, Department d'Informatique, Université du Quebec, 1995.
28. M.O. Rabin, Efficient dispersal of information for security, load balance, and fault tolerance, J. ACM, vol.36, pp.335-348, 1989.
29. P. Ramanathan and K.G. Shin, Reliable broadcasting in hypercube multiprocessors, IEEE Trans. Comput., vol.37, pp.1654-1657, 1988.
30. Y. Rouskov and P.K. Srimani, Fault diameter of star graphs, Information Processing Letters, vol.48, pp.243251, 1993.
31. A. Shamir, How to share a secret, Commun. ACM, vol.22, pp.612-613, 1979.
32. A. Youssef, Cartesian product networks, Proc. 1991 International Conference on Parallel Processing (ICPP'91), vol.1, pp.684-685, 1991.
33. A. Zehavi and A. Itai, Three tree-paths, J. Graph Theory, vol.13, pp.175-188, 1989.