A queuing model of dimension-ordered routing under self-similar traffic loads

G. Min, M. Ould-Khaoua, D. D. Kouvatsos, I. U. Awan

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Citations (Scopus)

Abstract

The efficiency of a large-scale multicomputer is critically dependent on the performance of its underlying interconnection network. Dimension-ordered routing has been employed to transmit messages in multicomputer networks as it requires a simple deadlock-avoidance algorithm, resulting in an efficient router implementation. The performance of this routing algorithm has been widely analysed under the assumption of the traditional Poisson arrival process, which is inherently unable to model traffic self-similarity revealed by many real-world applications. In an effort towards providing cost-effective tools that help investigating network performance under more realistic traffic loads, this paper proposes an analytical model for dimension-ordered routing in k-ary n-cube networks 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 with dimension-ordered routing, the design of this model poses greater challenges. The model validity is demonstrated by performance results obtained from Simulation experiments.

Original languageEnglish
Title of host publicationProceedings - International Parallel and Distributed Processing Symposium, IPDPS 2004 (Abstracts and CD-ROM)
Pages3441-3448
Number of pages8
Volume18
Publication statusPublished - 2004
EventProceedings - 18th International Parallel and Distributed Processing Symposium, IPDPS 2004 (Abstracts and CD-ROM) - Santa Fe, NM, United States
Duration: Apr 26 2004Apr 30 2004

Other

OtherProceedings - 18th International Parallel and Distributed Processing Symposium, IPDPS 2004 (Abstracts and CD-ROM)
CountryUnited States
CitySanta Fe, NM
Period4/26/044/30/04

Fingerprint

Telecommunication traffic
Blocking probability
Routing algorithms
Network performance
Routers
Analytical models
Costs
Experiments

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Min, G., Ould-Khaoua, M., Kouvatsos, D. D., & Awan, I. U. (2004). A queuing model of dimension-ordered routing under self-similar traffic loads. In Proceedings - International Parallel and Distributed Processing Symposium, IPDPS 2004 (Abstracts and CD-ROM) (Vol. 18, pp. 3441-3448)

A queuing model of dimension-ordered routing under self-similar traffic loads. / Min, G.; Ould-Khaoua, M.; Kouvatsos, D. D.; Awan, I. U.

Proceedings - International Parallel and Distributed Processing Symposium, IPDPS 2004 (Abstracts and CD-ROM). Vol. 18 2004. p. 3441-3448.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Min, G, Ould-Khaoua, M, Kouvatsos, DD & Awan, IU 2004, A queuing model of dimension-ordered routing under self-similar traffic loads. in Proceedings - International Parallel and Distributed Processing Symposium, IPDPS 2004 (Abstracts and CD-ROM). vol. 18, pp. 3441-3448, Proceedings - 18th International Parallel and Distributed Processing Symposium, IPDPS 2004 (Abstracts and CD-ROM), Santa Fe, NM, United States, 4/26/04.
Min G, Ould-Khaoua M, Kouvatsos DD, Awan IU. A queuing model of dimension-ordered routing under self-similar traffic loads. In Proceedings - International Parallel and Distributed Processing Symposium, IPDPS 2004 (Abstracts and CD-ROM). Vol. 18. 2004. p. 3441-3448
Min, G. ; Ould-Khaoua, M. ; Kouvatsos, D. D. ; Awan, I. U. / A queuing model of dimension-ordered routing under self-similar traffic loads. Proceedings - International Parallel and Distributed Processing Symposium, IPDPS 2004 (Abstracts and CD-ROM). Vol. 18 2004. pp. 3441-3448
@inproceedings{28dd0481b04842abb1b93c8d00911bcc,
title = "A queuing model of dimension-ordered routing under self-similar traffic loads",
abstract = "The efficiency of a large-scale multicomputer is critically dependent on the performance of its underlying interconnection network. Dimension-ordered routing has been employed to transmit messages in multicomputer networks as it requires a simple deadlock-avoidance algorithm, resulting in an efficient router implementation. The performance of this routing algorithm has been widely analysed under the assumption of the traditional Poisson arrival process, which is inherently unable to model traffic self-similarity revealed by many real-world applications. In an effort towards providing cost-effective tools that help investigating network performance under more realistic traffic loads, this paper proposes an analytical model for dimension-ordered routing in k-ary n-cube networks 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 with dimension-ordered routing, the design of this model poses greater challenges. The model validity is demonstrated by performance results obtained from Simulation experiments.",
author = "G. Min and M. Ould-Khaoua and Kouvatsos, {D. D.} and Awan, {I. U.}",
year = "2004",
language = "English",
isbn = "0769521320",
volume = "18",
pages = "3441--3448",
booktitle = "Proceedings - International Parallel and Distributed Processing Symposium, IPDPS 2004 (Abstracts and CD-ROM)",

}

TY - GEN

T1 - A queuing model of dimension-ordered routing under self-similar traffic loads

AU - Min, G.

AU - Ould-Khaoua, M.

AU - Kouvatsos, D. D.

AU - Awan, I. U.

PY - 2004

Y1 - 2004

N2 - The efficiency of a large-scale multicomputer is critically dependent on the performance of its underlying interconnection network. Dimension-ordered routing has been employed to transmit messages in multicomputer networks as it requires a simple deadlock-avoidance algorithm, resulting in an efficient router implementation. The performance of this routing algorithm has been widely analysed under the assumption of the traditional Poisson arrival process, which is inherently unable to model traffic self-similarity revealed by many real-world applications. In an effort towards providing cost-effective tools that help investigating network performance under more realistic traffic loads, this paper proposes an analytical model for dimension-ordered routing in k-ary n-cube networks 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 with dimension-ordered routing, the design of this model poses greater challenges. The model validity is demonstrated by performance results obtained from Simulation experiments.

AB - The efficiency of a large-scale multicomputer is critically dependent on the performance of its underlying interconnection network. Dimension-ordered routing has been employed to transmit messages in multicomputer networks as it requires a simple deadlock-avoidance algorithm, resulting in an efficient router implementation. The performance of this routing algorithm has been widely analysed under the assumption of the traditional Poisson arrival process, which is inherently unable to model traffic self-similarity revealed by many real-world applications. In an effort towards providing cost-effective tools that help investigating network performance under more realistic traffic loads, this paper proposes an analytical model for dimension-ordered routing in k-ary n-cube networks 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 with dimension-ordered routing, the design of this model poses greater challenges. The model validity is demonstrated by performance results obtained from Simulation experiments.

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

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

M3 - Conference contribution

SN - 0769521320

SN - 9780769521329

VL - 18

SP - 3441

EP - 3448

BT - Proceedings - International Parallel and Distributed Processing Symposium, IPDPS 2004 (Abstracts and CD-ROM)

ER -