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
AN - SCOPUS:12444250018
SN - 0769521320
SN - 9780769521329
T3 - Proceedings - International Parallel and Distributed Processing Symposium, IPDPS 2004 (Abstracts and CD-ROM)
SP - 3441
EP - 3448
BT - Proceedings - 18th International Parallel and Distributed Processing Symposium, IPDPS 2004 (Abstracts and CD-ROM)
T2 - Proceedings - 18th International Parallel and Distributed Processing Symposium, IPDPS 2004 (Abstracts and CD-ROM)
Y2 - 26 April 2004 through 30 April 2004
ER -