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 language | English |
|---|---|
| Title of host publication | Proceedings of the Joint Conference on Information Sciences |
| Editors | 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 |
| Pages | 94-97 |
| Number of pages | 4 |
| Volume | 4 |
| Publication status | Published - 1998 |
| Event | 4th 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 1998 → Oct 28 1998 |
Other
| Other | 4th 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 |
|---|---|
| Country/Territory | United States |
| City | Research Triangle Park, NC |
| Period | 10/23/98 → 10/28/98 |
ASJC Scopus subject areas
- General Computer Science