[1] Akers S. B., Harel D., and Krishnamurthy B., “The Star Graph: An Attractive Alternative to the N-Cube,” in Proceedings of the International Conference Parallel Processing, pp. 393-400, 1987.

[2] Al-Sadi J., Day K., and Ould-Khaoua M., “Unsafety Vectors: A New Fault-Tolerant Routing for the Binary N-Cube,” Journal of Systems Architecture, vol. 47, no. 9, pp. 783-793, 2002,

[3] Awwad A., Al-Ayyoub A., and Ould-Khaoua M., “Efficient Routing Algorithms on the OTIS– Networks,” in Proceedings of the 3rd International Conference on Information Technology ( ACIT’2002), The University of Qatar, Doha, pp. 138-144, December 2002.

[4] Chen M. S. and Shin K. G., “Adaptive Fault- Tolerant Routing in Hypercube Multicomputers,” IEEE Transactions Computers, vol. 39, no.12, pp.1406-1416, 1990.

[5] Chen M. S. and Shin K. G., “Depth-First Search Approach for Fault-Tolerant Routing in Hypercube Multicomputers,” IEEE Transactions Parallel and Distributed Systems, vol. 1 , no. 2, pp. 152-159, 1990.

[6] Day K. and Al-Ayyoub A., “Topological Properties of OTIS-Networks,” IEEE Transactions on Parallel and Distributed Systems, vol. 13, no. 4, pp. 359-366, 2002.

[7] Day K. and Tripathi A., “Arrangement Graphs: A Class of Generalised Star Graphs,” Information Processing Letters, vol. 42, pp. 235- 241, 1992.

[8] Gaughan P. T., Yalamanchili S., “Adaptive Routing Protocols for Hypercube Interconnection Networks,” Computer, vol. 26, no. 5, pp. 12-24, 1993.

[9] Gordon J. M. and Stout Q. F., “Hypercube Message Routing in the Presence of Faults,” in Proceedings of the 3rd Conference Hypercube Concurrent Computers and Applications, pp. 251-263, 1988.

[10] Graham S. and Seidel S., “The Cost of Broadcasting on Star Graphs and K-Ary Hypercubes,” IEEE Transactions Computers, vol. 6, pp. 756-759, 1993.

[11] Hendrick W., Kibar O., Marchand P., Fan C., Blerkom D., McCormick F., Cokgor I., Hansen M., and Esener S., “Modeling and Optimisation of the Optical Transpose Interconnection System,” in Optoelectronic Technology Centre, Cornell University, September 1995.

[12] Krishnamoorthy A., Marchand P., Kiamilev F., and Esener S., “Grain-size Considerations for Optoelectronic Multistage Interconnection Networks,” Applied Optics, vol. 31, no. 26, pp. 5480- 5507, 1992.

[13] Lan Y., “A Fault-Tolerant Routing Algorithm in Hypercubes,” in Proceedings of the International Conference Parallel Processing, pp. 163-166, 1994.

[14] Lee T. C. and Hayes J. P., “A Fault-Tolerant Communication Scheme for Hypercube Computers,” IEEE Transactions Computers, vol. 41, no. 10, pp. 1242-1256, 1992.

[15] Linder D. and Harden J., “An Adaptive and Fault Tolerant Wormhole Routing Strategy for K-Ary Hypercubes,” IEEE Transactions Computers, vol. 1, pp. 2-12, 1991.

[16] Marsden G., Marchand P., Harvey P., and Esener S., “Optical Transpose Interconnection System Architecture,” Optics Letters, vol.18, no.13, pp. 1083-1085, 1993.

[17] N-Cube Systems, N-cube Handbook, 1986.

[18] Ni M. and McKinley P. K., “A Survey of Routing Techniques in Wormhole Networks,” Computer, vol. 26, no.2, pp. 62-76, 1993.

[19] Ranka S., Wang J., and Yeh N., “Embedding Meshes on the Star Graph,” in Proceedings of the Supercomputing'90,” New York, USA, pp. 476-485, 1990.

[20] Rattler J., “Concurrent Processing: A new Direction in Scientific Computing,” in Proceedings of the AFIPS Conference, pp. 157- 166, 1985.

[21] Saad Y. and Schultz M. H., “Data Communication in Hypercubes,” Technical Report YALEU/ DCS/ RR-428, Yale University, 1985. On the Routing of the OTIS-Cube Network in Presence of Faults 23

[22] Saad Y. and Schultz M. H., “Topological Properties of Hypercubes,” IEEE Transactions Computers, vol. 37, no. 7, pp. 867-872, 1988.

[23] Sahni S. and Wang C., “BPC Permutations on the OTIS-hypercube Optoelectronic Computer,” Informatica, vol. 22, pp. 263-269, 1998.

[24] Sahni S. and Wang C., “BPC Permutations on the OTIS-mesh Optoelectronic Computer,” Technical Report, University of Florida, 1997.

[25] Seitz C. L., “The cosmic cube,” Communications of ACM, vol. 28, no.1, pp. 22-23, Jan 1985.

[26] Silicon Graphics, “Origin 200 and Origin 2000,” Technical Report, 1996.

[27] Sullivan H., Bashkow T., and Klappholz D., “A Large Scale, Homogeneous, Fully Distributed Parallel Machine,” in Proceedings of the 4th Annual Symposium Computer Architecture, pp. 105-124, 1977.

[28] Wang C. and Sahni S., “Basic Operations on the OTIS-mesh Optoelectronic Computer,” IEEE Transactions Parallel and Distributed Systems, vol. 9, no. 12, pp.1226-1236, 1998.

[29] Wang C. F., “Algorithms for the OTIS Optoelectronic Computers,” PhD Thesis, University of Florida, 1998.

[30] Zane F., Marchand P., Paturi R., and Esener S., “Scalable Network Architecture Using the Optical Transpose Interconnection System (OTIS),” Journal of Parallel and Distributed Computing, vol. 60, pp. 521-538, 2000. Ahmad Awwad finished both of his BSc degree in computer science and his MSc degree in mathematical science from Tennessee State University, USA, in 1987 and 1989, respectively. He gained his PhD in computer science from the University of Glasgow, United Kingdom, 2002. He served in Oman as senior lecturer at the Sohar College, and at Zarqa Private University as Head of Computer Science Department. He is currently a staff-tutor in the Faculty of Information Technology at Arab Open University. His research interests are parallel processing, interconnection networks, product networks, opto-electronic networks, algorithms design for HSPC, and distance learning. He is a member of the IEEE-CS. Jehad Al-Sadi received his BSc degree in computer science from Tennessee State University, USA, in 1989, and MSc degree in Computer Science from Jackson State University, USA, in 1993. From graduation till 1996, he was a lecturer in the Department of Computing Science at Al-Isra University, Jordan. He gained his PhD in computer science from the University of Glasgow, U.K, 2002. He is currently the chairman of the Computer Science Department at Zarqa Private University, Jordan. His research interests are multicomputers, interconnection networks, optical networks, and fault-tolerant routing. He is a member of IEEE.