Fault tolerance properties of pyramid networks

IEEE Transactions on Computers

Volumn 48, Issue 1, 1999, Pages 88-93

  Cao, Feng ^a,b   Du, Ding Zhu ^c   Hsu, D Frank ^a,d   Teng, Shang Hua ^c  

^a IEEE   (United States)

^b CISCO SYSTEMS   (United States)

^c University of Minnesota   (United States)

^d FORDHAM UNIVERSITY   (United States)

Author keywords

Fault tolerant routing; Line connectivity; Parallel computing; Pyramid

Indexed keywords

COMPUTER ARCHITECTURE; FAULT TOLERANT COMPUTER SYSTEMS; INTERCONNECTION NETWORKS; PARALLEL ALGORITHMS; POLYNOMIALS;

FAULT-TOLERANT ROUTING; PYRAMID NETWORKS;

PARALLEL PROCESSING SYSTEMS;

EID: 0032759894     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/12.743415     Document Type: Article

References (18)

1. F. Cao, "Reliability Analysis of Partitioned Optical Passive Stars Networks," Proc. 22nd IEEE Local Computer Networks (LCN '97), Minneapolis, July 1997.
2. F. Cao, D.Z. Du, and D.F. Hsu, "Fault-Tolerant Routing in Butterfly Networks," Technical Report TR 95-073, Dept. of Computer Science, Univ. of Minnesota, 1995.
3. F. Cao, D.Z. Du, and D.F Hsu, "On the Fault-Tolerant Diameters and Containers of Large Bipartite Digraphs," Proc. Int'l Symp. Combinatorial Algorithms, Tianjin, China, June 1996.
4. S.E. Deering, "Multicast Routing in a Datagram Internetwork," STAN-CS-92-1415, Stanford Univ., Palo Alto, Calif.
5. D.Z. Du, D.F. Hsu, and Y.D. Lyuu, "On the Diameter Vulnerability of Kautz Digraphs," Discrete Mathematics, to appear.
6. D.Z. Du and F.K. Hwang, "Generalized de Bruijn Digraphs," Networks, vol. 18, pp. 27-38, 1988.
7. D.Z. Du, D.F. Hsu, F.K. Hwang, and X.M. Zhang, "The Hamiltonian Property of Generalized de Bruijn Digragh," J. Combinatorial Theory, Series B, vol. 52, pp. 1-8, 1991.
8. A.H. Esfahanian and L. Hakimi, "Fault-Tolerant Routing in de Bruijn Communications Networks," IEEE Trans. Computers, vol. 34, pp. 777-788, 1985.
9. D.F. Hsu, "On Container Width and Length in Graphs, Groups and Networks," IEICE Trans. Fundamentals of Electronics, Comm., and Computer Sciences, vol. 77A, pp. 668-680, 1994.
10. D.F. Hsu and Y.D. Lyuu, "A Graph Theoretical Study of Transmission Delay and Fault Tolerance," Proc. Fourth ISSM Int'l Conf. Parallel and Distributed Computing and System, pp. 20-24, 1991.
11. M. Imase, T. Soneoka, and K. Okada, "Fault-Tolerant Processor Interconnection," Systems and Computers, vol. 30, pp. 21-30, 1986.
12. M. Imase, T. Soneoka, and K. Okada, "Connectivity of Regular Directed Graphs with Small Diameters," IEEE Trans. Computers, vol. 34, pp. 267-273, 1985.
13. M.S. Krithnamoorthy and B. Krithnamurthy, "Fault Diameter of Interconnection Networks," Computers and Mathematics with Applications, vol. 13, no. 516, pp. 577-582, 1987.
14. F.T. Leighton, Introduction to Parallel Algorithms and Architectures Arrays, Trees, Hypercubes. San Mateo, Calif.: Morgan Kaufmann.
15. S. Levialdi, "A Pyramid Project Using Integrated Technology," Integrated Technology for Parallel Image Processing, S. Levialdi, ed. New York: Academic Press, 1985.
16. J.B. Postel, Internet Protocol, RFC 791.
17. D.K. Pradhan and S.M. Reddy, "A Fault-Tolerant Communication Architecture for Distributed Systems," IEEE Trans. Computers, vol. 31, pp. 863-870, 1982.
18. M.J. Quinn, "Designing Efficient Algorithms for Parallel Computers," K. Hwang ed. McGraw-Hill, 1987.