• DocumentCode
    1005812
  • Title

    A Nash game approach for OSNR optimization with capacity constraint in optical links

  • Author

    Pan, Yan ; Pavel, Lacra

  • Author_Institution
    Dept. of Electr. & Comput. Eng., Toronto Univ., Toronto, ON
  • Volume
    56
  • Issue
    11
  • fYear
    2008
  • fDate
    11/1/2008 12:00:00 AM
  • Firstpage
    1919
  • Lastpage
    1928
  • Abstract
    This paper develops a Nash game towards optimizing optical signal-to-noise ratio (OSNR) in the presence of link capacity constraint. In optical wavelength-division multiplexing (WDM) networks, all wavelength-multiplexed channels in a link share the optical fiber. In order to limit nonlinear effects, the total power launched into a fiber has to be below a nonlinearity threshold. This can be regarded as the optical link capacity constraint. We formulate an extended OSNR Nash game that incorporates this underlying system constraint. The status of an optical link is considered directly in the cost function. Sufficient conditions for existence and uniqueness of the Nash equilibrium (NE) solution are given. Two iterative algorithms for channel power control are proposed to compute the NE solution: a parallel update algorithm (PUA) and a relaxed PUA (r-PUA). Their convergence is studied under different conditions, both theoretically and numerically.
  • Keywords
    game theory; optical fibre networks; optical links; wavelength division multiplexing; Nash equilibrium; Nash game; nonlinear effects; optical fiber; optical links; optical signal-to-noise ratio; optical wavelength-division multiplexing networks; parallel update algorithm; Constraint optimization; Fiber nonlinear optics; Iterative algorithms; Nonlinear optics; Optical fiber communication; Optical fiber networks; Optical noise; Signal to noise ratio; WDM networks; Wavelength division multiplexing; Nash game; OSNR; capacity constraint; iterative control algorithms;
  • fLanguage
    English
  • Journal_Title
    Communications, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0090-6778
  • Type

    jour

  • DOI
    10.1109/TCOMM.2008.060641
  • Filename
    4686274