Cross-Point Comparison of Multistage Non-Blocking Technologies

Multistage switching networks play important role in communication and computer network. They make communication nodes connect to each other. In computer hardware switches connect processors and memories. Initially, switches are arranged as one stage interconnection. As clients are growing, multistage is a must. The finding Clos multistage switching initiated multistage technologies. Benes improves Clos by reducing number of cross-points by using a 2 x 2 switch element and call re-routing. Batcher improves the technology by other way which is sorting destination address. Banyan is then joined to Batcher to simplify routing control. This paper analyses the number of cross-point required in Clos, Benes and Batcher Banyan to accomplish multistage switching architecture of 16, 64, 256, 1024 and 2048 input/output ports. As results, Clos cross-point is in averages 495.24% higher than Benes and 160.30% higher than Batcher Banyan. Clos blocking probabilities are closed to zero. Benes blocking probabilities are conditionally zero. Batcher Banyan blocking probabilities are zero.

[1]  Robbi Rahim,et al.  Dynamic Key Matrix of Hill Cipher Using Genetic Algorithm , 2016 .

[2]  Kenneth E. Batcher,et al.  Sorting networks and their applications , 1968, AFIPS Spring Joint Computing Conference.

[3]  Tri Listyorini,et al.  A prototype fire detection implemented using the internet og things and fuzzy logic , 2018 .

[4]  D. C. Opferman,et al.  On a class of rearrangeable switching networks part I: Control algorithm , 1971 .

[5]  Janak H. Patel.  Performance of Processor-Memory Interconnections for Multiprocessors , 1981, IEEE Transactions on Computers.

[6]  Syed Abdul Rahman Al-Haddad,et al.  Introduction and analysis of optimal routing algorithm in Benes networks , 2014 .

[7]  Pierre Boulet,et al.  Modeling of Topologies of Interconnection Networks based on Multidimensional Multiplicity , 2007 .

[8]  Muhammad Ramlee Kamarudin,et al.  A Stacked planar antenna with switchable small grid pixel structure for directive high beam steering broadside radiation , 2018 .

[9]  Madihally J. Narasimha.  The Batcher-banyan self-routing network: universality and simplification , 1988, IEEE Trans. Commun..

[10]  V. Benes.  On rearrangeable three-stage connecting networks , 1962 .

[11]  Sourav Mukhopadhyay,et al.  Matrix-Based Nonblocking Routing Algorithm for Beneš Networks , 2009, 2009 Computation World: Future Computing, Service Computation, Cognitive, Adaptive, Content, Patterns.

[12]  Si-Qing Zheng,et al.  Parallel routing algorithms for nonblocking electronic and photonic switching networks , 2005, IEEE Transactions on Parallel and Distributed Systems.

[13]  C. Y. Lee.  Analysis of switching networks , 1955 .

[14]  Leslie G. Valiant,et al.  A fast parallel algorithm for routing in permutation networks , 1981, IEEE Transactions on Computers.

[15]  William J. Dally,et al.  Principles and Practices of Interconnection Networks , 2004 .

[16]  Charles Clos,et al.  A study of non-blocking switching networks , 1953 .

[17]  G. Jack Lipovski,et al.  Banyan networks for partitioning multiprocessor systems , 1998, ISCA '98.

[18]  Derek Lewis,et al.  Encyclopedia of information technology , 1992 .

[19]  Suherman,et al.  Multistage switching hardware and software implementations for student experiment purpose , 2018 .