TY - GEN
T1 - A performance model for k-ary n-cube networks with self-similar traffic
AU - Min, Geyong
AU - Ould-Khaoua, M.
N1 - Publisher Copyright:
© 2002 IEEE.
PY - 2002
Y1 - 2002
N2 - Recently a number of studies have indicated that network traffic exhibits noticeable self-similar behaviour, i.e., traffic is bursty over a wide range of time scales. This fractal-like nature of traffic has received significant attention in the networking community as it has a considerable impact on queueing performance. Thus it is very necessary to examine the performance properties of interconnection networks in the presence of self-similar traffic before practical implementations show their potential faults. However, adopting the simulation approach to evaluate system performance under self-similar workloads may be very costly and time-consuming because the convergence of simulations to a steady state is often very slow as burstiness appears over many time scales. This paper proposes the first analytical performance model for k-ary n-cubes with self-similar traffic. The validity of the model is demonstrated by comparing analytical results to those obtained through simulation experiments of the actual system.
AB - Recently a number of studies have indicated that network traffic exhibits noticeable self-similar behaviour, i.e., traffic is bursty over a wide range of time scales. This fractal-like nature of traffic has received significant attention in the networking community as it has a considerable impact on queueing performance. Thus it is very necessary to examine the performance properties of interconnection networks in the presence of self-similar traffic before practical implementations show their potential faults. However, adopting the simulation approach to evaluate system performance under self-similar workloads may be very costly and time-consuming because the convergence of simulations to a steady state is often very slow as burstiness appears over many time scales. This paper proposes the first analytical performance model for k-ary n-cubes with self-similar traffic. The validity of the model is demonstrated by comparing analytical results to those obtained through simulation experiments of the actual system.
UR - http://www.scopus.com/inward/record.url?scp=84966501478&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84966501478&partnerID=8YFLogxK
U2 - 10.1109/IPDPS.2002.1015519
DO - 10.1109/IPDPS.2002.1015519
M3 - Conference contribution
AN - SCOPUS:84966501478
T3 - Proceedings - International Parallel and Distributed Processing Symposium, IPDPS 2002
SP - 383
EP - 390
BT - Proceedings - International Parallel and Distributed Processing Symposium, IPDPS 2002
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 16th International Parallel and Distributed Processing Symposium, IPDPS 2002
Y2 - 15 April 2002 through 19 April 2002
ER -