A general construction for nonblocking crosstalk-free photonic switching networks

Abstract

The graph representation G(M) of a multistage network M is well-known. Lea observed that link-disjoint paths in M correspond to node-disjoint paths in G(M). He proposed G(M) as a network by treating nodes as crossbars to transfer the node-disjoint property to the corsstalk-free property essential for photonic net-works using directional couplers as components. However, such a network has its peculiarities and is not the commonly used type. In this paper we use the same principle to establish the crosstalk-free property for the popular Log(2)(N,k,p) network.