Nearly optimal onetomany parallel routing in star networks
Academic Article

 Overview

 Research

 Identity

 Additional Document Info

 View All

Overview
abstract

Star networks were proposed recently as an attractive alternative to the wellknown 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 wellknown paradigms, we study the onetomany parallel routing problem on star networks and develop an improved routing algorithm that finds n  1 nodedisjoint paths between one node and a set of other n  1 nodes in the nstar 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, ..., tn1} in the nstar network, our algorithm constructs n  1 nodedisjoint paths P1, P2, ..., Pn1, where Pi is a path from s to ti of length at most dist(s, fi) + 6 and dist(s, ti) is the distance, i.e., the length of a shortest path, from s to ti, 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{dis/(s, t)} is the diameter of the nstar network. © 1997 IEEE.
author list (cited authors)
citation count
publication date
publisher
published in
Research
keywords

Interconnection Network

Nodedisjoint Paths

Parallel Routing

Routing Algorithm

Shortest Path

Star Network
Identity
Digital Object Identifier (DOI)
Additional Document Info
start page
end page
volume
issue