Stochastic analysis of deterministic routing algorithms in the presence of self-similar traffic

Geyong Min, Mohamed Ould-Khaoua, Demetres D. Kouvatsos, Irfan U. Awan

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

Many performance models for deterministic routing in multicomputer interconnection networks have been derived and analyzed under the assumption of the traditional Poisson stochastic arrival process, which is inherently unable to capture traffic self-similarity revealed by many real-world parallel applications. In an effort towards understanding the network performance under various traffic loads and different design alternatives, this paper presents an analytical model for dimension-ordered routing in k-ary n-cubes when subjected to self-similar traffic. As the service time, blocking probability and waiting time experienced by a message vary from a dimension to another, the design of such a model for dimension-ordered routing poses greater challenges. The developed analytical model is then used to investigate the efficiency of two different ways to organize virtual channels for deterministic routing and to evaluate the impact of self-similar traffic with various Hurst parameters on network performance.

Original languageEnglish
Pages (from-to)245-258
Number of pages14
JournalJournal of Supercomputing
Volume35
Issue number3
DOIs
Publication statusPublished - Mar 2006

Fingerprint

Stochastic Analysis
Deterministic Algorithm
Routing algorithms
Routing Algorithm
Telecommunication traffic
Routing
Traffic
Network performance
Analytical models
Network Performance
Analytical Model
Blocking probability
K-ary N-cubes
Virtual Channel
Hurst Parameter
Multicomputers
Blocking Probability
Parallel Applications
Interconnection Networks
Self-similarity

Keywords

  • Analytical modeling
  • Dimension-ordered routing
  • Interconnection networks
  • Message latency
  • Virtual channels

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Hardware and Architecture
  • Theoretical Computer Science
  • Computational Theory and Mathematics

Cite this

Stochastic analysis of deterministic routing algorithms in the presence of self-similar traffic. / Min, Geyong; Ould-Khaoua, Mohamed; Kouvatsos, Demetres D.; Awan, Irfan U.

In: Journal of Supercomputing, Vol. 35, No. 3, 03.2006, p. 245-258.

Research output: Contribution to journalArticle

Min, Geyong ; Ould-Khaoua, Mohamed ; Kouvatsos, Demetres D. ; Awan, Irfan U. / Stochastic analysis of deterministic routing algorithms in the presence of self-similar traffic. In: Journal of Supercomputing. 2006 ; Vol. 35, No. 3. pp. 245-258.
@article{735239b43f3c4ad4a080f5b56f4d283f,
title = "Stochastic analysis of deterministic routing algorithms in the presence of self-similar traffic",
abstract = "Many performance models for deterministic routing in multicomputer interconnection networks have been derived and analyzed under the assumption of the traditional Poisson stochastic arrival process, which is inherently unable to capture traffic self-similarity revealed by many real-world parallel applications. In an effort towards understanding the network performance under various traffic loads and different design alternatives, this paper presents an analytical model for dimension-ordered routing in k-ary n-cubes when subjected to self-similar traffic. As the service time, blocking probability and waiting time experienced by a message vary from a dimension to another, the design of such a model for dimension-ordered routing poses greater challenges. The developed analytical model is then used to investigate the efficiency of two different ways to organize virtual channels for deterministic routing and to evaluate the impact of self-similar traffic with various Hurst parameters on network performance.",
keywords = "Analytical modeling, Dimension-ordered routing, Interconnection networks, Message latency, Virtual channels",
author = "Geyong Min and Mohamed Ould-Khaoua and Kouvatsos, {Demetres D.} and Awan, {Irfan U.}",
year = "2006",
month = "3",
doi = "10.1007/s11227-006-4668-7",
language = "English",
volume = "35",
pages = "245--258",
journal = "Journal of Supercomputing",
issn = "0920-8542",
publisher = "Springer Netherlands",
number = "3",

}

TY - JOUR

T1 - Stochastic analysis of deterministic routing algorithms in the presence of self-similar traffic

AU - Min, Geyong

AU - Ould-Khaoua, Mohamed

AU - Kouvatsos, Demetres D.

AU - Awan, Irfan U.

PY - 2006/3

Y1 - 2006/3

N2 - Many performance models for deterministic routing in multicomputer interconnection networks have been derived and analyzed under the assumption of the traditional Poisson stochastic arrival process, which is inherently unable to capture traffic self-similarity revealed by many real-world parallel applications. In an effort towards understanding the network performance under various traffic loads and different design alternatives, this paper presents an analytical model for dimension-ordered routing in k-ary n-cubes when subjected to self-similar traffic. As the service time, blocking probability and waiting time experienced by a message vary from a dimension to another, the design of such a model for dimension-ordered routing poses greater challenges. The developed analytical model is then used to investigate the efficiency of two different ways to organize virtual channels for deterministic routing and to evaluate the impact of self-similar traffic with various Hurst parameters on network performance.

AB - Many performance models for deterministic routing in multicomputer interconnection networks have been derived and analyzed under the assumption of the traditional Poisson stochastic arrival process, which is inherently unable to capture traffic self-similarity revealed by many real-world parallel applications. In an effort towards understanding the network performance under various traffic loads and different design alternatives, this paper presents an analytical model for dimension-ordered routing in k-ary n-cubes when subjected to self-similar traffic. As the service time, blocking probability and waiting time experienced by a message vary from a dimension to another, the design of such a model for dimension-ordered routing poses greater challenges. The developed analytical model is then used to investigate the efficiency of two different ways to organize virtual channels for deterministic routing and to evaluate the impact of self-similar traffic with various Hurst parameters on network performance.

KW - Analytical modeling

KW - Dimension-ordered routing

KW - Interconnection networks

KW - Message latency

KW - Virtual channels

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

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

U2 - 10.1007/s11227-006-4668-7

DO - 10.1007/s11227-006-4668-7

M3 - Article

AN - SCOPUS:33645032212

VL - 35

SP - 245

EP - 258

JO - Journal of Supercomputing

JF - Journal of Supercomputing

SN - 0920-8542

IS - 3

ER -