Skip to main content
SpringerLink
Log in

A Parallel Routing Algorithm on 2-Circulant Networks Employing the Hamiltonian Circuit Latin Square

  • Conference paper
Book cover Parallel and Distributed Computing: Applications and Technologies (PDCAT 2004)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3320))

  • 763 Accesses

Abstract

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

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bermond, J., Comellas, F., Hsu, D.: Distributed Loop Computer Networks: A Survey. J. Parallel and Distributed Computing (24), 2–10 (1995)

    Google Scholar 

  2. Park, J.: Cycle Embedding of Faulty Recursive Circulants. J. of Korea Info. Sci. Soc. 31(2), 86–94 (2004)

    Google Scholar 

  3. Basse, S.: Computer Algorithms: Introduction to Design and Analysis. Addition-Wesley, Reading (1978)

    Google Scholar 

  4. Stallings, W.: Data and Computer Communications. Macmillan Publishing Company, New York (1985)

    Google Scholar 

  5. Bae, M., Bose, B.: Edge Disjoint Hamiltonian Cycles in k-ary n-cubes and Hypercubes. IEEE Trans. Comput. 52(10), 1259–1270 (2003)

    Article  MathSciNet  Google Scholar 

  6. Thottethodi, M., Lebeck, A., Mukherjee, S.: Exploiting Global Knowledge to Achieve Self-Tuned Congetion Control for k-ary n-cube Networks. IEEE Trans. Parallel and Distributed Systems 15(3), 257–272 (2004)

    Article  Google Scholar 

  7. Johnson, S.L., Ho, C.-T.: Optimum Broadcasting and Personalized Communication in Hypercube. IEEE Trans. Comput. 38(9), 1249–1268 (1989)

    Article  MathSciNet  Google Scholar 

  8. Rabin, M.O.: Efficient Dispersal of Information for Security, Load Balancing, and Fault Tolerance. J. ACM 36(2), 335–348 (1989)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Chosun University, Kwangju, Korea

    Youngjoo Cho, Dongkil Tak & Ilyong Chung

Authors
  1. Youngjoo Cho
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Dongkil Tak
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Ilyong Chung
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Nanyang Centre for Supercomputing and Visualisation School of Mechanical and Production Engineering, Nanyang Technological University, 50 Nanyang Avenue, 639 798, Singapore

    Kim-Meow Liew

  2. School of Computer Science, The University of Adelaide,  

    Hong Shen

  3. Asia Pacific Science and Technology Center, Sun Microsystems Inc., 50 Nanyang Avenue, N3-1c-10, 639798, Singapore

    Simon See

  4. School of Computer Engineering, Nanyang Technological University, 639798, Singapore

    Wentong Cai

  5. Southwest Jiaotong University,  

    Pingzhi Fan

  6. Tohoku University ,  

    Susumu Horiguchi

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Cho, Y., Tak, D., Chung, I. (2004). A Parallel Routing Algorithm on 2-Circulant Networks Employing the Hamiltonian Circuit Latin Square. In: Liew, KM., Shen, H., See, S., Cai, W., Fan, P., Horiguchi, S. (eds) Parallel and Distributed Computing: Applications and Technologies. PDCAT 2004. Lecture Notes in Computer Science, vol 3320. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30501-9_61

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30501-9_61

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-24013-6

  • Online ISBN: 978-3-540-30501-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation