Skip to main content
Log in

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

  • Published:
Journal of Combinatorial Optimization Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  • Chen H-B, Hwang FK (2006) On multicast rearrangeable 3-stage close networks without first-stage fan-out. SIAM J Discrete Math 20(2):287–290

    Article  MathSciNet  Google Scholar 

  • Chinni V, Huang T, Wai P-K, Menyuk C, Simonis G (1995) Crosstalk in a lossy directional coupler switch. J Lightwave Technol 13(7):1530–1535

    Article  Google Scholar 

  • Hwang FK (1998a) Choosing the best log 2(n,m,p) strictly nonblocking networks. IEEE Trans Commun 46(12):454–455

    Article  Google Scholar 

  • Hwang FK (1998b) The mathematical theory of nonblocking switching networks. World Scientific, River Edge

    MATH  Google Scholar 

  • Hwang FK, Lin B-C (2003) Wide-sense nonblocking multicast log 2(n,m,p) networks. IEEE Trans Commun 51(10):1730–1735

    Article  Google Scholar 

  • Hwang FK, Wang Y, Tan J (2007) Strictly nonblocking f-cast log  d (n,m,p) networks. IEEE Trans Commun 55(5):981–986

    Article  Google Scholar 

  • Jiang X, Pattavina A, Horiguchi S (2008) Rearrangeable f-cast multi-log 2 N networks. IEEE Trans Commun 56(11):1929–1938

    Article  Google Scholar 

  • Jiang X, Shen H, ur Rashid Khandker MM, Horiguchi S (2003) Blocking behaviors of crosstalk-free optical banyan networks on vertical stacking. IEEE/ACM Trans Netw 11(6):982–993

    Article  Google Scholar 

  • Kabacinski W, Danilewicz G (2002) Wide-sense and strict-sense nonblocking operation of multicast multi-log 2 n switching networks. IEEE Trans Commun 50(6):1025–1036

    Article  Google Scholar 

  • Lea C-T (1990) Multi-log 2 n networks and their applications in high speed electronic and photonic switching systems. IEEE Trans Commun 38(10):1740–1749

    Article  Google Scholar 

  • Lea C-T, Shyy D-J (1991) Tradeoff of horizontal decomposition versus vertical stacking in rearrangeable nonblocking networks. IEEE Trans Commun 39:899–904

    Article  Google Scholar 

  • Li D (1993) Elimination of crosstalk in directional coupler switches. Optical Quantum Electron 25(4):255–260

    Article  Google Scholar 

  • Maier G, Pattavina A (2001) Design of photonic rearrangeable networks with zero first-order switching-element-crosstalk. IEEE Trans Commun 49(7):1248–1279

    Article  Google Scholar 

  • Mukherjee B (1997) Optical communication networks. McGraw-Hill, New York

    Google Scholar 

  • Ngo HQ, Du D-Z (2001) Notes on the complexity of switching networks. In: Du D-Z, Ngo HQ (eds) Advances in switching networks. Network theory and applications, vol 5. Kluwer Academic, Dordrecht, pp 307–367

    Google Scholar 

  • Nguyen T-N, Ngo HQ, Wang Y (2008) Strictly nonblocking f-cast photonic switching networks under general crosstalk constraints. In: Proceedings of the 2008 IEEE global communications conference, GLOBECOM, New Orleans, LA, USA, Dec 2008. IEEE, New York, pp 2807–2811

    Google Scholar 

  • Pattavina A, Tesei G (2005) Non-blocking conditions of multicast three-stage interconnection networks. IEEE Trans Commun 46(4):163–170

    MATH  MathSciNet  Google Scholar 

  • Shyy D-J, Lea C-T (1991) log 2(n,m,p) strictly nonblocking networks. IEEE Trans Commun 39(10):1502–1510

    Article  MATH  Google Scholar 

  • Stern TE, Bala K (1999) Multiwavelength optical networks: a layered approach. Prentice Hall, Upper Saddle River

    Google Scholar 

  • Vaez M, Lea C-T (1998) Wide-sense nonblocking Banyan-type switching systems based on directional couplers. IEEE J Select Areas Commun 16(7):1327–1332

    Article  Google Scholar 

  • Vaez MM, Lea C-T (2000) Strictly nonblocking directional-coupler-based switching networks under crosstalk constraint. IEEE Trans Commun 48(2):316–323

    Article  Google Scholar 

  • Wang Y, Ngo HQ, Jiang X (2008) Strictly nonblocking f-cast d-ary multilog networks under fanout and crosstalk constraints. In: Proceedings of the 2008 international conference on communications (ICC) Beijing, China, 2008. IEEE, New York, pp 5407–5411

    Chapter  Google Scholar 

  • Wu J-C, Tsai T-L (2006) Low complexity design of a wavelength-selective switch using Raman amplifiers and directional couplers. In: GLOBECOM

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Hung Q. Ngo.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ngo, H.Q., Le, A. & Wang, Y. A linear programming duality approach to analyzing strictly nonblocking d-ary multilog networks under general crosstalk constraints. J Comb Optim 21, 108–123 (2011). https://doi.org/10.1007/s10878-009-9240-y

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10878-009-9240-y

Keywords

Navigation