Star Networks have been recently proposed as an attractive choice for interconnection networks. They have sublogarithmic node degree and diameter and, like hypercubes, have a highly recursive structuw. Several researchers have endeavored t o prove that star networks are as versatile as hypercubes. This paper is an efforl in the same direction. We present optimal algorithms for computing disjoint paths in star graphs for two well known paradigms. We also study the problem of disjoint connecting paths and present an eficient algorithm for finding a limited number of such paths in the siar network. Similar algorithms are already known for hypercubes and have proved useful in designing eficient and fault tolerant rouiing algorithms on hypercube networks.

No abstract

No abstract

No abstract

No abstract