A parallel routing algorithm on circulant networks employing the hamiltonian circuit latin square

Authors:
Dongkil Tak;Yongeun Bae;Chunkyun Youn;Ilyong Chung
Affiliations:
Department of Computer Science, Chosun University, Kwangju, Korea;Department of Computer Science, Chosun University, Kwangju, Korea;Information Technology Division, Honam University, Kwangju, Korea;Department of Computer Science, Chosun University, Kwangju, Korea
Venue:
NPC'05 Proceedings of the 2005 IFIP international conference on Network and Parallel Computing
Year:
2005

Citing 7
Cited 0

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
Distributed loop computer networks: a survey

Journal of Parallel and Distributed Computing
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

Quantified Score

Hi-index	0.00

Visualization

Abstract

Double-loop and 2-circulant networks 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; ±s1,±s2,...,±sk), where the ith packet will traverse along the ith path (1≤ i ≤2k). In oder for all packets to arrive at the destination node quickly and securely, the ith path must be node-disjoint from all other paths. For construction of these paths, employing the Hamiltonian Circuit Latin Square(HCLS) we present O(n2) parallel routing algorithm on circulant networks.