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

Geyong Min, M. Ould-Khaoua

نتاج البحث

4 اقتباسات (Scopus)

ملخص

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.

اللغة الأصليةEnglish
عنوان منشور المضيفProceedings - International Parallel and Distributed Processing Symposium, IPDPS 2002
ناشرInstitute of Electrical and Electronics Engineers Inc.
الصفحات383-390
عدد الصفحات8
رقم المعيار الدولي للكتب (المطبوع)0769515738, 9780769515731
المعرِّفات الرقمية للأشياء
حالة النشرPublished - 2002
الحدث16th International Parallel and Distributed Processing Symposium, IPDPS 2002 - Ft. Lauderdale
المدة: أبريل ١٥ ٢٠٠٢أبريل ١٩ ٢٠٠٢

Other

Other16th International Parallel and Distributed Processing Symposium, IPDPS 2002
الدولة/الإقليمUnited States
المدينةFt. Lauderdale
المدة٤/١٥/٠٢٤/١٩/٠٢

ASJC Scopus subject areas

  • ???subjectarea.asjc.1700.1705???
  • ???subjectarea.asjc.2600.2611???

بصمة

أدرس بدقة موضوعات البحث “A performance model for k-ary n-cube networks with self-similar traffic'. فهما يشكلان معًا بصمة فريدة.

قم بذكر هذا