A Refined Model for Performance Analysis of Buffered Banyan Networks with and without Priority Control
スポンサーリンク
概要
- 論文の詳細を見る
The optimistic analytical results for performance analysis of buffered banyan networks are mainly due to certain independence assumptions used for simplifying analysis. To capture more effects of cell correlation, a refined analytical model for both single-buffered and multiple buffered banyan networks is proposed in this paper. When cell output contention occurs at a 2×2 switch element, two contention resolution schemes are used. One is based on randomly choosing the winning cell and anothcr is to give priority to the cell which has been delayed in the current buffer for at least one stage cycle. The switch throughput, cell transfer delay and cell delay deviation for single-buffered banyan networks with and without using priority scheme are derived. Then the model is generalized to multiple buffered banyan networks where analytical expressions for throughput and delay are obtained. We show that using the priority scheme the cell delay deviation is reduced and the influence on throughput performance is insignificant. The results obtained from our analytical model are compared with the simulations and good agreement is observed. Comparisons with some proposed analytical models in the literature reveal that our model is more accurate and powerful in predicting the performance of buffered banyan networks.
- 社団法人電子情報通信学会の論文
- 1999-01-25
著者
-
YEUNG Kwan
Department of Electronic Engineering, City University of Hong Kong
-
Chan Sammy
Department Of Electronic Engineering City University Of Hong Kong
-
Yeung Kwan
Department Of Electronic Engineering City University Of Hong Kong
-
Chan King-sun
Department Of Electronic Engineering City University Of Hong Kong
関連論文
- Performance Analysis of Lookahead Scheduling Algorithm for Input-Buffered Packet Switches
- A Refined Model for Performance Analysis of Buffered Banyan Networks with and without Priority Control