Accurate analytical model of adaptive wormhole routing in k-ary n-cubes interconnection networks

H. Sarbazi-Azad, M. Ould-Khaoua, L. M. MacKenzie

Research output: Contribution to journalArticle

56 Citations (Scopus)

Abstract

Many fully adaptive algorithms have been proposed in the literature over the past decade. The performance characteristics of most of these algorithms have been analyzed by means of software simulation only. This paper proposes an analytical model to predict message latency in wormhole-routed k-ary n-cubes with fully adaptive routing. The analysis focuses Duato's fully adaptive routing algorithm, which is widely accepted as the most general algorithm for achieving adaptivity in wormhole-routed networks while allowing for an efficient router implementation. The proposed model is general in that it exhibits a good degree of accuracy for various network sizes and under different operating conditions.

Original languageEnglish
Pages (from-to)165-179
Number of pages15
JournalPerformance Evaluation
Volume43
Issue number2-3
DOIs
Publication statusPublished - Feb 2001

Fingerprint

Wormhole Routing
K-ary N-cubes
Adaptive Routing
Wormhole
Interconnection Networks
Adaptive algorithms
Adaptive Algorithm
Analytical Model
Analytical models
Adaptivity
Routing algorithms
Simulation Software
Routing Algorithm
Router
Routers
Latency
Predict
Model

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Software
  • Modelling and Simulation
  • Statistics and Probability

Cite this

Accurate analytical model of adaptive wormhole routing in k-ary n-cubes interconnection networks. / Sarbazi-Azad, H.; Ould-Khaoua, M.; MacKenzie, L. M.

In: Performance Evaluation, Vol. 43, No. 2-3, 02.2001, p. 165-179.

Research output: Contribution to journalArticle

@article{263257e227bd4d5f9f4e30ab0b0442d5,
title = "Accurate analytical model of adaptive wormhole routing in k-ary n-cubes interconnection networks",
abstract = "Many fully adaptive algorithms have been proposed in the literature over the past decade. The performance characteristics of most of these algorithms have been analyzed by means of software simulation only. This paper proposes an analytical model to predict message latency in wormhole-routed k-ary n-cubes with fully adaptive routing. The analysis focuses Duato's fully adaptive routing algorithm, which is widely accepted as the most general algorithm for achieving adaptivity in wormhole-routed networks while allowing for an efficient router implementation. The proposed model is general in that it exhibits a good degree of accuracy for various network sizes and under different operating conditions.",
author = "H. Sarbazi-Azad and M. Ould-Khaoua and MacKenzie, {L. M.}",
year = "2001",
month = "2",
doi = "10.1016/S0166-5316(00)00049-3",
language = "English",
volume = "43",
pages = "165--179",
journal = "Performance Evaluation",
issn = "0166-5316",
publisher = "Elsevier",
number = "2-3",

}

TY - JOUR

T1 - Accurate analytical model of adaptive wormhole routing in k-ary n-cubes interconnection networks

AU - Sarbazi-Azad, H.

AU - Ould-Khaoua, M.

AU - MacKenzie, L. M.

PY - 2001/2

Y1 - 2001/2

N2 - Many fully adaptive algorithms have been proposed in the literature over the past decade. The performance characteristics of most of these algorithms have been analyzed by means of software simulation only. This paper proposes an analytical model to predict message latency in wormhole-routed k-ary n-cubes with fully adaptive routing. The analysis focuses Duato's fully adaptive routing algorithm, which is widely accepted as the most general algorithm for achieving adaptivity in wormhole-routed networks while allowing for an efficient router implementation. The proposed model is general in that it exhibits a good degree of accuracy for various network sizes and under different operating conditions.

AB - Many fully adaptive algorithms have been proposed in the literature over the past decade. The performance characteristics of most of these algorithms have been analyzed by means of software simulation only. This paper proposes an analytical model to predict message latency in wormhole-routed k-ary n-cubes with fully adaptive routing. The analysis focuses Duato's fully adaptive routing algorithm, which is widely accepted as the most general algorithm for achieving adaptivity in wormhole-routed networks while allowing for an efficient router implementation. The proposed model is general in that it exhibits a good degree of accuracy for various network sizes and under different operating conditions.

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

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

U2 - 10.1016/S0166-5316(00)00049-3

DO - 10.1016/S0166-5316(00)00049-3

M3 - Article

VL - 43

SP - 165

EP - 179

JO - Performance Evaluation

JF - Performance Evaluation

SN - 0166-5316

IS - 2-3

ER -