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

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

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

7 Citations (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.

Original languageEnglish
Pages (from-to)111-126
Number of pages16
JournalInternational Journal of High Speed Computing
Issue number2
Publication statusPublished - Jun 2000
Externally publishedYes


  • Adaptive routing
  • Backtracking
  • Message latency
  • Multicomputers
  • Performance modelling
  • Queueing theory
  • Virtual channels

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computational Theory and Mathematics


Dive into the research topics of 'Performance analysis of k-ary n-cube networks with pipelined circuit switching'. Together they form a unique fingerprint.

Cite this