Approximate performance model of a partially adaptive routing algorithm in hypercubes

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

Although several partially adaptive routing algorithms have been proposed in the literature, there has been hardly any study that describes analytical models for these algorithms. This paper proposes an approximate analytical model for obtaining latency measures in the hypercube with partially adaptive routing, based on the direction restriction model proposed by Boura and Das. Simulation experiments reveal that the analytical model yields accurate latency results.

Original languageEnglish
Pages (from-to)185-190
Number of pages6
JournalMicroprocessors and Microsystems
Volume23
Issue number4
DOIs
Publication statusPublished - Oct 11 1999

Fingerprint

Routing algorithms
Adaptive algorithms
Analytical models
Experiments

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Hardware and Architecture
  • Software
  • Control and Systems Engineering
  • Electrical and Electronic Engineering

Cite this

Approximate performance model of a partially adaptive routing algorithm in hypercubes. / Ould-Khaoua, M.

In: Microprocessors and Microsystems, Vol. 23, No. 4, 11.10.1999, p. 185-190.

Research output: Contribution to journalArticle

@article{b3a6ce25e02b461f8b6fc715cf59dc5c,
title = "Approximate performance model of a partially adaptive routing algorithm in hypercubes",
abstract = "Although several partially adaptive routing algorithms have been proposed in the literature, there has been hardly any study that describes analytical models for these algorithms. This paper proposes an approximate analytical model for obtaining latency measures in the hypercube with partially adaptive routing, based on the direction restriction model proposed by Boura and Das. Simulation experiments reveal that the analytical model yields accurate latency results.",
author = "M. Ould-Khaoua",
year = "1999",
month = "10",
day = "11",
doi = "10.1016/S0141-9331(99)00046-0",
language = "English",
volume = "23",
pages = "185--190",
journal = "Microprocessors and Microsystems",
issn = "0141-9331",
publisher = "Elsevier",
number = "4",

}

TY - JOUR

T1 - Approximate performance model of a partially adaptive routing algorithm in hypercubes

AU - Ould-Khaoua, M.

PY - 1999/10/11

Y1 - 1999/10/11

N2 - Although several partially adaptive routing algorithms have been proposed in the literature, there has been hardly any study that describes analytical models for these algorithms. This paper proposes an approximate analytical model for obtaining latency measures in the hypercube with partially adaptive routing, based on the direction restriction model proposed by Boura and Das. Simulation experiments reveal that the analytical model yields accurate latency results.

AB - Although several partially adaptive routing algorithms have been proposed in the literature, there has been hardly any study that describes analytical models for these algorithms. This paper proposes an approximate analytical model for obtaining latency measures in the hypercube with partially adaptive routing, based on the direction restriction model proposed by Boura and Das. Simulation experiments reveal that the analytical model yields accurate latency results.

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

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

U2 - 10.1016/S0141-9331(99)00046-0

DO - 10.1016/S0141-9331(99)00046-0

M3 - Article

VL - 23

SP - 185

EP - 190

JO - Microprocessors and Microsystems

JF - Microprocessors and Microsystems

SN - 0141-9331

IS - 4

ER -