By Topic

Construction of a parallel and shortest routing algorithm on recursive circulant 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)
Ilyong Chung ; Dept. of Comput. Sci, Chosun Univ., Kwangju, South Korea

In this paper, we investigate the routing of a message in recursive circulant, that is a key to the performance of this network. On recursive circulant network, we would like to transmit m packets from a source node to a destination node simultaneously along m paths, where the ith packet will traverse along the ith path (0/spl les/i/spl les/m-1). In order for all packets to arrive at the destination node quickly and securely, these m paths must be node-disjoint and the sum of lengths of paths be the smallest. Employing the Hamiltonian circuit Latin square (HCLS), we present O(m2) parallel routing algorithm for constructing a set of m shortest and node-disjoint paths.

Published in:

High Performance Computing in the Asia-Pacific Region, 2000. Proceedings. The Fourth International Conference/Exhibition on  (Volume:2 )

Date of Conference:

14-17 May 2000