Skip to main content
Springer Nature Link
Log in

A new family of Cayley graph interconnection networks based on wreath product and its topological properties

  • Published:
Cluster Computing Aims and scope Submit manuscript

Abstract

This paper introduces a new type of Cayley graphs for building large-scale interconnection networks, namely \(\mathit{WG}_{n}^{2m}\), whose vertex degree is m+3 when n≥3 and is m+2 when n=2. A routing algorithm for the proposed graph is also presented, and the upper bound of the diameter is deduced as ⌊5n/2⌋. Moreover, the embedding properties and maximal fault tolerance are also analyzed. Finally, we compare the proposed networks with some other similar network topologies. It is found that \(\mathit{WG}_{n}^{2m}\) is superior to other interconnection networks because it helps to construct large-scale networks with lower cost.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Akers, S.B., Krishnamurthy, B.: A group-theoretic model for symmetric interconnection networks. IEEE Trans. Comput. 38(4), 556–566 (1989)

    Article  MathSciNet  Google Scholar 

  2. Annexstein, F., Baumslag, M., Rosenberg, A.L.: Group action graphs and parallel architectures. SIAM J. Comput. 19, 544–569 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  3. Arden, B.W., Tang, K.W.: Representations and routing of Cayley graphs. IEEE Trans. Commun. 39(11), 1533–1537 (1991)

    Article  MATH  Google Scholar 

  4. Bhuyan, L., Agrawal, D.P.: Generalized hypercube and hyperbus structure for a computer network. IEEE Trans. 33, 323–333 (1984)

    MATH  Google Scholar 

  5. Biggs, N.L.: Algebraic Graph Theory. Cambridge University Press, Cambridge (1993)

    Google Scholar 

  6. Chen, G.H., Lau, F.C.M.: Comments on “A new family of Cayley graph interconnection networks of constant degree four”. IEEE Trans. Parallel Distrib. Syst. 8, 1299–1300 (1997)

    Article  Google Scholar 

  7. Das, R.K., Sinha, B.P.: A new topology with odd degree for multiprocessor systems. J. Parallel Distrib. Comput. 39, 87–94 (1996)

    Article  MATH  Google Scholar 

  8. Day, K.: The cross product of interconnection networks. IEEE Trans. Parallel Distrib. Syst. 8, 109–118 (1997)

    Article  Google Scholar 

  9. Dirac, G.A.: In abstrakten graphen vorhandene vollständige 4-graphen undihre unterteilungen. Math. Nachr. 22, 61–85 (1960)

    Article  MathSciNet  MATH  Google Scholar 

  10. Fu, A.W., Chau, S.C.: Cyclic-cubes: a new family of interconnection networks of even fixed-degrees. IEEE Trans. Parallel Distrib. Syst. 9, 1253–1268 (1996)

    Google Scholar 

  11. Hoffman, C.: Group Theoretic Algorithm and Algorithm and Graph Isomorphism. Springer, New York (1982)

    Google Scholar 

  12. Hsieh, S.Y., Hsiao, T.T.: The k-degree Cayley graph and its topological properties. Networks 47, 26–36 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  13. Okawa, S.: Correction to the diameter of trivalent Cayley graphs. IEICE Trans. Fundam. E84-A, 1269–1272 (2001)

    Google Scholar 

  14. Qiu, K., Akl, S.G., Meijer, H.: On some properties and algorithms for the star and pancake interconnection networks, J. Parallel Distrib. Comput. (1993)

  15. Samatham, M.R., Pradhan, D.K.: The de Bruijin multiprocessor network: a versatile parallel processing and sorting network for VLSI. IEEE Trans. Comput. C 38, 567–581 (1989)

    Article  MathSciNet  MATH  Google Scholar 

  16. Tsai, C.H., Hung, C.N., Hsu, L.H., Chang, C.H.: The correct diameter of trivalent Cayley graphs. Inf. Process. Lett. 72, 109–111 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  17. Vadapalli, P., Srimani, P.K.: Trivalent Cayley graphs for interconnection networks. Inf. Process. Lett. 54, 329–335 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  18. Vadapalli, P., Srimani, P.K.: A new family of Cayley graph interconnection networks of constant degree four. IEEE Trans. Parallel Distrib. Syst. 7, 177–181 (1996)

    Article  Google Scholar 

  19. Vadapalli, P., Srimani, P.K.: Shorstest routing in trivalent Cayley graph network. Inf. Process. Lett. 57, 183–188 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  20. Wei, D.S.L., Muga, F.P. II, Naik, K.: Isomorphism of degree four Cayley graph and wapped butterfly and their optimal permutation routing algorithm. IEEE Trans. Parallel Distrib. Syst. 10, 1290–1298 (1999)

    Article  Google Scholar 

  21. Xu, J.: Topological Structure and Analysis of Interconnection Networks. Kluwer Academic, Dordrecht (2001)

    MATH  Google Scholar 

  22. Zhou, S.M., Du, N., Chen, B.X.: A new family of interconnection networks of odd fixed degrees. J. Parallel Distrib. Comput. 66, 698–704 (2006)

    Article  MATH  Google Scholar 

  23. K computer. http://en.wikipedia.org/wiki/K_computer

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Jinan University, Guangzhou, China

    Zhen Zhang

  2. School of Computer Science and Engineering, South China University of Technology, Guangzhou, China

    Wenjun Xiao

Authors
  1. Zhen Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Wenjun Xiao
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Zhen Zhang.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Zhang, Z., Xiao, W. A new family of Cayley graph interconnection networks based on wreath product and its topological properties. Cluster Comput 14, 483–490 (2011). https://doi.org/10.1007/s10586-011-0189-0

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10586-011-0189-0

Keywords