Efficient dispersal of information for security, load balancing, and fault tolerance
Journal of the ACM (JACM)
A Group-Theoretic Model for Symmetric Interconnection Networks
IEEE Transactions on Computers
Fault tolerant routing in the star and pancake interconnection networks
Information Processing Letters
Optimal Information Dissemination in Star and Pancake Networks
IEEE Transactions on Parallel and Distributed Systems
Node-to-set disjoint paths problem in star graphs
Information Processing Letters
Rotator Graphs: An Efficient Topology for Point-to-Point Multiprocessor Networks
IEEE Transactions on Parallel and Distributed Systems
Parallel Routing and Sorting of the Pancake Network
ICCI '91 Proceedings of the International Conference on Computing and Information: Advances in Computing and Information
Parallel Minimum Spanning Forest Algorithms on the Star and Pancake Interconnection Networks
CONPAR '92/ VAPP V Proceedings of the Second Joint International Conference on Vector and Parallel Processing: Parallel Processing
An Algorithm for Node-to-Set Disjoint Paths Problem in Bi-Rotator Graphs
IEICE - Transactions on Information and Systems
| Hi-index | 0.00 |
A rotator graph was proposed as a topology for interconnection networks of parallel computers, and it is promising because of its small diameter and small degree. However, a rotator graph is a directed graph that sometimes behaves harmful when it is applied to actual problems. A bi-rotator graph is obtained by making each edge of a rotator graph bi-directional. A bi-rotator has a Hamilton cycle and it is also pan-cyclic. In this paper, we give an algorithm for the node-to-set disjoint paths problem in bi-rotator graphs with its evaluation results. The solution achieves some fault tolerance such as file distribution based information dispersal technique. The algorithm is of polynomial order of n for an n-bi-rotator graph. It is based on recursion and divided into three cases according to the distribution of destination nodes in classes into which all the nodes in a bi-rotator graph are categorized. The sum of lengths of paths obtained and the time complexity of the algorithm are estimated. Average performance of the algorithm is also evaluated by computer experiments.