Journal article

Properties of a hierarchical network based on the star graph

Imani N, Sarbazi-Azad H ...see all

Information Sciences, vol. 180, issue 14 (2010) pp. 2802-2813

  • 2

    Readers

    Mendeley users who have this article in their library.
  • 5

    Citations

    Citations of this article.
Sign in to save reference

Abstract

This paper introduces a new class of interconnection networks named star-pyramid. An n-level star-pyramid is formed by piling up star graphs of dimensions 1 to n in a hierarchy, connecting any node in each i-dimensional star, 1 < i ≤ n, to a node in the (i - 1)-dimensional star whose index is reached by removing the i symbol from the index of the former node in the i-dimensional star graph. Having extracted the properties of the new topology, featuring topological properties, a minimal routing algorithm, a simple but efficient broadcast algorithm, Hamiltonicity and pancyclicity, we then compare the network properties of the proposed topology and the well-known pyramid topology. We show that the star-pyramid has some more attractive properties than its equivalent pyramid. Finally, we propose two variants of star-pyramid, namely the generic star-pyramid and wrapped star-pyramid, as topologies with improved scalability, fault-tolerance, and diameter. © 2010 Published by Elsevier Inc.

Author-supplied keywords

  • Interconnection networks
  • Multicomputers
  • Pyramid
  • Star graph
  • Topological properties

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document

Get full text

Authors

  • Navid Imani

  • Hamid Sarbazi-Azad

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free