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

Hung Q. Ngo (), Anh Le () and Yang Wang ()
Additional contact information
Hung Q. Ngo: State University of New York at Buffalo
Anh Le: State University of New York at Buffalo
Yang Wang: State University of New York at Buffalo

Journal of Combinatorial Optimization, 2011, vol. 21, issue 1, No 7, 108-123

Abstract: Abstract 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 (IEEE Trans. Commun. 48:(2)316–323, 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. We improve known results on several fronts: (a) our sufficient conditions are better than known sufficient conditions for log d (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, we give the first known necessary conditions for this problem which also match our sufficient conditions from the LP-duality approach. One important advantage of the LP-duality approach is the ease and brevity of sufficiency proofs. All one has to do is to verify that a solution is indeed dual-feasible and the dual-objective value automatically gives us a sufficient condition. Earlier works on this problem relied on combinatorial arguments which are quite intricate and somewhat error-prone.

Keywords: Strictly nonblocking; Optical switches; d-ary multi-log switching networks; General crosstalk constraint; Crosstalk-free; Linear programming duality (search for similar items in EconPapers)
Date: 2011
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-009-9240-y Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:21:y:2011:i:1:d:10.1007_s10878-009-9240-y

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-009-9240-y

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().