Fault-tolerant routing and multicasting in butterfly networks

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Fault-tolerant routing and multicasting in butterfly networks

Full text

Pdf (482 KB)

Source

Symposium on Applied Computing archive
Proceedings of the 1999 ACM symposium on Applied computing table of contents

San Antonio, Texas, United States

Pages: 455 - 460

Year of Publication: 1999

ISBN:1-58113-086-4

Authors

Feng Cao	Cisco Systems, Inc., 170 West Tasman Drive, San Jose, CA
Ding-Zhu Du	Department of Computer Science, University of Minnesota, Minneapolis, MN

Sponsors

SIGADA: ACM Special Interest Group on Ada Programming Language
SIGCUE: ACM Special Interest Group on Computer Uses In Education
SIGAPP: ACM Special Interest Group on Applied Computing
SIGBIO: ACM Special Interest Group on Biomedical Computing

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 1, Downloads (12 Months): 6, Citation Count: 0

Additional Information:

references index terms collaborative colleagues peer to peer

Tools and Actions:	Review this Article Save this Article to a Binder Display Formats: BibTex EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/298151.298420 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	B. Bollabos, Extremal Graph Theory, Academic Press, London, (1978) 488.
	2	Feng Cao , Ding-Zhu Du , D. Frank Hsu , Shang-hua Teng, Fault Tolerance Properties of Pyramid Networks, IEEE Transactions on Computers, v.48 n.1, p.88-93, January 1999 [doi>10.1109/12.743415 ]
	3	Feng Cao, Reliability Analysis of Partitioned Optical Passive Stars Networks, Proceedings of the 22nd Annual IEEE Conference on Local Computer Networks, p.470-475, November 02-05, 1997
	4	F. Cao, Reliable Routing in Circulant Networks, Proceedings of the 6th International Conference on Telecommunication System, Modeling and Analysis (ATSMA '98), March 1998, Nashville, USA.
	5	D. Z. Du , F. K. Hwang, Generalized de Bruijn digraphs, Networks, v.18 n.1, p.27-38, Spring 1988 [doi>10.1002/net.3230180105]
	6	D. Z. Du , D. F. Hsu , F. K. Hwang , X. M. Zhang, The Hamiltonian property of generalized de Bruijn digraphs, Journal of Combinatorial Theory Series B, v.52 n.1, p.1-8, May 1991 [doi>10.1016/0095-8956(91)90084-W]
	7	Abdol-Hossein Esfahanian , S. L. Hakimi, Fault-tolerant routing in DeBruijn communication networks, IEEE Transactions on Computers, v.34 n.9, p.777-788, Sept. 1985 [doi>10.1109/TC.1985.1676633]
	8	D.F. Hsu, On container width and length in graphs, groups and networks, IEICE Trans. Fundamentals of Electronics, Communications and Computer Sciences, vol. E-77A (1994) 668-680.
	9	D.F. Hsu and Y.D. Lyuu, A graph theoretical study of transmission delay and fault tolerance, Proceeding of $th ISSM Inter. Conf. on Parallel and Distributed Computing and System, (1991) 20-24.
	10	M. Imase, T. Soneoka and K. Okada, Faulttolerant processor interconnection, System and Comput., vol. C-30 (1986) 21-30.
	11	M. Imase, T. Soneoka and K. Okada, Connectivity of regular directed graphs with small dimeters, IEEE Trans. Comput., vol. C-34 (1985) 267-273.
	12	M. S. Krishnamoorthy , b. Krishnamurthy, Fault diameter of interconnection networks, Computers and Mathematics with Applications, v.13 n.5-6, p.577-582, 1987
	13	F. Thomson Leighton, Introduction to parallel algorithms and architectures: array, trees, hypercubes, Morgan Kaufmann Publishers Inc., San Francisco, CA, 1991
	14	D.K. Pradhan and S.M. Reddy, A fault-tolerant communication architecture for distributed systems, IEEE Trans. Comput., vol. C-31, (1982) 863-870.