A comparison of different wormhole routing schemes
Yen-Wen Lu, Kallol Kumar Bagchi, J.B. Burr, A. M. Peterson · 2002
Wormhole routing is an attractive scheme for large multicomputer networks. The authors include several such representative schemes and make performance comparisons via simulation on an N/spl times/N torus with nearest neighbor connections. A systematic performance scheme is followed, which shows that among all these 6 algorithms, worm1, a hill-climbing version, has a better performance. worm1, in addition, is simpler in structure and easier to implement.>