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.
N1 - Funding Information:
The research was supported in part by the Nuffield Foundation through Grant NAL/00682/G, and the UK EPSRC Grant EP/C525027/1.
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
SN - 0920-8542
VL - 35
SP - 245
EP - 258
JO - Journal of Supercomputing
JF - Journal of Supercomputing
IS - 3
ER -