One-to-one communication in twisted cubes under restricted connectivity

Frontiers of Computer Science in China

Volumn 4, Issue 4, 2010, Pages 489-499

  Fan, Jianxi ^a   Li, Kenli ^b   Zhang, Shukui ^a   Zhou, Wujun ^a   Cheng, Baolei ^a  

^a SOOCHOW UNIVERSITY   (China)

^b HUNAN UNIVERSITY   (China)

Author keywords

connectivity; fault free path; set of restricted faulty nodes; twisted cube; unicast

Indexed keywords

CONNECTIVITY; FAULTY NODE; FREE PATH; TWISTED CUBE; UNICAST;

ALGORITHMS; HYPERCUBE NETWORKS;

GEOMETRY;

EID: 78650523744     PISSN: 16737350     EISSN: 16737466     Source Type: Journal    
DOI: 10.1007/s11704-010-0327-5     Document Type: Article

References (16)

1. Harary F. Conditional connectivity. Networks, 1983, 13(3): 347-357.
2. Esfahanian A H. Generalized measures of fault tolerance with application to n-cube networks. IEEE Transactions on Computers, 1989, 38(11): 1586-1591.
3. Gu Q P, Peng S. Unicast in hypercubes with large number of faulty nodes. IEEE Transactions on Parallel and Distributed Systems, 1999, 10(10): 964-975.
4. Abraham S, Padmanabhan K. The twisted cube topology for multiprocessors: A Study in network asymmetry. Journal of Parallel and Distributed Computing, 1991, 13(1): 104-110.
5. Hilbers P A J, Koopman M R J, van de Snepscheut J L A. The twisted cube, parallel architectures on PARLE: Parallel Architectures and Languages Europe, 1987, 1: 152-158.
6. Chang C P, Wang J N, Hsu L H. Topological properties of twisted cubes. Information Sciences, 1999, 113(1-2): 147-167.
7. Abuelrub E, Bettayeb S. Embedding of complete binary trees in twisted hypercubes. In: Proceedings of Int'l Conf. Computer Applications in Design, Simulation, and Analysis, 1993, 1-4.
8. Huang W T, Tan J J M, Hung C N, Hsu L H. Fault-tolerant hamiltonicity of twisted cubes. Journal of Parallel and Distributed Computing, 2002, 62(4): 591-604.
9. Fan J, Jia X, Lin X. Embedding of cycles in twisted cubes with edge-pancyclic. Algorithmica, 2008, 51(3): 264-282.
10. Fan J, Jia X, Lin X. Optimal embeddings of paths with various lengths in twisted cubes. IEEE Transactions on Parallel and Distributed Systems, 2007, 18(4): 511-521.
11. Fan J, Lin X, Pan Y, Jia X. Optimal fault-tolerant embedding of paths in twisted cubes. Journal of Parallel and Distributed Computing, 2007, 67(2): 205-214.
12. Fan J, Lin X. The t/k-diagnosability of the BC graphs. IEEE Transactions on Computers, 2005, 54(2): 176-184.
13. Efe K. A variation on the hypercube with lower diameter. IEEE Transactions on Computers, 1991, 40(11): 1312-1316.
14. Larson S M, Cull P. The Möbius cubes. IEEE Trans. Computers, 1995, 44(5): 647-659.
15. Yang X, Evans D J, Megson G M. The locally twisted cubes. International Journal of Computer Mathematics, 2005, 82(4): 401-413.
16. Fan J, He L. BC interconnection networks and their properties. Chinese J. Computers, 2003, 26(1): 84-90 (in Chinese).