Skip to main content
SpringerLink
Log in

Efficient Parallel Routing Algorithms for Cartesian and Composition Networks

  • Conference paper
Advances in Computer Science and Engineering (CSICC 2008)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 6))

Included in the following conference series:

Abstract

The Cartesian and Composition products are two well known graph products, also applied to interconnection networks area. The Cartesian and Composition network products possess great characteristics of fault resilience according to their high connectivity. In this paper, we study the existence and construction of parallel routing paths in these two well-known product networks. To prove the existence of certain number of parallel paths in these product networks, we need to compute their connectivity. By assuming the availability of certain number of faulty nodes, we propose some new shortest-path parallel routing algorithms. These algorithms can be used both in faulty networks and to route different data from different paths to a specified target node. We also study the concept of container length and wide diameter of the two mentioned product networks. Comparison between wide diameters and diameters of the two networks exhibit the efficiency of these product networks in constructing node disjoint paths.

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 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.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. Efe, K., Fernandez, A.: Products of networks with logarithmic diameter and fixed degree. IEEE Trans. on Parallel and Distribute Systems 6, 963–975 (1995)

    Article  Google Scholar 

  2. Fernandez, A., Leighton, T., Lopez-Presa, J.L.: Containment properties of product and power graphs. Electronic Notes in Discrete Mathematics 7, 1–4 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  3. Leighton, T.: Introduction to parallel algorithms and architectures: Arrays, Tress and Hypercubes. Morgan Kaufmann, San Mateo (1992)

    MATH  Google Scholar 

  4. Bondy, J.A., Murty, U.S.R.: Graph Theory with Applications. North-Holland, NY (1976)

    Book  MATH  Google Scholar 

  5. Dietzfelbinger, M., Madhavapeddy, C., Sudborough, I.H.: Three disjoint path paradigms in star networks. In: Proceedings of the IEEE Symposium on Parallel and Distributed Processing, pp. 4000–4066 (1991)

    Google Scholar 

  6. Liaw, S.C., Chang, G.J.: Generalized diameters and Rabin numbers of networks. Journal of Combinatorial Optimization 2(4), 371–384 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  7. Ishigami, Y.: The wide-diameter of the n-dimensionml toroidal mesh. Networks 27, 257–266 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  8. Hsu, D.F.: On container width and length in graphs, groups, and networks. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Science E77-A(4), 668–680 (1994)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Sharif University of Technology, Tehran, Iran

    Marzieh Bakhshi, Saeedeh Bakhshi & Hamid Sarbazi-Azad

  2. IPM School of Computer Science, Tehran, Iran

    Saeedeh Bakhshi & Hamid Sarbazi-Azad

Authors
  1. Marzieh Bakhshi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Saeedeh Bakhshi
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Hamid Sarbazi-Azad
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. IPM School of Computer Science, and Department of Computer Engineering, Sharif Unversity of Technology, Azadi Street, Tehran, Iran

    Hamid Sarbazi-Azad

  2. Department of Electrical and computer Engineering, UC Irvine, California, USA

    Behrooz Parhami

  3. Department of Computer Engineering, Sharif University of Technology,, Azadi Street, Tehran, Iran

    Seyed-Ghassem Miremadi

  4. Department of Computer Engineering, Sharif University of Technology, Azadi Street, Tehran, Iran

    Shaahin Hessabi

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bakhshi, M., Bakhshi, S., Sarbazi-Azad, H. (2008). Efficient Parallel Routing Algorithms for Cartesian and Composition Networks. In: Sarbazi-Azad, H., Parhami, B., Miremadi, SG., Hessabi, S. (eds) Advances in Computer Science and Engineering. CSICC 2008. Communications in Computer and Information Science, vol 6. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-89985-3_37

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-89985-3_37

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-89985-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation