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

Information Sciences

Volumn 176, Issue 21, 2006, Pages 3132-3142

  Cho, Youngjoo ^a   Chung, Ilyong ^a  

^a Chosun University   (South Korea)

Author keywords

Circulant networks; Hamiltonian circuit latin square; Parallel routing algorithm

Indexed keywords

DISTRIBUTED COMPUTER SYSTEMS; HAMILTONIANS; LOCAL AREA NETWORKS; PARALLEL ALGORITHMS; PARALLEL PROCESSING SYSTEMS;

CIRCULANT NETWORKS; HAMILTONIAN CIRCUIT LATIN SQUARE; PARALLEL PROCESSING ARCHITECTURES; PARALLEL ROUTING ALGORITHM;

COMPUTER NETWORKS;

EID: 33746778334     PISSN: 00200255     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ins.2005.12.014     Document Type: Article

References (13)

1. Bae M., and Bose B. Edge disjoint Hamiltonian cycles in k-ary n-cubes and hypercubes. IEEE Trans. Comput. 52 10 (2003) 1259-1270
2. Basse S. Computer Algorithms: Introduction to Design and Analysis (1978), Addition-Wesley, Reading, MA
3. Bermond J., Comellas F., and Hsu D. Distributed loop computer networks: a survey. J. Parall. Distr. Comput. 24 (1995) 2-10
4. Chung I. Application of the special latin squares to the parallel routing algorithm on hypercube. J. Korea Info. Sci. Soc. 19 5 (1992)
5. I. Chung, Dynamic security: parallel communications and secret routing algorithms, Ph.D. Dissertation, City University of New York, 1991.
6. Denes J., and Keedwell A.D. Latin Square and Their Applications (1974), Academic Press, New York
7. Johnson S.L., and Ho C.-T. Optimum broadcasting and personalized communication in hypercube. IEEE Trans. Comput. 38 9 (1989) 1249-1268
8. Park J. Cycle embedding of faulty recursive circulants. J. Korea Info. Sci. Soc. 31 2 (2004) 86-94
9. Rabin M.O. Efficient dispersal of information for security, load balancing, and fault tolerance. J. ACM 36 2 (1989) 335-348
10. Stallings W. Data and Computer Communications (1985), Macmillan Publishing Company, New York
11. Stone H.S. Discrete Mathematical Structures and Their Applications (1973), SRA, Chicago, IL
12. Thottethodi M., Lebeck A., and Mukherjee S. Exploiting global knowledge to achieve self-tuned congestion control for k-ary n-cube networks. IEEE Trans. Parall. Distr. Syst. 15 3 (2004) 257-272
13. Wu J., and Huang K. The balanced hypercube: a cube-based system for fault-tolerant application. IEEE Trans. Comput. 46 4 (1997) 484-490