On the topological properties of grid-based interconnection networks: Surface area and volume of radial spheres

H. Sarbazi-Azad, A. Khonsari, M. Ould-Khaoua

Research output: Contribution to journalArticle

4 Citations (Scopus)

Abstract

Grid-based networks (or grids for short), such as meshes and tori, have been the underlying topology for many multicomputers, and have been extensively studied in the past as a graph topology. In this paper, we investigate some topological properties of grids without boundary wrap-around (meshes) and with boundary wrap-around (tori). In particular, we study the problem of finding the number of nodes located at/within a given distance from a given node (surface area/volume) in the network and derive some expressions for computing such a number. Furthermore, we provide similar expressions that improve on previous results already reported in the literature for some special cases of grids, notably hypercubes and k-ary n-cubes. We also show some applications of the derived expressions in analytical performance modelling of some grid-based networks under uniform and hotspot traffic loads.

Original languageEnglish
Pages (from-to)726-737
Number of pages12
JournalComputer Journal
Volume54
Issue number5
DOIs
Publication statusPublished - May 2011

Fingerprint

Topology

Keywords

  • combinatorial properties
  • hypercubes
  • interconnection networks
  • k-ary n-cubes
  • meshes
  • multicomputers
  • topology
  • tori

ASJC Scopus subject areas

  • Computer Science(all)

Cite this

On the topological properties of grid-based interconnection networks : Surface area and volume of radial spheres. / Sarbazi-Azad, H.; Khonsari, A.; Ould-Khaoua, M.

In: Computer Journal, Vol. 54, No. 5, 05.2011, p. 726-737.

Research output: Contribution to journalArticle

@article{2f99916f78544fc8b184e2d1453cdbfb,
title = "On the topological properties of grid-based interconnection networks: Surface area and volume of radial spheres",
abstract = "Grid-based networks (or grids for short), such as meshes and tori, have been the underlying topology for many multicomputers, and have been extensively studied in the past as a graph topology. In this paper, we investigate some topological properties of grids without boundary wrap-around (meshes) and with boundary wrap-around (tori). In particular, we study the problem of finding the number of nodes located at/within a given distance from a given node (surface area/volume) in the network and derive some expressions for computing such a number. Furthermore, we provide similar expressions that improve on previous results already reported in the literature for some special cases of grids, notably hypercubes and k-ary n-cubes. We also show some applications of the derived expressions in analytical performance modelling of some grid-based networks under uniform and hotspot traffic loads.",
keywords = "combinatorial properties, hypercubes, interconnection networks, k-ary n-cubes, meshes, multicomputers, topology, tori",
author = "H. Sarbazi-Azad and A. Khonsari and M. Ould-Khaoua",
year = "2011",
month = "5",
doi = "10.1093/comjnl/bxq011",
language = "English",
volume = "54",
pages = "726--737",
journal = "Computer Journal",
issn = "0010-4620",
publisher = "Oxford University Press",
number = "5",

}

TY - JOUR

T1 - On the topological properties of grid-based interconnection networks

T2 - Surface area and volume of radial spheres

AU - Sarbazi-Azad, H.

AU - Khonsari, A.

AU - Ould-Khaoua, M.

PY - 2011/5

Y1 - 2011/5

N2 - Grid-based networks (or grids for short), such as meshes and tori, have been the underlying topology for many multicomputers, and have been extensively studied in the past as a graph topology. In this paper, we investigate some topological properties of grids without boundary wrap-around (meshes) and with boundary wrap-around (tori). In particular, we study the problem of finding the number of nodes located at/within a given distance from a given node (surface area/volume) in the network and derive some expressions for computing such a number. Furthermore, we provide similar expressions that improve on previous results already reported in the literature for some special cases of grids, notably hypercubes and k-ary n-cubes. We also show some applications of the derived expressions in analytical performance modelling of some grid-based networks under uniform and hotspot traffic loads.

AB - Grid-based networks (or grids for short), such as meshes and tori, have been the underlying topology for many multicomputers, and have been extensively studied in the past as a graph topology. In this paper, we investigate some topological properties of grids without boundary wrap-around (meshes) and with boundary wrap-around (tori). In particular, we study the problem of finding the number of nodes located at/within a given distance from a given node (surface area/volume) in the network and derive some expressions for computing such a number. Furthermore, we provide similar expressions that improve on previous results already reported in the literature for some special cases of grids, notably hypercubes and k-ary n-cubes. We also show some applications of the derived expressions in analytical performance modelling of some grid-based networks under uniform and hotspot traffic loads.

KW - combinatorial properties

KW - hypercubes

KW - interconnection networks

KW - k-ary n-cubes

KW - meshes

KW - multicomputers

KW - topology

KW - tori

UR - http://www.scopus.com/inward/record.url?scp=79955793704&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=79955793704&partnerID=8YFLogxK

U2 - 10.1093/comjnl/bxq011

DO - 10.1093/comjnl/bxq011

M3 - Article

AN - SCOPUS:79955793704

VL - 54

SP - 726

EP - 737

JO - Computer Journal

JF - Computer Journal

SN - 0010-4620

IS - 5

ER -