A performance model for k-ary n-cube networks with self-similar traffic

Geyong Min, M. Ould-Khaoua

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

4 Citations (Scopus)

Abstract

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.

Original languageEnglish
Title of host publicationProceedings - International Parallel and Distributed Processing Symposium, IPDPS 2002
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages383-390
Number of pages8
ISBN (Print)0769515738, 9780769515731
DOIs
Publication statusPublished - 2002
Event16th International Parallel and Distributed Processing Symposium, IPDPS 2002 - Ft. Lauderdale, United States
Duration: Apr 15 2002Apr 19 2002

Other

Other16th International Parallel and Distributed Processing Symposium, IPDPS 2002
CountryUnited States
CityFt. Lauderdale
Period4/15/024/19/02

Fingerprint

K-ary N-cubes
Performance Model
Traffic
Fractals
Time Scales
Queueing
Interconnection Networks
Network Traffic
Networking
Analytical Model
Simulation Experiment
Workload
System Performance
Fractal
Simulation
Fault
Experiments
Necessary
Evaluate
Range of data

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Modelling and Simulation

Cite this

Min, G., & Ould-Khaoua, M. (2002). A performance model for k-ary n-cube networks with self-similar traffic. In Proceedings - International Parallel and Distributed Processing Symposium, IPDPS 2002 (pp. 383-390). [1015519] Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/IPDPS.2002.1015519

A performance model for k-ary n-cube networks with self-similar traffic. / Min, Geyong; Ould-Khaoua, M.

Proceedings - International Parallel and Distributed Processing Symposium, IPDPS 2002. Institute of Electrical and Electronics Engineers Inc., 2002. p. 383-390 1015519.

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

Min, G & Ould-Khaoua, M 2002, A performance model for k-ary n-cube networks with self-similar traffic. in Proceedings - International Parallel and Distributed Processing Symposium, IPDPS 2002., 1015519, Institute of Electrical and Electronics Engineers Inc., pp. 383-390, 16th International Parallel and Distributed Processing Symposium, IPDPS 2002, Ft. Lauderdale, United States, 4/15/02. https://doi.org/10.1109/IPDPS.2002.1015519
Min G, Ould-Khaoua M. A performance model for k-ary n-cube networks with self-similar traffic. In Proceedings - International Parallel and Distributed Processing Symposium, IPDPS 2002. Institute of Electrical and Electronics Engineers Inc. 2002. p. 383-390. 1015519 https://doi.org/10.1109/IPDPS.2002.1015519
Min, Geyong ; Ould-Khaoua, M. / A performance model for k-ary n-cube networks with self-similar traffic. Proceedings - International Parallel and Distributed Processing Symposium, IPDPS 2002. Institute of Electrical and Electronics Engineers Inc., 2002. pp. 383-390
@inproceedings{82bac46ea88c4d67a61f2bab0e82a121,
title = "A performance model for k-ary n-cube networks with self-similar traffic",
abstract = "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.",
author = "Geyong Min and M. Ould-Khaoua",
year = "2002",
doi = "10.1109/IPDPS.2002.1015519",
language = "English",
isbn = "0769515738",
pages = "383--390",
booktitle = "Proceedings - International Parallel and Distributed Processing Symposium, IPDPS 2002",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - GEN

T1 - A performance model for k-ary n-cube networks with self-similar traffic

AU - Min, Geyong

AU - Ould-Khaoua, M.

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

SN - 0769515738

SN - 9780769515731

SP - 383

EP - 390

BT - Proceedings - International Parallel and Distributed Processing Symposium, IPDPS 2002

PB - Institute of Electrical and Electronics Engineers Inc.

ER -