By Topic

A comparison of adaptive packet-routing algorithms for tori

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Boppana, R.V. ; Div. of Math.-Comput. Sci.-Stat., Texas Univ., San Antonio, TX, USA ; Chalasani, S. ; Raghavendra, C.S.

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

Published in:

Computers and Communications, 1993., Twelfth Annual International Phoenix Conference on

Date of Conference:

23-26 Mar 1993