Banyan switch

This article has multiple issues. Please help improve it or discuss these issues on the talk page. (Learn how and when to remove these messages) This article needs to be updated. Please help update this article to reflect recent events or newly available information. (October 2023) This article needs additional citations for verification. Please help improve this article by adding citations to reliable sources. Unsourced material may be challenged and removed. Find sources: "Banyan switch" – news · newspapers · books · scholar · JSTOR (December 2009) (Learn how and when to remove this message) (Learn how and when to remove this message)

In electronics, a banyan switch is a complex crossover switch used in electrical or optical switches.

It is named for its resemblance to the roots of the banyan tree which cross over in complex patterns. Logical banyan switches are used in logic or signal pathways to crossover switching of signals onto new pathways.

They can be mechanical microelectromechanical systems, electrical or nonlinear optics. Their complexity depends on the topology of the individual switches in a switch matrix (how wide it is by how many 'plies' or layers of switches it takes), to implement a desired crossover logic.

Typical crossover matrices follow this formula: an N×N banyan switch uses (N/2) log₂ N elements. Other formulas are used for differing number of crossover layers, and scaling is possible, but becomes very large and complex with large N×N arrays. CAD can be used to take the drudgery out of creating these designs. A banyan network is implemented by interconnecting 2×2 switching networks in multiple and recursive stages.

The switches are measured by how many stages, and how many up/down sorters and crosspoints they have. Switches often have buffers built-in for faster switching. A typical switch may have:

1. A 2×2 and 4×4 down sorter^{[definition needed]}
2. Followed by an 8×8 up sorter^{[definition needed]}
3. Followed by a 2×2 crosspoint banyan switch network

This results in 3 level sorting for a 3-stage banyan network switch.^{[further explanation needed]}

Consider a 2×2 banyan switch, which requires (2/2) log₂ 2 = 1 switching element. This switch takes two inputs, numbered 0 and 1, and two outputs, numbered 0 and 1. Every packet that comes in has a header that contains one bit indicating what its destination is (either 0 or 1). If the switch reads the bit and it has value 0, it sends the packet to its higher output (which is 0 in this case), and to its lower output if the routing bit is one. By connecting these switching elements in series and parallel it is possible therefore, to route packets in more complicated ways depending on the desired routes to establish.

The future is moving to larger arrays of inputs and outputs needed in a very small space. See wafer fabrication and VLAs.

• Crossover switch
• Crossbar switch
• Clos network a non blocking crossover switch that needs fewer than N² switches
• Nonblocking minimal spanning switch and signal switching
• Optical computer

• Pattavina, Achille (1998), Switching Theory: Architecture and Performance in Broadband ATM Networks, Wiley, ISBN 0-471-96338-0