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
Dynamic security
Distributed loop computer networks: a survey
Journal of Parallel and Distributed Computing
The Balanced Hypercube: A Cube-Based System for Fault-Tolerant Applications
IEEE Transactions on Computers
Computer Algorithms: Introduction to Design and Analysis
Computer Algorithms: Introduction to Design and Analysis
Edge disjoint Hamiltonian cycles in k-ary n-cubes and hypercubes
IEEE Transactions on Computers
Exploiting global knowledge to achieve self-tuned congestion control for k-ary n-cube networks
IEEE Transactions on Parallel and Distributed Systems
A (4n-9)/3 diagnosis algorithm on n-dimensional cube network
Information Sciences: an International Journal
Constructing vertex-disjoint paths in (n, k)-star graphs
Information Sciences: an International Journal
Information Sciences: an International Journal
| Hi-index | 0.07 |
Double-loop [J. Bermond, F. Comellas, D. Hsu, Distributed Loop Computer Networks: A Survey, J. Parallel and Distributed Computing, Academic Press, 24 (1995) 2-10] and 2-circulant networks (2-CN) [J. Park, Cycle Embedding of Faulty Recursive Circulants, J. of Korea Info. Sci. Soc. 31 (2) (2004) 86-94] are widely used in the design and implementation of local area networks and parallel processing architectures. In this paper, we investigate the routing of a message on circulant networks, that is a key to the performance of this network. We would like to transmit 2k packets from a source node to a destination node simultaneously along paths on G(n;+/-s"1,+/-s"2,...,+/-s"k), where the ith packet traverses along the ith path (1=