A Linear Programming Duality Approach to Analyzing Strictly Nonblocking d-ary Multilog Networks under General Crosstalk Constrai

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 [21] 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. We improve known results on several fronts: (a) our sufficient conditions are better than known sufficient conditions for logd(N, 0, m) to be strictly nonblocking under general crosstalk constraints, (b) our results are on d-ary multi-log networks while known results are on binary networks, and (c) for several ranges of the parameter c, ...

• Type: Conference
• Year: 2008
• Where: COCOON
• Authors: Hung Q. Ngo, Yang Wang 0014, Anh Le
• Keywords: COCOON 2008, Combinatorics, General Crosstalk Constraints, Sufficient Condition, Switching Elements