By Topic

Node-to-Set Disjoint-path Routing 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 interconnection network introduced a few years ago has some very interesting properties: it has a short diameter similar to the hypercube, and its degree is much lower than that of a hypercube of the same size. In this paper, we describe an efficient algorithm for finding disjoint paths between one source node and at most m+k target nodes in a metacube MC(k, m) excluding MC(*, 1), MC(2, 2), MC(3, 2) and MC(3, 3). We show that we can find m+k disjoint paths between the source node and the m+k targets of length at most metacube diameter plus (k + 4) with time complexity of order of metacube degree times its diameter.

Published in:

Parallel and Distributed Computing, Applications and Technologies, 2009 International Conference on

Date of Conference:

8-11 Dec. 2009