Performance analysis of wormhole switching in k-ary n-cubes under multimedia traffic

Many recent studies have revealed that the traffic generated by multimedia applications exhibits a high degree of burstiness and possesses strong correlation in the number of message arrivals between adjacent time intervals, which can significantly affect network performance. However all existing performance models for multicomputer networks have assumed the Poisson arrival process, which has been shown on many occasions to be unable to capture the nature of multimedia traffic. This paper proposes the first analytical model for wormhole switching in k-ary n-cube networks under multimedia traffic based on the well-known correlated Markov-modulated Poisson process (MMPP). Results obtained from simulation experiments confirm that the proposed model exhibits a good degree of accuracy for various network sizes and under different operating conditions.