A comparison of adaptive packet-routing algorithms for tori

Recently several adaptive and partially adaptive routing algorithms have been proposed for worm-hole routing of messages in multicomputers based on k-ary n-cube networks. The authors compare the performances of these algorithms in the context of store-and-forward routing. The algorithms considered are the nonadaptive (e-cube), partially-adaptive, and fully-adaptive routing algorithms. The results indicate that partially-adaptive routing algorithms currently under study by several researchers may not perform better than the well-known nonadaptive e-cube routing algorithm for many traffic patterns such as uniform, hotspot, and local.<
>