By Topic

A load-balancing adaptive routing algorithm in k-ary n-cube interconnection networks

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

1 Author(s)
Raahemi, B. ; Res. & Innovation Center, Alcatel, Canada

We propose a new routing algorithm in k-ary n-cube interconnection networks which is adaptive, livelock-free, balances the load across the network, and preserves the sequence of packets belonging to the same flow. Our proposed routing algorithm is based on dimension-order routing, and utilizes the path diversity available in the network. Instead of choosing a deterministic route, however, it randomly selects a minimal path from a set of minimal routes available between source and destination. The randomization is carried out in such a way that the order of packets belonging to the same flow is preserved. Our routing algorithm is also adaptive in the sense that the link utilization is measured by the size of the queue feeding the link, and is periodically advertised to all nodes in the network.

Published in:

Electrical and Computer Engineering, 2003. IEEE CCECE 2003. Canadian Conference on  (Volume:2 )

Date of Conference:

4-7 May 2003