By Topic

Efficient routing algorithms for folded-cube 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)
Varvarigos, E. ; Dept. of Electr. & Comput. Eng., California Univ., Santa Barbara, CA

We consider the partial multinode broadcast, the total exchange, and several other prototype communication tasks in a folded-cube network of processors. In the partial multinode broadcast in a N-processor network, each one of M arbitrary nodes (M⩽N) broadcasts a packet to all the remaining N-1 nodes. In the total exchange task each processor sends a separate (personalized) packet to every other processor. We propose algorithms for the folded-cube topology that execute these tasks in optimal or near-optimal time. We also present an efficient scheme for the dynamic version of the broadcasting problem, where broadcast requests are generated at each node of the folded-cube at random times. The dynamic broadcasting scheme has asymptotically optimal stability and average delay properties

Published in:

Computers and Communications, 1995., Conference Proceedings of the 1995 IEEE Fourteenth Annual International Phoenix Conference on

Date of Conference:

28-31 Mar 1995