Skip to main content
Log in

A new family of interconnection networks of fixed degree three

  • Computer Network and Internet
  • Published:
Journal of Computer Science and Technology Aims and scope Submit manuscript

Abstract

A new family of interconnection networksWG n is proposed, that is constant degree 3 Cayley graph, and is isomorphic to a Cayley graph of the wreath productZ 2lSn when the generator set is chosen properly. Its different algebraic properties is investigated and a routing algorithm is given with the diameter upper bounded by 3n 2−6n+4. The embedding properties and the fault tolerance are devired. In conclusion, we present a comparison of some familiar networks with constant degree 3.

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

Access this article

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

Instant access to the full article PDF.

Similar content being viewed by others

References

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

    Article  MathSciNet  Google Scholar 

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

    Article  MATH  Google Scholar 

  3. Qiu K, Akl S G, Merjer H. On some properties and algorithms for the star and pancake interconnection networks.J. Parallel and Distributed Computing, July 1994, 22(1): 33–45.

    Google Scholar 

  4. Ohring S, Das S K. Folded Perterson cube networks; new competitors for the hypercubes.IEEE Trans. Parallel and Distributed Systems, Feb. 1996, 7(2): 151–168.

    Article  Google Scholar 

  5. Preparata F, Vuillemin J. The cube-connected cycles versatile network for parallel computation.Comm. ACM, May 1981, 24(5): 30–39.

    Article  MathSciNet  Google Scholar 

  6. Latifi S, Srimani P K. A fixed degree regular network for massively paralled system.Journal of Supercomputing, 1998, 12: 277–291.

    Article  MATH  Google Scholar 

  7. Chi-Hsiang Yeh, Emmanouel A Varvarigo. Parallel algorithms on the rotation-exchange network — a trivalent variant of the star graph. InProc. Symp. Frontiers of Massively Parallel Computation, Feb. 1999, pp.302–309.

  8. Vadapalli P, Srimani K. A new family of Cayley graph interconnection network of constant degree four.IEEE Trans. Parallel and Distributed Systems, Jan. 1996, 7(1): 26–32.

    Article  Google Scholar 

  9. Pradhan D K, Reddy S M. A fault tolerant communication architecture for distributed systems.IEEE Trans. Computer, September 1982, C-31 (9): 863–870.

    Article  MATH  MathSciNet  Google Scholar 

  10. Leland W E, Solomon M H. Dense trivalent graphs for processor interconnection.IEEE Trans. Computers, March 1982, 31(3): 219–222.

    Article  MATH  MathSciNet  Google Scholar 

  11. Hoffman C. Group Theoretic Algorithm and Graph Isomorphism. New York, Springer-Verlag, 1982.

    Google Scholar 

  12. Alspach B. Cayley graphs with optimal fault tolerance.IEEE Trans. Computers, October 1992, 41(10): 1337–1340.

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Shu-Ming Zhou.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Zhou, SM., Xiao, WJ. A new family of interconnection networks of fixed degree three. J. Comput. Sci. & Technol. 19, 218–223 (2004). https://doi.org/10.1007/BF02944800

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02944800

Keywords

Navigation