Skip to main content
SpringerLink
Log in

Hyper-Star Graph: A New Interconnection Network Improving the Network Cost of the Hypercube

  • Conference paper
  • First Online:
EurAsia-ICT 2002: Information and Communication Technology (EurAsia-ICT 2002)

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

Included in the following conference series:

Abstract

In this paper, we introduce the hyper-star graph HS(n,k) as a new interconnection network, and discuss its properties such as fault-tolerance, scalability, isomorphism, routing algorithm, and diameter. A hyper-star graph has merits when degree × diameter is used as a desirable quality measure of an interconnection network because it has a small degree and diameter. We also introduce a variation of HS(2k,k), folded hyper-star graphs FHS(2k,k) to further improve the cost degree × diameter of a hypercube: when FHS(2k,k) and an n-dimensional hypercube have the same number of nodes, degree × diameter of FHS(2k,k) is less than (k + 1)(⌈logK⌉ +1) whereas a hypercube is n 2, where K = ( 2k). It shows that FHS(2k,k) is superior to a hypercube and its variations in terms of the cost, degree × diameterk

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. Abraham, S.: The Twisted Cube Topology for Multiprocessor: A Study in Network Asymmetry. J. Parallel and Distributed Computing, Vol. 13, (1991) 104–110

    Article  Google Scholar 

  2. Akers, S.B., Harel, D., Krishnamurthy, B.: The Star Graph: An Attractive Alternative to The n-Cube. Proc. Int’l Conf. on Parallel Processing, Aug, (1987) 393–400

    Google Scholar 

  3. Akers, S.B., Krishnamurthy, B.: A Group-Theoretic Model for Symmetric Interconnection Network. IEEE Trans. Comput., Vol. 38, No. 4, (1989) 555–565

    Article  MATH  MathSciNet  Google Scholar 

  4. Efe, K.: A Variation on the Hypercube with Lower Diameter. IEEE Trans. Comput., Vol. 40, No. 11, (1991) 1312–1316

    Article  Google Scholar 

  5. Harary, F., Hayes, J.P., Wu, H.-J.: A Survey of the Theory of Hypercube Graphs. Comput. Math. Appl., Vol. 15, (1988) 277–289

    Google Scholar 

  6. Lai, C.-N., Chen, G.-H., Duh, D.-R.: Constructing One-to-Many Disjoint Paths in Folded Hypercubes. IEEE Trans. Comput., Vol. 51, No. 1, (2002) 33–45

    Article  MathSciNet  Google Scholar 

  7. Parhami, B., Kwai, D.-M.: A Unified Formulation of Honeycomb and Diamond Networks. IEEE Trans. Parallel and Distributed Systems, Vol. 12, No. 1, Jan. (2001) 74–80

    Article  Google Scholar 

  8. Yun, S.-K., Park, K.-H.: Comments on ‘Hierarchical Cubic Networks’. IEEE Trans. Parallel and Distributed Systems, Vol. 9, No. 4, (1998) 410–414

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Education, Sunchon National University, 315 Maegok-dong, Sunchon, Chonnam, 540-742, Korea

    Hyeong-Ok Lee

  2. Department of Computer Science, Sunchon National University, 315 Maegok-dong, Sunchon, Chonnam, 540-742, Korea

    Jong-Seok Kim

  3. Department of Computer Science, Texas A&M University, College Station, TX, 77843-3112, USA

    Eunseuk Oh

  4. Department of Computer Science, Chonnam National University, 300 Yongbong-dong, Buk-gu, Kwangju, 500-757, Korea

    Hyeong-Seok Lim

Authors
  1. Hyeong-Ok Lee
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jong-Seok Kim
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Eunseuk Oh
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Hyeong-Seok Lim
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Faculty of Mathematics and Computer Science Computer Science Department, Shahid Bahonar University, 22 Bahman Bulvard, Kerman, Iran

    Hassan Shafazand

  2. Fraunhofer IPSI, Dolivostr. 15, 64293, Darmstadt, Germany

    Hassan Shafazand

  3. Institute of Software Technology, Vienna University of Technology, Favoritenstr. 9/188, 1040, Vienna, Austria

    A. Min Tjoa

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lee, HO., Kim, JS., Oh, E., Lim, HS. (2002). Hyper-Star Graph: A New Interconnection Network Improving the Network Cost of the Hypercube. In: Shafazand, H., Tjoa, A.M. (eds) EurAsia-ICT 2002: Information and Communication Technology. EurAsia-ICT 2002. Lecture Notes in Computer Science, vol 2510. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36087-5_99

Download citation

  • DOI: https://doi.org/10.1007/3-540-36087-5_99

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-00028-0

  • Online ISBN: 978-3-540-36087-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation