Performance analysis of k-ary n-cube networks with pipelined circuit switching

G. Min*, H. Sarbazi-Azad, M. Ould-Khaoua

*المؤلف المقابل لهذا العمل

نتاج البحث: المساهمة في مجلةArticleمراجعة النظراء

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


Several existing studies have revealed that pipelined circuit switching (or PCS for short) can provide superior performance characteristics over wormhole switching. This paper proposes a new analytical model for PCS in high-radix high-dimensional k-ary n-cubes augmented with virtual channel support. The model uses Random Walk Theory to analyse the backtracking actions of the message header during the path set-up phase, and M/G/1 queueing systems to compute the mean waiting time that a message experiences at a source node before entering the network. Results from simulation experiments confirm that the proposed model exhibits a good degree of accuracy for various network sizes and under different operating conditions.

اللغة الأصليةEnglish
الصفحات (من إلى)111-126
عدد الصفحات16
دوريةInternational Journal of High Speed Computing
مستوى الصوت11
رقم الإصدار2
المعرِّفات الرقمية للأشياء
حالة النشرPublished - يونيو 2000
منشور خارجيًانعم

ASJC Scopus subject areas

  • ???subjectarea.asjc.2600.2614???
  • ???subjectarea.asjc.1700.1703???


أدرس بدقة موضوعات البحث “Performance analysis of k-ary n-cube networks with pipelined circuit switching'. فهما يشكلان معًا بصمة فريدة.

قم بذكر هذا