Cart (Loading....) | Create Account
Close category search window
 

A Node-to-Set Disjoint-Path Routing Algorithm in Metacube

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)
Bossard, A. ; Grad. Sch. of Eng., Tokyo Univ. of Agric. & Technol., Koganei, Japan ; Kaneko, K. ; Peng, S.

The metacube (MC) was introduced as a topology for interconnection networks of large parallel computers, and it has a merit that with a diameter similar to that of the hypercube, its degree is much lower: the 2m2k + k nodes of a metacube MC(k, m) have a degree of to + k. We introduce in this paper an efficient routing algorithm for finding in a metacube MC(k, m) disjoint paths between one source node and a maximum of m + k target nodes. We show that for any source node s, and any target nodes T = {t1,..., tn}, n ¿ m + k, we can find n disjoint paths from s to ti (1 ¿ i < n) of maximal length km2k + m2k + 3k + 4 in O(nm2k) time.

Published in:

Pervasive Systems, Algorithms, and Networks (ISPAN), 2009 10th International Symposium on

Date of Conference:

14-16 Dec. 2009

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.