Introduction to Switching Networks
Vaclav Edvard Benes · 1987
We present a broad tutorial description of connecting network concepts and structures, divided into three categories: combinatorial, probabilistic, and operational, each with suitable examples. Among the combinatorial aspects we single out the semi-lattice of network states, notions of mismatch and overflow, group theory applications such as the reduction of states by symmetries, construction of nonblocking networks, and topological characterization of such network properties as rearrangeability and nonblocking. The probabilistic ideas we cover are (i) modeling of network operation, (ii) definition of loss (probability of blocking), (iii) load-loss relationships. Finally, such operational issues as good routing choices and time-space swaps and shuffles (time-division and/or packet switching) are touched on.