PERFORMANCE ANALYSIS OF k-ARY n-CUBE NETWORKS WITH PIPELINED CIRCUIT SWITCHING

摘要: 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 in high-radix high-dimensional k-ary n-cubes augmented with virtual channel support. The uses Random Walk Theory to analyse the backtracking actions of message header during path set-up phase, and M/G/1 queueing systems compute mean waiting time experiences at source node before entering network. Results from simulation experiments confirm proposed exhibits good degree accuracy various network sizes under different operating conditions.