Performance comparison of partially adaptive routing algorithms

Patooghy, A ; Sharif University of Technology | 2006

136 Viewed
  1. Type of Document: Article
  2. DOI: 10.1109/AINA.2006.267
  3. Publisher: 2006
  4. Abstract:
  5. Partially adaptive routing algorithms are a useful category of routing algorithms due to their simple router logic and restricted adaptivity in selecting the next output channel towards the destination. Several partially adaptive routing algorithms on mesh and hypercube networks have been presented in the literature. But there is no study on evaluating the performance of these algorithms. This paper tries to compare the most important partially adaptive routing algorithms on the mesh and hypercube networks as the most popular topologies for multicomputers. The evaluation has been performed by the use of event driven simulator coded by C++ compiler. © 2006 IEEE
  6. Keywords:
  7. Adaptive algorithms ; C (programming language) ; Communication channels (information theory) ; Computer simulation ; Formal logic ; Topology ; Adaptive routing algorithms ; C++ compilers ; Hypercube networks ; Multicomputers ; Routers
  8. Source: 20th International Conference on Advanced Information Networking and Applications, Vienna, 18 April 2006 through 20 April 2006 ; Volume 2 , 2006 , Pages 763-767 ; 1550445X (ISSN) ; 0769524664 (ISBN); 9780769524665 (ISBN)
  9. URL: https://ieeexplore.ieee.org/document/1620473