Comparative Analysis of Routing Algorithms in Wormhole Cube Networks

M. Ould-Khaoua, S. Loucif, A. Al-Dhelaan

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

There have been many adaptive routing algorithms proposed in the literature for wormhole-routed networks. This paper compares the performance of deterministic routing to two adaptive routing algorithms in the cube network. The comparison takes into account router delays introduced by adaptivity. The results show that in certain circumstances, deterministic routing can outperform adaptive routing.

Original languageEnglish
Title of host publicationProceedings of the Joint Conference on Information Sciences
EditorsK. Li, Y. Pan, P.P. Wang, A. Al-Dhelaan, H. Da Cheng, Y. Pan, P.P. Wang, K. Li, A. Al-Dhelaan, H. Da Cheng
Pages94-97
Number of pages4
Volume4
Publication statusPublished - 1998
Event4th International Conference on Computer Science and Informatics, JCIS 1998, 1st International Workshop on High Performance, 1st International Workshop on Computer Vision, Pattern Recognition and Image Processing Volume 4 - Research Triangle Park, NC, United States
Duration: Oct 23 1998Oct 28 1998

Other

Other4th International Conference on Computer Science and Informatics, JCIS 1998, 1st International Workshop on High Performance, 1st International Workshop on Computer Vision, Pattern Recognition and Image Processing Volume 4
CountryUnited States
CityResearch Triangle Park, NC
Period10/23/9810/28/98

    Fingerprint

ASJC Scopus subject areas

  • Computer Science(all)

Cite this

Ould-Khaoua, M., Loucif, S., & Al-Dhelaan, A. (1998). Comparative Analysis of Routing Algorithms in Wormhole Cube Networks. In K. Li, Y. Pan, P. P. Wang, A. Al-Dhelaan, H. Da Cheng, Y. Pan, P. P. Wang, K. Li, A. Al-Dhelaan, ... H. Da Cheng (Eds.), Proceedings of the Joint Conference on Information Sciences (Vol. 4, pp. 94-97)