Data and computer communications
Data and computer communications
Efficient dispersal of information for security, load balancing, and fault tolerance
Journal of the ACM (JACM)
Optimum Broadcasting and Personalized Communication in Hypercubes
IEEE Transactions on Computers
Recursive Cube of Rings: A New Topology for Interconnection Networks
IEEE Transactions on Parallel and Distributed Systems
Computer Algorithms: Introduction to Design and Analysis
Computer Algorithms: Introduction to Design and Analysis
A Comparative Study of Topological Properties of Hypercubes and Star Graphs
IEEE Transactions on Parallel and Distributed Systems
A Note on Recursive Cube of Rings Network
IEEE Transactions on Parallel and Distributed Systems
A Note on Recursive Cube of Rings Network
IEEE Transactions on Parallel and Distributed Systems
Many-to-Many Disjoint Path Covers in Hypercube-Like Interconnection Networks with Faulty Elements
IEEE Transactions on Parallel and Distributed Systems
On reliability of the folded hypercubes
Information Sciences: an International Journal
Embedding meshes into crossed cubes
Information Sciences: an International Journal
A parallel routing algorithm on circulant networks employing the Hamiltonian circuit latin square
Information Sciences: an International Journal
Edge disjoint Hamiltonian cycles in k-ary n-cubes and hypercubes
IEEE Transactions on Computers
| Hi-index | 0.08 |
Recursive cube of rings (RCR) networks [Y. Sun, P. Cheung, X. Lin, Recursive cube of rings: a new topology for interconnection networks, IEEE Trans. Parallel Dist. Syst. 11 (3) (2000) 275-286] can be widely used in the design and implementation of parallel processing architectures. In this paper, we investigate the routing of a message on RCR networks, that is a key to the performance of this network. We would like to transmit k+1 packets from a source node to a destination node simultaneously along paths on RCR networks, the ith packet will traverse along the ith path (1=