By Topic

Nearly optimal one-to-many parallel routing in star 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

2 Author(s)
Chi-Chang Chen ; Dept. of Comput. Sci. & Eng., Tatung Inst. of Technol., Taipei, Taiwan ; Jianer Chen

Star networks were proposed recently as an attractive alternative to the well-known hypercube models for interconnection networks. Extensive research has been performed that shows that star networks are as versatile as hypercubes. This paper is an effort in the same direction. Based on the well-known paradigms, we study the one-to-many parallel routing problem on star networks and develop an improved routing algorithm that finds n-1 node-disjoint paths between one node and a set of other n-1 nodes in the n-star network. These parallel paths are proven of minimum length within a small additive constant, and the running time of our algorithm is bounded by O(n2). More specifically, given a node s and n-1 other nodes {t1, t2 , …, tn-1} in the n-star network, our algorithm constructs n-1 node-disjoint paths P1, P2, …, Pn-1, where Pi is a path from s to tj of length at most dist(s, tj)+6 and dist(s, t j) is the distance, i.e., the length of a shortest path, from s to tj, for i=1, 2, …, n-1.The best bound on the path length by previously known algorithms for the same problem is 5(n-2)≈10Δn/3, where Δn=max{dist(s, t)} is the diameter of the n-star network

Published in:

Parallel and Distributed Systems, IEEE Transactions on  (Volume:8 ,  Issue: 12 )