This Article 
 Bibliographic References 
 Add to: 
On Multistage Interconnection Networks with Small Clock Cycles
January 1995 (vol. 6 no. 1)
pp. 86-93

Abstract—In packet switching using multistage interconnection networks (MIN's), it is generally assumed that the packet movements successively propagate from the last stage to the first stage in one network cycle. Ding and Bhuyan, however, has shown that the network performance can be significantly improved if the packet movements are confined within each pair of adjacent stages using small clock cycles. In this short note, we present a model for estimating the performance of multibuffered MIN's employing the approach. Using the model, the relative effectiveness of the approach is identified compared to the traditional design.

Index Terms—Big and small clock cycles, delay, multistage interconnection networks, packet switching, throughput.

[1] L. R. Goke and G. J. Lipovski,“Banyan networks for partitioning multiprocessor systems,”inFirst Ann. Symp. Comput. Archit., 1973, pp. 21–28.
[2] CCITT Recommendation I.121,“Broadband aspects of ISDN,”Blue Book, vol. III.7, Geneva, Switzerland, 1989.
[3] J. S. Turner,“Design of an integrated services packet network,”presented at theNinth Data Commun. Symp., inACM SigComm Comput. Commun. Rev.,vol. 15, pp. 124–133, Sept. 1985.
[4] H. Y. Youn and C. Chevli,“Local hot spot control with bypassing for multistage interconnection networks,”inProc. 1991 Symp. Appl. Computing, Apr. 1991, pp. 273–282.
[5] S. L. Scott and G. S. Sohi,“Using feedback to control tree saturation in multistage interconnection networks,”inProc. 16th Annu. Int.. Symp. Comput. Archit., 1989, pp. 167–176.
[6] T. H. Theimer, E. P. Rathgeb, and M. N. Huber,“Performance analysis of buffered banyan networks,”IEEE Trans. Commun., vol. C-39, pp. 269–277, Feb. 1991.
[7] J. H. Patel,“Performance of processor-memory interconnections for multiprocessors,”IEEE Trans. Comput.,vol. C-30, pp. 771–780, Oct. 1981.
[8] C. P. Kruskal and M. Snir,“The performance of multistage interconnection networks for multiprocessors,”IEEE Trans. Comput.,vol. C-32, pp. 1091–1098, Dec. 1983.
[9] A. Varma and C. S. Raghavendra,“Performance analysis of a redundant-path interconnection network,”inProc. 1985 Int. Conf. Parallel Processing, 1985, pp. 474–479.
[10] M. Kumar and J. R. Jump,“Performance of unbuffered shuffle-exchange networks,”IEEE Trans. Comput.,vol. C-35, pp. 573–578, June 1986.
[11] D. M. Dias and J. R. Jump,“Analysis and simulation of buffered delta networks,”IEEE Trans. Comput.,vol. C-30, pp. 273–282, Apr. 1981.
[12] Y. C. Jenq,“Performance analysis of a packet switch based on single-buffered banyan network,”IEEE J. Select. Areas Commun.,vol. SAC-3, pp. 1014–1021, Dec. 1983.
[13] H. S. Yoon, K. Y. Lee, and M. T. Liu,“Performance analysis of multibuffered packet-switching networks in multiprocessor systems,”IEEE Trans. Comput., vol. C-39, pp. 319–327, Mar. 1990.
[14] S. H. Hsiao and C. Y. R. Chen,“Performance analysis of single-buffered multistage interconnection networks,”inProc. Third IEEE Symp. Parallel and Distrib. Processing, Dec. 1991, pp. 864–867.
[15] Y. Mun and H. Y. Youn,“Performance analysis of finite buffered multistage interconnection networks,”IEEE Trans. Comput., vol. 43, no. 2, pp. 153–162, Feb. 1994.
[16] J. Ding and L. N. Bhuyan,“Finite buffer analysis of multistage interconnection networks,”IEEE Trans. Comput., vol. 43, no. 2, pp. 243–347, Feb. 1994.
[17] T. Liu and L Kleinrock,“Performance analysis of finite-buffered multistage interconnection networks with a general traffic pattern,”in1991 ACM SIGMETRICS Conf.,San Diego, CA, May 1991, pp. 68–78.
[18] D. C. Little,“A proof of the queueing formula${L= \lambda W}$,”Operat. Res.,vol. 9, pp. 383–387, 1961.

Hee Yong Youn, Youngsong Mun, "On Multistage Interconnection Networks with Small Clock Cycles," IEEE Transactions on Parallel and Distributed Systems, vol. 6, no. 1, pp. 86-93, Jan. 1995, doi:10.1109/71.363408
Usage of this product signifies your acceptance of the Terms of Use.