Performance Evaluation - Special issue: Distributed systems performance
| Hi-index | 0.00 |
This study presents a more realistic performance modelfor k-ary n-cube networks under bursty traffic. Thevalidity of the model is demonstrated by comparinganalytical results to those obtained through simulationexperiments of the actual systems. The proposed model isthen used to investigate the implications of bursty trafficon network performance. The results reveal that theperformance of k-ary n-cubes degrades considerably in thepresence of bursty traffic, stressing the great need for newnetwork architectures that can efficiently support this typeof traffic. This study also shows that increasing thenumber of virtual channels can reduce the impact of burstytraffic and thus improve network performance.