Scheduled System Maintenance:
Some services will be unavailable Sunday, March 29th through Monday, March 30th. We apologize for the inconvenience.
By Topic

GEN02-1: Hierarchical Iterative Algorithm for a Coupled Constrained OSNR Nash Game

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

The purchase and pricing options are temporarily unavailable. Please try again later.
1 Author(s)
Pavel, L. ; Dept. of Electr. & Comput. Eng., Univ. of Toronto, Toronto, ON

This paper develops a hierarchical iterative OSNR algorithm based on a game theory framework. A Nash game is formulated between channels with channel utility related to maximizing channel optical signal-to-noise ratio (OSNR). The OSNR game has coupled utilities and coupled constraints, such that total power is kept below the nonlinearity threshold. Solving directly this game requires coordination among all channels and is impractical in networks. A duality approach is used instead, based on the recent theoretical results in [16]. This method offers a natural way to hierarchically decompose the coupled Nash game into a lower-level Nash game with no coupled constraints, and a higher-level link optimization problem for pricing parameters. The lower-level Nash game is analytically tractable, and its solution can be iteratively found via an algorithm decentralized with respect to channels. The price is adjusted at the network higher-level so that channels are induced to cooperate towards satisfying the coupled total power constraint.

Published in:

Global Telecommunications Conference, 2006. GLOBECOM '06. IEEE

Date of Conference:

Nov. 27 2006-Dec. 1 2006