A linear programming duality approach to analyzing strictly nonblocking d‐ary multilog networks under general crosstalk constraints

When a switching network topology is used for constructing optical cross‐connects, as in the circuit switching case, no two routes are allowed to share a link. However, if two routes share too many switching elements, then crosstalk introduced at those switching elements degrades signal quality. Vaez and Lea (2000) introduced a parameter c which is the maximum number of distinct switching elements a route can share with other routes in the network. This is called the general crosstalk constraint. This paper presents a new method of analyzing strictly nonblocking multi‐log networks under this general crosstalk constraint using linear programming duality.